Table of Contents

Introduction.- Simple Lock.- Bounded Buffer.- Message-Passing Services.- Fifo Channels from Unreliable Channels.- Programs, Semantics and Effective Atomicity.- Implements and Compositionality.- SESF for Time-Constrained Programs.- Lock using Peterson's Algorithm.- Lock using the Bakery Algorithm.- Distributed Lock Service.- Distributed Lock using Timestamps.- Channel with Termination Detection Service.- Termination Detection for Diffusing Computations.- Object-Transfer Service.- Object Transfer using Path Reversal.- Distributed Shared Memory Service.- A Single-Copy Distributed Shared Memory.- A Multi-Copy Distributed Shared Memory.- Reliable Transport Service.- Reliable Transport Protocol.

Reviews

From the reviews:“This book is about how to write software for distributed systems while ensuring correctness. … This book intends to come out with a practical methodology for writing correct parallel programs. … The text covers most of the classic parallel programming topics like lock, message passing, bounded buffers, etc. It is addressed to researchers and students in parallel computing and can also be used by software professionals as a hands on writing correct parallel software.” (Corneliu Bârsan, zbMATH, Vol. 1276, 2014)“As a textbook, it presents a thorough introduction to distributed programming in a language-agnostic framework based on assertional reasoning and supported by temporal logic. … As a reference book, Distributed Programming provides a set of fundamental concepts and their applications in a compact, straightforward format. The formalism introduced in the book is easy to grasp and provides a good template for language independence … . Summing Up: Recommended. Upper-division undergraduates, graduate students, researchers/faculty, and professionals.” (L. Benedicenti, Choice, Vol. 51 (1), September, 2013)