Some efficient solutions to the affine scheduling problem. II: Multidimensional time

DOI10.1007/BF01379404zbMath0808.90081OpenAlexW2983923412MaRDI QIDQ1322507

Paul Feautrier

Publication date: 5 May 1994

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01379404

zbMATH Keywords

parallel complexityparallelizing compilersloop nestsdivide and conqueraffine scheduleautomatic parallelism detectionmultidimensional schedules

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel numerical computation (65Y05) Distributed algorithms (68W15)

Related Items (11)

Generation of parallel synchronization-free tiled code ⋮ Scalable and structured scheduling ⋮ Affine scheduling on bounded convex polyhedric domains is asymptotically optimal ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques ⋮ Quantifier elimination in automatic loop parallelization ⋮ ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS ⋮ Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs ⋮ On loop transformations of nested loops with affine dependencies ⋮ Ranking Functions for Linear-Constraint Loops

Uses Software

• PipLib

Cites Work

• Unnamed Item
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Optimal code parallelization using unimodular transformations
• Dataflow analysis of array and scalar references
• Parametric integer programming
• Automatic translation of FORTRAN programs to vector form

This page was built for publication: Some efficient solutions to the affine scheduling problem. II: Multidimensional time