zbMATH — the first resource for mathematics

Parallel program design. A foundation. (English) Zbl 0717.68034
Reading, MA: Addison-Wesley. XVIII, 516 p. DM 79.00 (1988).
This extensive monograph considers all aspects of parallel program design including the architecture of parallel computers. Starting with an introduction to UNITY programs the reader learns in the first chapters the basic theory necessary to read the following chapters. This introduction includes a programming logic and some comments on program schemes and circuits. The first part finishes with an extensive study of the shortest path problem. The next chapter presents a variety of examples from different parts of mathematics and computer science.
Chapter 7 and 8 build the next block. A general chapter on program structuring is followed by an application to communication processes.
Chapters 9 to 16 treat problems concerning the operating system, among them termination detection, stability detection, dining philosophers and also drinking philosophers, committee coordination, mutual exclusion and garbage collection. This is one of the main parts of this book and these aspects are treated in most of the other monographs in a much shorter version.
Chapter 17 and 18 deal with fault tolerance.
Only Chapters 19 to 21 present efficient parallel algorithms. This is not enough to get an overview. Some basic techniques for parallel algorithm design are missing. In the final chapter different programming models are compared.
The monograph is written in a clear style. The book may be used for lectures. Researchers and students will make profit from studying this monograph.
Reviewer: I.Wegener

68W15 Distributed algorithms
68-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science