Scheduling for Parallel Processing

1. Front Matter

   Pages i-xiii

   PDF

2. Introduction

   • Maciej Drozdowski

   Pages 1-7

3. Basics

   • Maciej Drozdowski

   Pages 9-29

4. Vision of Scheduling in Parallel Systems

   • Maciej Drozdowski

   Pages 31-54

5. Classic Scheduling Theory

   • Maciej Drozdowski

   Pages 55-86

6. Parallel Tasks

   • Maciej Drozdowski

   Pages 87-208

7. Scheduling with Communication Delays

   • Maciej Drozdowski

   Pages 209-299

8. Divisible Loads

   • Maciej Drozdowski

   Pages 301-365

9. Back to Scheduling Models

   • Maciej Drozdowski

   Pages 367-377

10. Back Matter

    Pages 379-386

    PDF

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.

• Notation
• Parallel Processing
• Processing
• Resource Management
• Scheduling Models
• algorithms
• complexity
• complexity theory
• linear optimization
• management
• operating system
• parallel computing
• performance
• scheduling
• algorithm analysis and problem complexity

From the reviews:

“It will be useful not only to researchers in the fields of applied mathematics and computer science (CS), but also to researchers in other fields who want to develop parallel algorithms and applications. … Overall, this unique book combines the characteristics of a teaching tool and a reference. … The comprehensive bibliography, helpful notation sections, and clear style make it a valuable resource for scientists and engineers in other fields too, including computational physics and computational chemistry.” (Alexander Izanov, ACM Computing Reviews, September, 2010)

“The book presents in a systematical way the interdisciplinary subject of scheduling for parallel processing. … The text is addressed to researchers in parallel computing and applied mathematics. It can be used for advanced lectures in parallel computing. The algorithms that are presented may be interesting for developers of parallel applications. Many of them are based on heuristics for solving hard combinatorial problems.” (Dana Petcu, Zentralblatt MATH, Vol. 1187, 2010)

• Inst. Computing Science, Poznan University of Technology, Poznan, Poland

  Maciej Drozdowski

Policies and ethics