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