Distributed Computing

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Sense of direction in distributed computing
3. Altmetric Badge
   Chapter 2 Top-down considerations on distributed computing
4. Altmetric Badge
   Chapter 3 Inter-task co-ordination in long-lived distributed applications
5. Altmetric Badge
   Chapter 4 Seamlessly selecting the best copy from internet-wide replicated web servers
6. Altmetric Badge
   Chapter 5 Wait-free synchronization in quantum-based multiprogrammed systems
7. Altmetric Badge
   Chapter 6 Computing in totally anonymous asynchronous shared memory systems
8. Altmetric Badge
   Chapter 7 Transient fault detectors
9. Altmetric Badge
   Chapter 8 Directed virtual path layouts in ATM networks
10. Altmetric Badge
    Chapter 9 A decision-theoretic approach to reliable message delivery
11. Altmetric Badge
    Chapter 10 Propagation and leader election in a multihop broadcast environment
12. Altmetric Badge
    Chapter 11 The arrow distributed directory protocol
13. Altmetric Badge
    Chapter 12 Efficient Byzantine agreement secure against general adversaries
14. Altmetric Badge
    Chapter 13 Long-lived, fast, waitfree renaming with optimal name space and high throughput
15. Altmetric Badge
    Chapter 14 The compactness of interval routing for almost all graphs
16. Altmetric Badge
    Chapter 15 A wait-free classification of loop agreement tasks
17. Altmetric Badge
    Chapter 16 A stabilizing repair timer
18. Altmetric Badge
    Chapter 17 Java: Memory consistency and process coordination
19. Altmetric Badge
    Chapter 18 A complete and constant time wait-free implementation of CAS from LL/SC and vice versa
20. Altmetric Badge
    Chapter 19 Failure detection and consensus in the crash-recovery model
21. Altmetric Badge
    Chapter 20 A more committed quorum-based three phase commit protocol
22. Altmetric Badge
    Chapter 21 Multicast group communication as a base for a load-balancing replicated data service
23. Altmetric Badge
    Chapter 22 Efficient deadlock-free multi-dimensional interval routing in interconnection networks
24. Altmetric Badge
    Chapter 23 A new protocol for efficient cooperative transversal Web caching
25. Altmetric Badge
    Chapter 24 Fairness of shared objects
26. Altmetric Badge
    Chapter 25 Optimistic Atomic Broadcast
27. Altmetric Badge
    Chapter 26 Approximate agreement with mixed mode faults: Algorithm and lower bound
28. Altmetric Badge
    Chapter 27 Using remote access histories for thread scheduling in distributed shared memory systems
29. Altmetric Badge
    Chapter 28 The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
30. Altmetric Badge
    Chapter 29 Lifetime based consistency protocols for distributed objects
31. Altmetric Badge
    Chapter 30 Deriving a scalable algorithm for mutual exclusion
32. Altmetric Badge
    Chapter 31 OFC: A distributed fossil-collection algorithm for Time-Warp