Principles of Distributed Systems

1. Front Matter

   Pages i-xvii

   PDF

2. Introduction to Distributed Systems

   • Vijay K. Garg

   Pages 1-10

3. Time

   • Vijay K. Garg

   Pages 11-47

4. Mutual Exclusion

   • Vijay K. Garg

   Pages 49-70

5. Global State

   • Vijay K. Garg

   Pages 71-84

6. Possible Global Predicates

   • Vijay K. Garg

   Pages 85-95

7. Conjunctive Possible Global Predicates

   • Vijay K. Garg

   Pages 97-136

8. Relational Possible Global Predicates

   • Vijay K. Garg

   Pages 137-164

9. Inevitable Global Predicates

   • Vijay K. Garg

   Pages 165-177

10. Control Flow Predicates

    • Vijay K. Garg

    Pages 179-190

11. Order

    • Vijay K. Garg

    Pages 191-212

12. Computation

    • Vijay K. Garg

    Pages 213-246

13. Back Matter

    Pages 247-254

    PDF

Distributed computer systems are now widely available but, despite a number of recent advances, the design of software for these systems remains a challenging task, involving two main difficulties: the absence of a shared clock and the absence of a shared memory. The absence of a shared clock means that the concept of time is not useful in distributed systems. The absence of shared memory implies that the concept of a state of a distributed system also needs to be redefined. These two important concepts occupy a major portion of this book.
Principles of Distributed Systems describes tools and techniques that have been successfully applied to tackle the problem of global time and state in distributed systems. The author demonstrates that the concept of time can be replaced by that of causality, and clocks can be constructed to provide causality information. The problem of not having a global state is alleviated by developing efficient algorithms for detecting properties and computing global functions.
The author's major emphasis is in developing general mechanisms that can be applied to a variety of problems. For example, instead of discussing algorithms for standard problems, such as termination detection and deadlocks, the book discusses algorithms to detect general properties of a distributed computation. Also included are several worked examples and exercise problems that can be used for individual practice and classroom instruction.
Audience: Can be used to teach a one-semester graduate course on distributed systems. Also an invaluable reference book for researchers and practitioners working on the many different aspects of distributed systems.

• algorithms
• computer
• design
• distributed systems
• functions
• software

• Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, USA

  Vijay K. Garg

Policies and ethics