© 2009

Scheduling for Parallel Processing

  • Presents scheduling models for parallel processing, problems defined on the grounds of certain scheduling models, and algorithms solving the scheduling problems.


Part of the Computer Communications and Networks book series (CCN)

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Maciej Drozdowski
    Pages 1-7
  3. Maciej Drozdowski
    Pages 9-29
  4. Maciej Drozdowski
    Pages 31-54
  5. Maciej Drozdowski
    Pages 55-86
  6. Maciej Drozdowski
    Pages 87-208
  7. Maciej Drozdowski
    Pages 209-299
  8. Maciej Drozdowski
    Pages 301-365
  9. Maciej Drozdowski
    Pages 367-377
  10. Back Matter
    Pages 379-386

About this book


To take full advantage of high performance computing, parallel applications must be carefully managed to guarantee quality of service and fairness in using shared resources. Scheduling for parallel computing is an interdisciplinary subject joining many fields, and the broadness of research yields an immense number and diversity of models for understanding scheduling problems.

This focused and useful book presents scheduling models for parallel processing, problems defined on the grounds of certain scheduling models, and algorithms solving the scheduling problems. As most of the scheduling problems are combinatorial in nature, the methodology of computational complexity theory is examined. Four examples of scheduling models are presented, along with problems and algorithms, before drawing conclusions on their mutual relationships. The book also provides helpful generalizations about scheduling models, their problems and algorithms.

Topics and features:

  • Introduces the fundamental scheduling concepts and clarifies the relation between scheduling models, problems, algorithms, and schedules
  • Discusses the technological aspects of scheduling for parallel processing, demonstrating how highly abstract scheduling policies are determined by the underlying hardware and software
  • Presents the notions, concepts, and algorithms that are most immediately applicable in parallel processing, including relevant aspects of classic scheduling theory
  • Examines the parallel task model, analyzing rigid, moldable, malleable tasks, and tasks with shape
  • Outlines the methodology of computational complexity theory and introduces the basic metrics of parallel application performance
  • Explores scheduling with communication delays, taking into account the costs of delays
  • Examines scheduling divisible loads in systems with limited memory, various interconnection types, and cost of usage
  • Includes detailed illustrations, a comprehensive bibliography, and a helpful notation section

This unique text will be a valuable resource for researchers in parallel computing, operating systems, management science, and applied mathematics. In addition, lecturers and advanced students needing a solid foundation about scheduling for parallel computing will find the book a critical teaching tool and reference.


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

Authors and affiliations

  1. 1.Inst. Computing SciencePoznan University of TechnologyPoznanPoland

Bibliographic information

Industry Sectors


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)