2013

Distributed Programming

Theory and Practice

Authors:

ISBN: 978-1-4614-4880-8 (Print) 978-1-4614-4881-5 (Online)

Table of contents (21 chapters)

previous Page of 2
  1. Front Matter

    Pages i-xviii

  2. No Access

    Book Chapter

    Pages 1-39

    Introduction

  3. No Access

    Book Chapter

    Pages 41-61

    Simple Lock

  4. No Access

    Book Chapter

    Pages 63-87

    Bounded Buffer

  5. No Access

    Book Chapter

    Pages 89-110

    Message-Passing Services

  6. No Access

    Book Chapter

    Pages 111-139

    Fifo Channels from Unreliable Channels

  7. No Access

    Book Chapter

    Pages 141-171

    Programs, Semantics and Effective Atomicity

  8. No Access

    Book Chapter

    Pages 173-189

    Implements and Compositionality

  9. No Access

    Book Chapter

    Pages 191-206

    SESF for Time-Constrained Programs

  10. No Access

    Book Chapter

    Pages 207-212

    Lock Using Peterson’s Algorithm

  11. No Access

    Book Chapter

    Pages 213-224

    Lock Using the Bakery Algorithm

  12. No Access

    Book Chapter

    Pages 225-229

    Distributed Lock Service

  13. No Access

    Book Chapter

    Pages 231-247

    Distributed Lock Using Timestamps

  14. No Access

    Book Chapter

    Pages 249-253

    Channel with Termination Detection Service

  15. No Access

    Book Chapter

    Pages 255-267

    Termination Detection for Diffusing Computations

  16. No Access

    Book Chapter

    Pages 269-275

    Object-Transfer Service

  17. No Access

    Book Chapter

    Pages 277-298

    Object Transfer Using Path Reversal

  18. No Access

    Book Chapter

    Pages 299-303

    Distributed Shared Memory Service

  19. No Access

    Book Chapter

    Pages 305-312

    A Single-Copy Distributed Shared Memory

  20. No Access

    Book Chapter

    Pages 313-320

    A Multi-copy Distributed Shared Memory

  21. No Access

    Book Chapter

    Pages 321-340

    Reliable Transport Service

previous Page of 2