Chandy K.M., Misra J., Parallel Program Design. A Foundation

Addison-Wesley, 1988. — 533.This book treats all essential aspects of the theory of programming. The underlying logic is developed with elegance and rigour. It is illustrated by clear exposition of many simple examples. It is then applied, with matching elegance and simplicity, to a range of examples which have hitherto justified a reputation of baffling complexity. The authors' technique and style are worthy of imitation by all who publish descriptions of distributed algorithms.
The book will be studied with enjoyment and profit by many classes of computing scientists. Teachers will welcome it as a text for an advanced class on programming. Software engineers will use it as a handbook of methods and algorithms for the design of distributed systems. And theoreticians will find a rich source of research ideas that promise to be of relevance in the professional activity of programming.Parallelism and Programming: A Perspective
A Programming Notation
A Programming Logic
Architectures and Mappings
The First Case Study: Shortest Path
Toy Examples
Program Structuring
Communicating Processes
Termination Detection
Global Snapshots
Stability Detection
Dining Philosophers
Drinking Philosophers
Committee Coordination
Mutual Exclusion
Parallel Garbage Collection
Fault Tolerance: A Protocol for Communication over Faulty Channels
Fault Tolerance: Byzantine Agreement
Sorting
Combinatorial Search
Systolic Arrays as Programs
Alternate Programming Models
Epilog: Thoughts on Programming