Compiler algorithms for synchronization
IEEE Transactions on Computers
A framework for unifying reordering transformations
A framework for unifying reordering transformations
Some efficient solutions to the affine scheduling problem: I. One-dimensional time
International Journal of Parallel Programming
The Omega Library interface guide
The Omega Library interface guide
Compiler optimizations for parallel loops with fine-grained synchronization
Compiler optimizations for parallel loops with fine-grained synchronization
Transitive closure of infinite graphs and its applications
International Journal of Parallel Programming - Special issue: selected papers from the eighth international workshop on languages and compilers for parallel computing
Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
Theoretical Computer Science - Special issue on parallel computing
An affine partitioning algorithm to maximize parallelism and minimize communication
ICS '99 Proceedings of the 13th international conference on Supercomputing
Removal of Redundant Dependences in DOACROSS Loops with Constant Dependences
IEEE Transactions on Parallel and Distributed Systems
Constructive Methods for Scheduling Uniform Loop Nests
IEEE Transactions on Parallel and Distributed Systems
An Exact Method for Analysis of Value-based Array Data Dependences
Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing
On the Optimality of Feautrier's Scheduling Algorithm
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs
PACT '96 Proceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques
Code Generation in the Polyhedral Model Is Easier Than You Think
Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques
A practical automatic polyhedral parallelizer and locality optimizer
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Extracting both affine and non-linear synchronization-free slices in program loops
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
| Hi-index | 0.00 |
An approach is presented permitting us to build free scheduling for statement instances of affine loops. Under the free schedule, loop statement instances are executed as soon as their operands are available. To describe and implement the approach, the dependence analysis by Pugh and Wonnacott was chosen where dependences are found in the form of tuple relations. The proposed algorithm has been implemented and verified by means of the Omega project software. Results of experiments with the NAS benchmark suite are discussed. Speed-up and efficiency of parallel code produced by means of the approach are studied. Problems to be resolved in order to enhance the power of the presented technique are outlined.