The parallel execution of DO loops
From MaRDI portal
Publication:5180827
DOI10.1145/360827.360844zbMath0273.68012OpenAlexW2164890169MaRDI QIDQ5180827
Publication date: 1974
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/360827.360844
Related Items (38)
A singular loop transformation framework based on non-singular matrices ⋮ Advanced Regular Array Design ⋮ PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS ⋮ Parallel-loop-execution technology for implementation on vector processor ⋮ Data dependence and its application to parallel processing ⋮ Partitioning and mapping of nested loops for linear array multicomputers ⋮ Synthesis and equivalence of concurrent systems ⋮ Parallel scheduling of recursively defined arrays ⋮ A NEW APPROACH TO FINDING OPTIMAL LINEAR SCHEDULES FOR UNIFORM DEPENDENCE ALGORITHMS† ⋮ Parallel execution of general loops by the pyramid method ⋮ Locally recursive non-locally asynchronous algorithms for stencil computation ⋮ Semantic-aware automatic parallelization of modern applications using high-level abstractions ⋮ An algorithm for maximum desequencing of repetition-free loops ⋮ A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems ⋮ Methods and means of parallel processing of information ⋮ A theory of compaction-based parallelization ⋮ COMBINING BACKGROUND MEMORY MANAGEMENT AND REGULAR ARRAY CO-PARTITIONING, ILLUSTRATED ON A FULL MOTION ESTIMATION KERNEL ⋮ ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS ⋮ COMPILE TIME PARTITIONING OF NESTED LOOP ITERATION SPACES WITH NON-UNIFORM DEPENDENCES* ⋮ Dataflow analysis of array and scalar references ⋮ EFFECTIVE PARALLELIZATION TECHNIQUES FOR LOOP NESTS WITH NON-UNIFORM DEPENDENCES ⋮ Some efficient solutions to the affine scheduling problem. I: One- dimensional time ⋮ On high-speed computing with a programmable linear array ⋮ On loop transformations of nested loops with affine dependencies ⋮ Automatic implementation of affine iterative algorithms: Design flow and communication synthesis ⋮ On the optimality of Feautrier's scheduling algorithm ⋮ Construction of optimal algorithms for mass computations in digital filtering problems ⋮ Automatic Parallelization and Optimization of Programs by Proof Rewriting ⋮ Loop skewing: the wavefront method revisited ⋮ Paralleling of programs for multiprocessor computer systems ⋮ The parallel execution of loops: The parallelepiped method ⋮ Optimal systolic array algorithms for tensor product ⋮ LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS ⋮ Macroconveyor computations of functions on data structures ⋮ Parallel execution of loops: The pyramid method ⋮ Multicore-Optimized Wavefront Diamond Blocking for Optimizing Stencil Updates ⋮ On the efficiency of a SOR-like method suited to vector processors ⋮ Parallel algorithm for computing points on a computation front hyperplane
This page was built for publication: The parallel execution of DO loops
