A scalable method for run-time loop parallelization

No abstract is available for this paper.

• Publication year

  1995

• Venue

  International journal of parallel programming

• Publication date

  1995-12-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/BF02577866
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Speculative run-time parallelization of loops with privatization and reduction parallelization

  1995cited by this paper
• An efficient algorithm for exploiting multiple arithmetic units

  1995cited by this paper
• Parallelizing while loops for multiprocessor systems

  1995cited by this paper
• Run-time methods for parallelizing partially parallel loops

  1995cited by this paper
• An efficient algorithm for the run-time parallelization of DOACROSS loops

  1994cited by this paper
• Autoscheduling in a Distributed Shared-Memory Environment

  1994cited by this paper
• Massively parallel methods for engineering and science problems

  1994cited by this paper
• The privatizing DOALL test: a run-time technique for DOALL loop identification and array privatization

  1994cited by this paper
• Automatic Array Privatization

  1993cited by this paper
• Array privatization for shared and distributed memory machines (extended abstract)

  1993cited by this paper
• Improving the performance of runtime parallelization

  1993cited by this paper
• Parallel algorithms for graph problems

  1992cited by this paper
• Performance Analysis of Parallelizing Compilers on the Perfect Benchmarks Programs

  1992cited by this paper
• Data Dependence and Data-Flow Analysis of Arrays

  1992cited by this paper
• Array privatization for parallel execution of loops

  1992cited by this paper
• Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)

  1992cited by this paper
• Runtime Compilation Methods for Multicomputers

  1991cited by this paper
• An Effectiveness Study of Parallelizing Compiler Techniques

  1991cited by this paper
• Experience in the Automatic Parallelization of Four Perfect-Benchmark Programs

  1991cited by this paper
• Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes

  1991cited by this paper
• A manual for PARTI runtime primitives

  1990cited by this paper
• Supercompilers for parallel and vector computers

  1990cited by this paper
• Efficient parallel algorithms for graph problems

  1990cited by this paper
• The Preprocessed Doacross Loop

  1990cited by this paper
• Run-time parallelization and scheduling of loops

  1989cited by this paper
• The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers

  1989cited by this paper
• The doconsider loop

  1989cited by this paper
• Automatic generation of nested, fork-join parallelism

  1989cited by this paper
• An approach to synchronization for parallel computing

  1988cited by this paper
• Cedar Fortran and other vector and parallel Fortran dialects

  1988cited by this paper
• Compiler Optimizations for Enhancing Parallelism and Their Impact on Architecture Design

  1988cited by this paper
• Dependence analysis for supercomputing

  1988influential reference
• Compiler Algorithms for Synchronization

  1987influential reference
• A Scheme to Enforce Data Dependence on Large Multiprocessor Systems

  1987cited by this paper
• Advanced compiler optimizations for supercomputers

  1986cited by this paper
• A pipelined, shared resource MIMD computer

  1986cited by this paper
• CEDAR: a large scale multiprocessor

  1983cited by this paper
• Dependence graphs and compiler optimizations

  1981cited by this paper
• MA28 --- A set of Fortran subroutines for sparse unsymmetric linear equations

  1980cited by this paper
• Experience Using Multiprocessor Systems—A Status Report

  1980cited by this paper
• Design of a Computer: The Control Data 6600

  1970cited by this paper

• Acceleration of lattice models for pricing portfolios of fixed-income derivatives

  2021cites this paper
• Report of the Workshop on Program Synthesis for Scientific Computing

  2021cites this paper
• PROGRAMSYNTHESIS FOR SCIENTIFIC COMPUTING

  2021cites this paper
• A Conflict-free Scheduler for High-performance Graph Processing on Multi-pipeline FPGAs

  2020cites this paper
• Sparse computation data dependence simplification for efficient compiler-generated inspectors

  2019cites this paper
• Efficient parallel determinacy race detection for two-dimensional dags

  2018cites this paper
• Sparse Matrix Code Dependence Analysis Simplification at Compile Time

  2018cites this paper
• The Sparse Polyhedral Framework: Composing Compiler-Generated Inspector-Executor Code

  2018cites this paper
• Runtime-adaptive generalized task parallelism

  2017cites this paper
• Redesigning OP2 Compiler to Use HPX Runtime Asynchronous Techniques

  2017cites this paper
• Compiler and Runtime Optimization Techniques for Implementation Scalable Parallel Applications

  2017cites this paper
• Runtime Optimization of Binary Through Vectorization Transformations. (Optimisation de binaire à l'exécution par la vectorisation)

  2017cites this paper
• HPX Smart Executors

  2017cites this paper
• An Integrated Compiler and Runtime Framework for Sparse Matrix Codes

  2016cites this paper
• Speculatively exploiting cross-invocation parallelism

  2016cites this paper
• Automating Wavefront Parallelization for Sparse Matrix Computations

  2016cites this paper
• Fast and flexible compilation techniques for effective speculative polyhedral parallelization

  2016cites this paper
• Beyond the realm of the polyhedral model : combining speculative program parallelization with polyhedral compilation

  2015cites this paper
• Distributed memory code generation for mixed Irregular/Regular computations

  2015cites this paper
• JolokiaC++: Optimizing Irregular Accesses for GPGPU

  2015cites this paper
• AUTOMATIC EXPLOITATION OF

  2015cites this paper
• An Approach for Proving the Correctness of Inspector/Executor Transformations

  2014cites this paper
• JolokiaC++: An Annotation Based Compiler Framework for GPGPUs

  2014cites this paper
• Bounds Checking: An Instance of Hybrid Analysis

  2014cites this paper
• CPU-GPU System Designs for High Performance Cloud Computing

  2014cites this paper
• The potential of polyhedral optimization: An empirical study

  2013cites this paper
• The Potential of Polyhedral Optimization

  2013cites this paper
• High performance optimizations in runtime speculative parallelization for multicore architectures

  2013cites this paper
• Automatically exploiting cross-invocation parallelism using runtime information

  2013cites this paper
• Automatic Parallelization for GPUs

  2013cites this paper
• Runtime dependence computation and execution of loops on heterogeneous systems

  2013cites this paper
• General data structure expansion for multi-threading

  2013cites this paper
• A System for Flexible Parallel Execution

  2012cites this paper
• Logical inference techniques for loop parallelization

  2012influential citation
• Automatic Discovery and Exposition of Parallelism in Serial Applications for Compiler-Inserted Runtime Adaptation

  2012cites this paper
• Set and Relation Manipulation for the Sparse Polyhedral Framework

  2012cites this paper
• Parcae: a system for flexible parallel execution

  2012cites this paper
• Dynamically managed data for CPU-GPU architectures

  2012cites this paper
• Just in Time Load Balancing

  2012cites this paper
• A Hybrid Approach to Proving Memory Reference Monotonicity

  2011cites this paper
• Static and dynamic methods of polyhedral compilation for an efficient execution in multicore environments

  2011cites this paper
• Double Inspection for Run-Time Loop Parallelization

  2011cites this paper
• Automatic CPU-GPU communication management and optimization

  2011cites this paper
• Speculative Parallelization of Loops

  2011cites this paper
• Cooperative parallelization

  2011cites this paper
• Exploiting Parallelism with Dependence-Aware Scheduling

  2009influential citation
• A lightweight in-place implementation for software thread-level speculation

  2009cites this paper
• Run-Time Parallelization Requires Static Compiler Analysis

  2007cites this paper
• Run-time Parallelization Techniques for Sparse Applications

  2007cites this paper
• A Unified Approach to Speculative Parallelization of Loops in DSM Multiprocessors

  2007cites this paper
• SmartApps: middle-ware for adaptive applications on reconfigurable platforms

  2006cites this paper
• An Efficient Parallel Scheme for Run-Time Scheduling

  2006cites this paper
• Predecessor/successor approach for high-performance run-time wavefront scheduling

  2006cites this paper
• Generating OpenMP code using an interactive parallelization environment

  2005cites this paper
• Non-uniform Dependences Partitioned by Recurrence Chains Conference Item Non-uniform Dependences Partitioned by Recurrence Chains

  year unknowncites this paper