Bibliography

[AEA91]

D. Agrawal and A. El-Abbadi. An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Trans. Comput. Syst., 9(1):1-20, February 1991.

[AM G03]

R. Atreya, N. Mittal, and V. K. Garg. Detecting locally stable predicates without modifying application messages. In Proc. Intnatl. Conf. on Principles of Distributed Systems, La Martinique, France, December 2003.

[Ang80]

D. Angluin. Local and global properties in networks of processors. In Proc. of the 12th ACM Symp. on Theory of Computing, pages 82 93, 1980.

[AW98]

H. Attiya and J. Welch. Distributed Computing - Fundamentals, Simulations and Advanced Topics. McGraw Hill, Berkshire, SL6 2QL, England, 1998.

[Awe85]

B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32(4):804- 823, October 1985.

[Bar96]

V. Barbosa. An Introduction to Distributed Algorithms. The MIT Press, Cambridge, MA, 1996.

[BJ87]

K. P. Birman and T. A. Joseph. Reliable communication in the presence of failures. ACM Trans. Comput. Syst., 5(1):47-76, 1987.

[BN84]

A. D. Birrell and B. J. Nelson. Implementing remote procedure calls. ACM Trans. Comput. Syst., 2(1):39-59, February 1984.

[Bou87]

L. Bouge. Repeated snapshots in distributed systems with synchronous communication and their implementation in CSP. Theoretical Computer Science, 49:145-169, 1987.

[Bur80]

J. Burns. A formal model for message passing systems. Technical Report TR-91, Indiana University, 1980. Department of Computer Science. ...

Get Concurrent and Distributed Computing in Java now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.