β Scribed by A. Udaya Shankar (auth.)
No coin nor oath required. For personal study only.
Distributed Programming: Theory and Practice presents a practical and rigorous method to develop distributed programs that correctly implement their specifications. The method also covers how to write specifications and how to use them. Numerous examples such as bounded buffers, distributed locks, message-passing services, and distributed termination detection illustrate the method. Larger examples include data transfer protocols, distributed shared memory, and TCP network sockets.
Distributed Programming: Theory and Practice bridges the gap between books that focus on specific concurrent programming languages and books that focus on distributed algorithms. Programs are written in a "real-life" programming notation, along the lines of Java and Python with explicit instantiation of threads and programs. Students and programmers will see these as programs and not "merely" algorithms in pseudo-code. The programs implement interesting algorithms and solve problems that are large enough to serve as projects in programming classes and software engineering classes. Exercises and examples are included at the end of each chapter with on-line access to the solutions.
Distributed Programming: Theory and Practice is designed as an advanced-level text book for students in computer science and electrical engineering. Programmers, software engineers and researchers working in this field will also find this book useful.
Front Matter....Pages i-xviii
Introduction....Pages 1-39
Simple Lock....Pages 41-61
Bounded Buffer....Pages 63-87
Message-Passing Services....Pages 89-110
Fifo Channels from Unreliable Channels....Pages 111-139
Programs, Semantics and Effective Atomicity....Pages 141-171
Implements and Compositionality....Pages 173-189
SESF for Time-Constrained Programs....Pages 191-206
Lock Using Petersonβs Algorithm....Pages 207-212
Lock Using the Bakery Algorithm....Pages 213-224
Distributed Lock Service....Pages 225-229
Distributed Lock Using Timestamps....Pages 231-247
Channel with Termination Detection Service....Pages 249-253
Termination Detection for Diffusing Computations....Pages 255-267
Object-Transfer Service....Pages 269-275
Object Transfer Using Path Reversal....Pages 277-298
Distributed Shared Memory Service....Pages 299-303
A Single-Copy Distributed Shared Memory....Pages 305-312
A Multi-copy Distributed Shared Memory....Pages 313-320
Reliable Transport Service....Pages 321-340
Reliable Transport Protocol....Pages 341-369
Back Matter....Pages 371-383
Computer Communication Networks; Programming Techniques; Software Engineering; Models and Principles; Logics and Meanings of Programs
π SIMILAR VOLUMES
<p>This text comprises the edited collection of papers presented at the NATO Advanced Study Institute which took place at Altmyunus,</p>
Distributed systems are now in use in a wide range of computer applications and are being considered as a "first candidate" whenever a new application emerges. Although some of the design and implementation principles of such systems have been widely understood and accepted there are still some issu
