The weak mutual exclusion problem

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Romano, Paolo ^a   Rodrigues, Luis ^a   Carvalho, Nuno ^a  

^a INESC ID   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION LATENCY; CRITICAL SECTIONS; DISTRIBUTED MUTUAL EXCLUSION; FAILURE DETECTORS; MUTUAL EXCLUSIONS; PROCESS SPEED; SHARED RESOURCES; SYNCHRONOUS MODELS;

DISTRIBUTED PARAMETER NETWORKS;

SYNTHETIC FUELS;

EID: 70450103634     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5161061     Document Type: Conference Paper

References (31)

1. D. Agrawal and A. E. Abbadi. An efficient and faulttolerant solution for distributed mutual exclusion. ACM Trans. Comput. Syst., 9(1):1-20, 1991.
2. P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency control and recovery in database systems. Addison-Wesley Longman Publishing Co., Inc., 1987.
3. R. Boichat, P. Dutta, and R. Guerraoui. Asynchronous leasing. In Proc. of the The International Workshop on Object-Oriented Real-Time Dependable Systems, page 180, Washington, DC, USA, 2002. IEEE Computer Society.
4. F. V. Brasileiro, F. Greve, A. Mostéfaoui, and M. Raynal. Consensus in one communication step. In Proc. of the International Conference on Parallel Computing Technologies, pages 42-50. Springer-Verlag, 2001.
5. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Communications of the ACM, 43(2):225-267, 1996.
6. K. M. Chandy and J. Misra. The drinking philosophers problem. ACM Transactions on Programming Languages and Systems, 6:632-646, 1984.
7. K. M. Chandy and J. Misra. Parallel program design: a foundation. Addison-Wesley Longman Publishing Co., Inc., 1988.
8. M. Choy and A. K. Singh. Efficient fault tolerant algorithms for resource allocation in distributed systems. In Proc. of the ACM Symposium on Theory of Computing (STOC), pages 593-602, New York, NY, USA, 1992. ACM.
9. D. Powell (ed.). Special issue on group communication. 39(4):50-97, 1996.
10. C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, and P. Kouznetsov. Mutual exclusion in asynchronous systems with failure detectors. J. Parallel Distrib. Comput., 65(4):492-505, 2005.
11. E. W. Dijkstra. Solution of a problem in concurrent programming control. Com.ACM, 8(9):569, 1965.
12. E. W. Dijkstra. Hierarchical ordering of sequential processes. Acta Informatica, 1:115-138, 1971.
13. V. Duvvuri, P. Shenoy, and R. Tewari. Adaptive leases: A strong consistency mechanism for the world wide web. IEEE Transactions on Knowledge and Data Engineering, 15(5):1266-1276, 2003.
14. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. J. ACM, 35(2):288-323, 1988.
15. C. Gray and D. Cheriton. Leases: an efficient fault-tolerant mechanism for distributed file cache consistency. In Proc. of the Symposium on Operating Systems Principles, pages 202- 210. ACM, 1989.
16. R. Guerraoui and M. Raynal. A leader election protocol for eventually synchronous shared memory systems. In Proc. of the Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, pages 75-80, Washington, DC, USA, 2006. IEEE Computer Society.
17. R. Guerraoui and L. Rodrigues. Introduction to Reliable Distributed Programming. Springer, 2006.
18. R. Guerraoui and A. Schiper. Consensus: The big misunderstanding. In Proc. of the Workshop on Future Trends of Distributed Computing Systems, pages 183-188. IEEE Computer Society, 1997.
19. M. Herlihy and J. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990.
20. B. Kemme and G. Alonso. A suite of database replication protocols based on group communication primitives. In Proc. of the The 18th International Conference on Distributed Computing Systems, page 156, Washington, DC, USA, 1998. IEEE Computer Society.
21. L. Lamport. A new solution of dijkstra's concurrent programming problem. Commun. ACM, 17(8):453-455, 1974.
22. L. Lamport. Fast paxos. Distributed Computing, 9(2):79-103, 2006.
23. B. Liskov, M. Day, and L. Shrira. Distributed object management in thor. In Distributed Object Management, pages 79-91. Morgan Kaufmann, 1993.
24. S. Lodha and A. Kshemkalyani. A fair distributed mutual exclusion algorithm. IEEE Trans. Parallel Distrib. Syst., 11(6):537-549, 2000.
25. N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
26. D. Manivannan and M. Singhal. An efficient fault-tolerant mutual exclusion algorithm for distributed systems. In Proc of the Conference on Parallel and Distributed Computing, pages 525-530, 1994.
27. S. M. Pike and P. Sivilotti. Dining philosophers with crash locality 1. In Proc. of the 24th IEEE International Conference on Distributed Computing Systems (ICDCS, pages 22-29. IEEE, 2004.
28. M. Raynal and D. Beeson. Algorithms for mutual exclusion. MIT Press, Cambridge, MA, USA, 1986.
29. L. Rodrigues, H. Miranda, R. Almeida, a. M. Jo and P. Vicente. The globdata fault-tolerant replicated distributed object database. In Proc. of the First EurAsian Conference on Information and Communication Technology, pages 426-433, London, UK, 2002. Springer-Verlag.
30. P. Romano, L. Rodrigues, and N. Carvalho. The weak mutual exclusion problem. Technical Report 52/2008, INESC-ID, Nov. 2008.
31. M. Singhal. A taxonomy of distributed mutual exclusion. J. Parallel Distrib. Comput., 18(1):94-101, 1993.