Dining philosophers with crash locality 1

Proceedings - International Conference on Distributed Computing Systems

Volumn 24, Issue , 2004, Pages 22-29

  Pike, Scott M ^a   Sivilotti, Paolo A G ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; RESOURCE ALLOCATION; SYNCHRONIZATION;

ASYNCHRONOUS NETWORKS; CHANDRA-TOUEG FAILURE; CRASH-FAILURE LOCALIZATION; SYNCHRONOUS NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 2442490068     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icdcs.2004.1281564     Document Type: Conference Paper

References (17)

1. Manhoi Choy and Ambuj K. Singh, "Efficient fault tolerant algorithms for resource allocation in distributed systems," in 24th ACM Symposium on Theory of Computing, May 1992, pp. 593-602.
2. Edsger W. Dijkstra, "Co-operating sequential processes," in Programming Languages, F. Genuys, Ed., pp. 43-112. Academic Press, 1968.
3. Nancy Lynch, "Fast allocation of nearby resources in a distributed system," in 12th ACM Symp. on Theory of Computing, 1980, pp. 70-81.
4. K. Mani Chandy and Jayadev Misra, "The drinking philosopher's problem," ACM Transactions on Programming Languages and Systems, vol. 6, no. 4, pp. 632-646, Oct. 1984.
5. B. Awerbuch and M. Saks, "A dining philosophers algorithm with polynomial response time," in 31st Annual Symposium on Foundations of Computer Science, IEEE, Ed., 1990, vol. 1, pp. 65-74.
6. K. Mani Chandy and Jayadev Misra, Parallel Program Design: A Foundation, Addison-Wesley, Reading, MA, USA, 1988.
7. Manhoi Choy and Ambuj K. Singh, "Efficient fault-tolerance algorithms for distributed resource allocation," ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 17, no. 3, pp. 535-559, 1995.
8. Yih-Kuen Tsay and Rajive L. Bagrodia, "An algorithm with optimal failure locality for the dining philosophers problem," in 8th International Workshop on Distributed Algorithms, WDAG '94, Gerard Tel and Paul M. B. Vitányi, Eds. 1994, vol. 857 of LNCS, pp. 296-310, Springer.
9. Paolo A. G. Sivilotti, Scott M. Pike, and Nigamanth Sridhar, "A new distributed resource-allocation algorithm with optimal failure locality," in Proceedings of the 12th Int'l Conference on Parallel and Distributed Computing and Systems (PDCS), Nov 2000, vol. 2, pp. 524-529.
10. Mikhail Nesterenko and Anish Arora, "Dining philosophers that tolerate malicious crashes," in 22nd Int'l Conference on Distributed Computing Systems, 2002, pp. 172-179.
11. Danny Dolev, Cynthia Dwork, and Larry Stockmeyer, "On the minimal synchronism needed for distributed consensus," Journal of the ACM (JACM), vol. 34, no. 1, pp. 77-97, 1987.
12. Cynthia Dwork, Nancy A. Lynch, and Larry Stockmeyer, "Consensus in the presence of partial synchrony," J. Assoc. Comput. Mach., vol. 35, no. 2, pp. 288-323, Apr. 1988.
13. Tushar Deepak Chandra and Sam Toueg, "Unreliable failure detectors for reliable distributed systems," Journal of the ACM, vol. 43, no. 2, pp. 225-267, 1996.
14. C. Fetzer, M. Raynal, and F. Tronel, "An adaptive failure detection protocol," in Pacific Rim International Symposium on Dependable Computing, 2001, pp. 146-153.
15. Flavin Cristian, "Understanding fault-tolerant distributed systems," Communications of the ACM, vol. 34, no. 2, pp. 56-78, 1991.
16. Mikhail Nesterenko, Personal Correspondence, 2003.
17. Nancy A. Lynch, Distributed Algorithms, Morgan Kaufmann, 1996.