Title
Scheduling And Automatic Parallelization,Used
Processing time: 1-3 days
US Orders Ships in: 3-5 days
International Orders Ships in: 8-12 days
Return Policy: 15-days return on defective items
Payment Option
Readership This book is devoted to the study of compiler transformations that are needed to expose the parallelism hiddenin a program. This book is notan introductory book to parallel processing, nor is it an introductory book to parallelizing compilers. Weassume thatreaders are familiar withthebooks High Performance Compilers for Parallel Computingby Wolfe [121] and Super compilers for Parallel and Vector Computers by Zima and Chapman [125], and that they want to know more about scheduling transformations. In this book we describe both task graph scheduling and loop nest scheduling. Taskgraphschedulingaims atexecuting tasks linked by prece dence constraints; it is a runtime activity. Loop nest scheduling aims at ex ecutingstatementinstances linked bydata dependences;it is a compiletime activity. We are mostly interested in loop nestscheduling, butwe also deal with task graph scheduling for two main reasons: (i) Beautiful algorithms and heuristics have been reported in the literature recently; and (ii) Several graphscheduling, like list scheduling, are the basis techniques used in task ofthe loop transformations implemented in loop nest scheduling. As for loop nest scheduling our goal is to capture in a single place the fantastic developments of the last decade or so. Dozens of loop trans formations have been introduced (loop interchange, skewing, fusion, dis tribution, etc.) before a unifying theory emerged. The theory builds upon the pioneering papers of Karp, Miller, and Winograd [65] and of Lam port [75], and it relies on sophisticated mathematical tools (unimodular transformations, parametric integer linear programming, Hermite decom position, Smithdecomposition, etc.).
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What is the main focus of 'Scheduling and Automatic Parallelization'? A: The book primarily focuses on compiler transformations that reveal parallelism in programs, specifically task graph scheduling and loop nest scheduling.
- Q: Who is the author of the book? A: The book is authored by Alain Darte.
- Q: What is the expected readership for this book? A: This book is intended for readers who are already familiar with advanced topics in parallel processing and parallelizing compilers.
- Q: What types of scheduling does the book cover? A: The book covers both task graph scheduling, which is a run-time activity, and loop nest scheduling, which is a compile-time activity.
- Q: Is this book suitable for beginners in parallel processing? A: No, this book is not suitable for beginners; it assumes prior knowledge of parallel processing and related literature.
- Q: What is the publication date of the book? A: The book was published on March 30, 2000.
- Q: How many pages does the book contain? A: The book contains 280 pages.
- Q: What edition of the book is available? A: This is the 2000 edition of 'Scheduling and Automatic Parallelization'.
- Q: What condition is the book in? A: The book is listed as being in new condition.
- Q: What category does this book fall under? A: The book is categorized under Business Technology.