Buch, Englisch, 320 Seiten, Format (B × H): 163 mm x 236 mm, Gewicht: 562 g
Buch, Englisch, 320 Seiten, Format (B × H): 163 mm x 236 mm, Gewicht: 562 g
Reihe: Wiley Series on Parallel and Distributed Computing
ISBN: 978-0-471-73576-2
Verlag: Wiley
Task scheduling for parallel systems can become a quagmire of heuristics, models, and methods that have been developed over the past decades. The author of this innovative text cuts through the confusion and complexity by presenting a consistent and comprehensive theoretical framework along with realistic parallel system models. These new models, based on an investigation of the concepts and principles underlying task scheduling, take into account heterogeneity, contention for communication resources, and the involvement of the processor in communications.
For readers who may be new to task scheduling, the first chapters are essential. They serve as an excellent introduction to programming parallel systems, and they place task scheduling within the context of the program parallelization process. The author then reviews the basics of graph theory, discussing the major graph models used to represent parallel programs. Next, the author introduces his task scheduling framework. He carefully explains the theoretical background of this framework and provides several examples to enable readers to fully understand how it greatly simplifies and, at the same time, enhances the ability to schedule.
The second half of the text examines both basic and advanced scheduling techniques, offering readers a thorough understanding of the principles underlying scheduling algorithms. The final two chapters address communication contention in scheduling and processor involvement in communications.
Each chapter features exercises that help readers put their new skills into practice. An extensive bibliography leads to additional information for further research. Finally, the use of figures and examples helps readers better visualize and understand complex concepts and processes.
Researchers and students in distributed and parallel computer systems will find that this text dramatically improves their ability to schedule tasks accurately and efficiently.
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Funktionale, Logische, Parallele und Visuelle Programmierung
- Mathematik | Informatik EDV | Informatik Technische Informatik Grid-Computing & Paralleles Rechnen
Weitere Infos & Material
Preface xi
Acknowledgments xii
1. Introduction 1
1.1 Overview 1
1.2 Organization 5
2. Parallel Systems and Programming 7
2.1 Parallel Architectures 7
2.1.1 Flynn’s Taxonomy 7
2.1.2 Memory Architectures 9
2.1.3 Programming Paradigms and Models 11
2.2 Communication Networks 13
2.2.1 Static Networks 13
2.2.2 Dynamic Networks 18
2.3 Parallelization 22
2.4 Subtask Decomposition 24
2.4.1 Concurrency and Granularity 24
2.4.2 Decomposition Techniques 25
2.4.3 Computation Type and Program Formulation 27
2.4.4 Parallelization Techniques 28
2.4.5 Target Parallel System 28
2.5 Dependence Analysis 29
2.5.1 Data Dependence 29
2.5.2 Data Dependence in Loops 32
2.5.3 Control Dependence 35
2.6 Concluding Remarks 36
2.7 Exercises 37
3. Graph Representations 40
3.1 Basic Graph Concepts 40
3.1.1 Computer Representation of Graphs 43
3.1.2 Elementary Graph Algorithms 46
3.2 Graph as a Program Model 49
3.2.1 Computation and Communication Costs 50
3.2.2 Comparison Criteria 50
3.3 Dependence Graph (DG) 51
3.3.1 Iteration Dependence Graph 53
3.3.2 Summary 55
3.4 Flow Graph (FG) 56
3.4.1 Data-Driven Execution Model 60
3.4.2 Summary 61
3.5 Task Graph (DAG) 62
3.5.1 Graph Transformations and Conversions 64
3.5.2 Motivations and Limitations 68
3.5.3 Summary 69
3.6 Concluding Remarks 69
3.7 Exercises 70
4. Task Scheduling 74
4.1 Fundamentals 74
4.2 With Communication Costs 76
4.2.1 Schedule Example 81
4.2.2 Scheduling Complexity 82
4.3 Without Communication Costs 86
4.3.1 Schedule Example 87
4.3.2 Scheduling Complexity 88
4.4 Task Graph Properties 92
4.4.1 Critical Path 93
4.4.2 Node Levels 95
4.4.3 Granularity 101
4.5 C
