Drozdowski Scheduling for Parallel Processing

1. Auflage 2010
ISBN: 978-1-84882-310-5
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 386 Seiten

Reihe: Computer Communications and Networks

Overview and Goals This book is dedicated to scheduling for parallel processing. Presenting a research ?eld as broad as this one poses considerable dif?culties. Scheduling for parallel computing is an interdisciplinary subject joining many ?elds of science and te- nology. Thus, to understand the scheduling problems and the methods of solving them it is necessary to know the limitations in related areas. Another dif?culty is that the subject of scheduling parallel computations is immense. Even simple search in bibliographical databases reveals thousands of publications on this topic. The - versity in understanding scheduling problems is so great that it seems impossible to juxtapose them in one scheduling taxonomy. Therefore, most of the papers on scheduling for parallel processing refer to one scheduling problem resulting from one way of perceiving the reality. Only a few publications attempt to arrange this ?eld of knowledge systematically. In this book we will follow two guidelines. One guideline is a distinction - tween scheduling models which comprise a set of scheduling problems solved by dedicated algorithms. Thus, the aim of this book is to present scheduling models for parallel processing, problems de?ned on the grounds of certain scheduling models, and algorithms solving the scheduling problems. Most of the scheduling problems are combinatorial in nature. Therefore, the second guideline is the methodology of computational complexity theory. Inthisbookwepresentfourexamplesofschedulingmodels. Wewillgodeepinto the models, problems, and algorithms so that after acquiring some understanding of them we will attempt to draw conclusions on their mutual relationships.

Autoren/Hrsg.

Drozdowski, Maciej

Inhaltsverzeichnis

1;Preface;6
2;Contents;10
3;Introduction;15
3.1;1.1 Field of Scheduling for Parallel Processing;15
3.2;1.2 Basic Scheduling Notions;16
3.3;1.3 Why We Need Scheduling;18
3.4;1.4 Problems, Models, Algorithms, and Schedules;19
3.5;References;21
4;Basics;22
4.1;2.1 Selected Definitions Form Graph Theory;22
4.2;2.2 Methodology of Complexity Theory;26
4.3;2.3 Solving Hard Combinatorial Problems;32
4.4;2.4 Parallel Performance Metrics;38
4.5;References;41
5;Vision of Scheduling in Parallel Systems;43
5.1;3.1 Hardware;43
5.2;3.2 Programming Environments;49
5.3;3.3 Runtime Environments;54
5.4;References;63
6;Classic Scheduling Theory;67
6.1;4.1 Definitions;67
6.2;4.2 a/ß/y Notation and Complexity Inference;71
6.3;4.3 Scheduling Parallel Processors;73
6.4;4.4 Beyond the Classics;86
6.5;4.5 Remarks on the Classic Scheduling Theory;94
6.6;References;95
7;Parallel Tasks;99
7.1;5.1 Parallel Tasks in Practice;99
7.2;5.2 Assumptions and Definitions;104
7.3;5.3 Rigid Tasks;110
7.4;5.4 Moldable Tasks;129
7.5;5.5 Malleable Tasks;142
7.6;5.6 Tasks with Hypercube Shape;151
7.7;5.7 Tasks with Mesh Shape;168
7.8;5.8 Multiprocessor Tasks;192
7.9;5.9 Concluding Remarks on Parallel Task Model;208
7.10;References;209
8;Scheduling with Communication Delays;221
8.1;6.1 Scheduling with Communication Delays in Practice;222
8.2;6.2 Formulation of the Problem;225
8.3;6.3 Extension of a/ß/y Notation;230
8.4;6.4 Limited Processor Number and No Duplication;231
8.5;6.5 Limited Processor Number and Duplication;258
8.6;6.6 Unlimited Processor Number and No Duplication;262
8.7;6.7 Unlimited Processor Number and Duplication;277
8.8;6.8 Scheduling in Processor Networks;285
8.9;6.9 Scheduling in LogP Model;287
8.10;6.10 Scheduling with Hierarchical Communication;298
8.11;6.11 Further Reading and Conclusions;303
8.12;References;305
9;Divisible Loads;312
9.1;7.1 Star - Basic Formulation;313
9.2;7.2 Interconnection Topologies;318
9.3;7.3 Multi-installment Processing;326
9.4;7.4 Memory Constraints;328
9.5;7.5 Processing Cost Optimization;336
9.6;7.6 Multiple Tasks;338
9.7;7.7 Time-Varying Environment;344
9.8;7.8 Expected Search Time;347
9.9;7.9 Steady-State Divisible Load Scheduling;348
9.10;7.10 Online Scheduling;351
9.11;7.11 Toward Discrete Load Granularity;357
9.12;7.12 DLT and Performance Evaluation;360
9.13;7.13 Divisible Loads in Practice;364
9.14;7.14 Concluding Remarks on DLT;370
9.15;References;371
10;Back to Scheduling Models;377
10.1;8.1 On Scheduling Models;377
10.2;8.2 On Scheduling Algorithms;382
10.3;8.3 It Is a Matter of Time;385
10.4;8.4 Toward Scheduling Problem Taxonomy Anyway?;386
10.5;References;387
11;Summary of the Notation;388
12;Index;390