Scheduling for parallel processing.

*(English)*Zbl 1187.68090
Computer Communications and Networks. London: Springer (ISBN 978-1-84882-309-9/hbk). xiii, 386 p. (2009).

The book presents in a systematical way the interdisciplinary subject of scheduling for parallel processing. The perspective considered in presenting the concepts is that of the scheduling models. In this context the problems and algorithms encountered in scheduling processes are defined based on several basic models. Furthermore, the author goes deeper in the computational complexity theory associated with scheduling problems.

The content of the book is organized in eight chapters, the first three presenting the basic notions, the next four examples of scheduling models, and the last one the applicability of scheduling models. In particular the second chapter introduces the notions of graph theory needed for scheduling models, as well as essential elements of the methodology of computational complexity theory. The fourth chapter discusses the classical deterministic scheduling theory, the fifth chapter the parallel task model, the sixth chapter scheduling with communication delays, and the seventh chapter scheduling divisible loads.

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.

The content of the book is organized in eight chapters, the first three presenting the basic notions, the next four examples of scheduling models, and the last one the applicability of scheduling models. In particular the second chapter introduces the notions of graph theory needed for scheduling models, as well as essential elements of the methodology of computational complexity theory. The fourth chapter discusses the classical deterministic scheduling theory, the fifth chapter the parallel task model, the sixth chapter scheduling with communication delays, and the seventh chapter scheduling divisible loads.

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.

Reviewer: Dana Petcu (Timişoara)

##### MSC:

68M20 | Performance evaluation, queueing, and scheduling in the context of computer systems |

68-02 | Research exposition (monographs, survey articles) pertaining to computer science |

68Q10 | Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) |

68Q25 | Analysis of algorithms and problem complexity |