Some efficient solutions to the affine scheduling problem. I: One- dimensional time
From MaRDI portal
Publication:687632
Recommendations
- Some efficient solutions to the affine scheduling problem. II: Multidimensional time
- On the optimality of linear schedules
- Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
- scientific article; zbMATH DE number 2079652
- Scheduling a system of nonsingular affine recurrence equations onto a processor array
Cites work
- scientific article; zbMATH DE number 3900125 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 125140 (Why is no real title available?)
- scientific article; zbMATH DE number 194119 (Why is no real title available?)
- Computability of recurrence equations
- Dataflow analysis of array and scalar references
- Mapping uniform loop nests onto distributed memory architectures
- Optimal code parallelization using unimodular transformations
- Synthesizing systolic arrays from recurrence equations
- The Organization of Computations for Uniform Recurrence Equations
- The parallel execution of DO loops
Cited in
(33)- A consistent generation of pipeline parallelism and distribution of operations and data among processors
- Finding quadratic schedules for affine recurrence equations via nonsmooth optimization
- Scheduling loops with partial loop-carried dependencies
- A method for parallelizing algorithms by vector scheduling functions
- Incremental closure for systems of two variables per inequality
- Locally recursive non-locally asynchronous algorithms for stencil computation
- Automatic array partitioning based on the Smith normal form
- Processor lower bound formulas for array computations and parametric Diophantine systems
- On the optimality of linear schedules
- ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS
- Synthesizing ranking functions for loop programs via SVM
- Some efficient solutions to the affine scheduling problem. II: Multidimensional time
- Quantifier elimination in automatic loop parallelization
- Termination analysis of programs with multiphase control-flow
- The problem of schedule construction in the joint design of hardware and software
- Scheduling on semantic solution tables
- Subspace scheduling and parallel implementation of non-systolic regular iterative algorithms
- Parallelization of sequential programs: distribution of arrays among processors and structurization of communications
- Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
- A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems
- scientific article; zbMATH DE number 2090598 (Why is no real title available?)
- Scalable and structured scheduling
- Multiphase-linear ranking functions and their relation to recurrent sets
- Heterogeneous LBM Simulation Code with LRnLA Algorithms
- Parallel scheduling of recursively defined arrays
- Piece-wise affine scheduling function
- Maximum flows in parametric graph templates
- Ranking functions for linear-constraint loops
- scientific article; zbMATH DE number 2079652 (Why is no real title available?)
- On loop transformations of nested loops with affine dependencies
- Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs
- Generation of parallel synchronization-free tiled code
- Automatic synthesis of parallel algorithms
This page was built for publication: Some efficient solutions to the affine scheduling problem. I: One- dimensional time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687632)
