Scheduling and automatic parallelization
This book deals with fundamental scheduling techniques used for program transformations in parallelizing compilers. The first part covers unidimensional scheduling problems like scheduling of directed acyclic task graphs and cyclic scheduling problems that can be modeled by cyclic task graphs. Multidimensional problems are considered in the second part with emphasis on systems of uniform recurrence equations and corresponding computability questions, nested loop dependence analysis and loop parallelization. Each chapter contains an introduction and overview over the topic. Fundamental concepts are defined clearly and the proofs are explained in detail. Exercises and bibliographical notes are provided for each chapter. The book addresses to advanced students and researchers with interest in scheduling, compilers, and foundations of automatic parallelization techniques and is suitable as a textbook for a graduate course.
- Minimization of circuit registers: Retiming revisited
- Scheduling for parallel processing
- Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
- On the complexity of loop fusion
- Locality-aware task scheduling for homogeneous parallel computing systems
- Incremental closure for systems of two variables per inequality
- Cyclic software pipelining and translation of DO-loops for tightly coupled multiprocessor systems
- Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques
- On Scheduling Policies for Streams of Structured Jobs
- Compiler Algorithms for Synchronization
- scientific article; zbMATH DE number 2030018 (Why is no real title available?)
- scientific article; zbMATH DE number 1517474 (Why is no real title available?)
- Instruction level parallelism
- Task scheduling for multi-core and parallel architectures. Challenges, solutions and perspectives
- Scheduling parallel applications on heterogeneous distributed systems
- New MIP model for multiprocessor scheduling problem with communication delays
- Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies
This page was built for publication: Scheduling and automatic parallelization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501868)
