Some efficient solutions to the affine scheduling problem. I: One- dimensional time
DOI10.1007/BF01407835zbMATH Open0783.90050MaRDI QIDQ687632FDOQ687632
Authors: Paul Feautrier 
Publication date: 20 December 1993
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
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
precedence constraintsautomatic parallelizationautomatic systolic array designclosed form schedulesparametric linear programsystems of recurrence equations
Parallel numerical computation (65Y05) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Sensitivity, stability, parametric optimization (90C31) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The parallel execution of DO loops
- The Organization of Computations for Uniform Recurrence Equations
- Dataflow analysis of array and scalar references
- Mapping uniform loop nests onto distributed memory architectures
- Title not available (Why is that?)
- Computability of recurrence equations
- Synthesizing systolic arrays from recurrence equations
- Optimal code parallelization using unimodular transformations
Cited In (33)
- Some efficient solutions to the affine scheduling problem. II: Multidimensional time
- Automatic synthesis of parallel algorithms
- Automatic array partitioning based on the Smith normal form
- A method for parallelizing algorithms by vector scheduling functions
- Incremental closure for systems of two variables per inequality
- Parallel scheduling of recursively defined arrays
- Title not available (Why is that?)
- Ranking functions for linear-constraint loops
- Scalable and structured scheduling
- Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
- A consistent generation of pipeline parallelism and distribution of operations and data among processors
- Generation of parallel synchronization-free tiled code
- Heterogeneous LBM Simulation Code with LRnLA Algorithms
- Piece-wise affine scheduling function
- Locally recursive non-locally asynchronous algorithms for stencil computation
- Quantifier elimination in automatic loop parallelization
- The problem of schedule construction in the joint design of hardware and software
- A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems
- Subspace scheduling and parallel implementation of non-systolic regular iterative algorithms
- Termination analysis of programs with multiphase control-flow
- Scheduling on semantic solution tables
- Title not available (Why is that?)
- ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS
- Maximum flows in parametric graph templates
- On the optimality of linear schedules
- Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs
- Processor lower bound formulas for array computations and parametric Diophantine systems
- Parallelization of sequential programs: distribution of arrays among processors and structurization of communications
- Multiphase-linear ranking functions and their relation to recurrent sets
- Synthesizing ranking functions for loop programs via SVM
- On loop transformations of nested loops with affine dependencies
- Finding quadratic schedules for affine recurrence equations via nonsmooth optimization
- Scheduling loops with partial loop-carried dependencies
Uses Software
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)
