Quorum-based algorithms for group mutual exclusion

IEEE Transactions on Parallel and Distributed Systems

Volumn 14, Issue 5, 2003, Pages 463-476

  Joung, Yuh Jzer ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Coteries; Group mutual exclusion; Mutual exclusion; Quorum system; Resource allocation; Surficial quorum system

Indexed keywords

ALGORITHMS; BUFFER STORAGE; GEOMETRY; RESOURCE ALLOCATION; SYNCHRONIZATION;

QUORUM SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0038043488     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2003.1199064     Document Type: Article

References (45)

1. D. Agrawal and A. El Abbadi, "An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion," ACM Trans. Computer Systems, vol. 9, no. 1, pp. 1-20, Feb. 1991.
2. M. Ahamad and M.H. Ammar, "Multidimensional Voting," ACM Trans. Computer Systems, vol. 9, no. 4, pp. 399-431, Nov. 1991.
3. K. Alagarsamy and K. Vidyasankar, "Elegant Solutions for Group Mutual Exclusion Problem," technical report, Dept. of Computer Science, Memorial Univ. of Newfoundland, St. John's, Newfoundland, Canada, 1999.
4. D. Barbara and H. Garcia-Molina, "Mutual Exclusion in Partitioned Distributed Systems," Distributed Computing, vol. 1, pp. 119-132, 1986.
5. R.A. Bazzi, "Planar Quorums," Theoretical Computer Science, vol. 243, nos. 1-2, pp. 243-268, July 2000.
6. Bluetooth SIG, http://www.bluetooth.com/, 2003.
7. S. Cantarell, A.K. Datta, F. Petit, and V. Villain, "Group Mutual Exclusion in Token Rings," Proc. Eighth Colloquium Structural Information and Comm. Complexity, June 2001.
8. S. Cantarell, A.K. Datta, F. Petit, and V. Villain, "Token Based Group Mutual Exclusion for Asynchronous Rings," Proc. 21st Int'l Conf. Distributed Computing Systems, pp. 691-694, 2001.
9. G. Cao and M. Singhal, "A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems," IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 12, pp. 1256-1268, Dec. 2001.
10. K. Mani Chandy and J. Misra, "The Drinking Philosophers Problem," ACM Trans. Programming Languages and Systems, vol. 6, no. 4, pp. 632-646, Oct. 1984.
11. K. Mani Chandy and J. Misra, Parallel Program Design: A Foundation. Addison-Wesley, 1988.
12. Y.-I. Chang, "A Correct O(√N) Distributed Mutual Exclusion Algorithm," Proc. Fifth Int'l Conf. Parallel and Distributed Computing and Systems, pp. 56-61, Oct. 1992.
13. Y.-I. Chang, "Notes on Maekawa's O(√N) Distributed Mutual Exclusion Algorithm," Proc. Symp. Parallel and Distributed Systems, pp. 352-359, Dec. 1994.
14. S.Y. Cheung, M.H. Ammar, and M. Ahamad, "The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data," IEEE Trans. Knowledge and Data Eng., vol. 4, no. 6, pp. 582-592, Dec. 1992.
15. E.W. Dijkstra, "Solution of a Problem in Concurrent Programming Control," Comm. ACM, vol. 8, no. 9, p. 569, Sept. 1965.
16. E.W. Dijkstra, "Hierarchical Ordering of Sequential Processes," Acta Informatica, vol. 1, no. 2, pp. 115-138, Oct. 1971.
17. M.J. Fischer, N.A. Lynch, J.E. Burns, and A. Borodin, "Resource Allocation with Immunity to Limited Process Failure (preliminary report)," Proc. 20th Ann. Symp. Foundations of Computer Science, pp. 234-254, Oct. 1979.
18. W.C.A. Fu, Enhancing Concurrency and Availability for Database Systems, PhD thesis, Simon Fraser Univ., Burnaby, British Columbia, Canada, 1990.
19. S. Fujita, M. Yamashita, and T. Ae, "Distributed k-Mutual Exclusion Problem and k-Coteries," Proc. Second Int'l Symp. Algorithms and Computation, Lecture Notes in Computer Science 557, pp. 22-31,1991.
20. H. Garcia-Molina and D. Barbara, "How to Assign Votes in a Distributed System," J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
21. D.K. Gifford, "Weighted Voting for Replicated Data," Proc. Seventh Ann. ACM Symp. Operating Systems Principles, pp. 150-162, Dec. 1979.
22. V. Hadzilacos, "A Note on Group Mutual Exclusion," Proc. 20th Ann. ACM Symp. Principles of Distributed Computing, Aug. 2001.
23. J.W. Havender, "Avoiding Deadlock in Multiasking Systems," IBM Systems J., vol. 7, no. 2. pp. 74-84, 1968.
24. C.A.R. Hoare, "Communicating Sequential Processes," Comm. ACM, vol. 21, no. 8, pp. 666-677, Aug. 1978.
25. S.-T Huang, J.-R. Jiang, and Y.-C. Kuo, "K-Coteries for Fault Tolerant K Entries to a Critical Section," Proc. 13th Int'l Conf. Distributed Computing Systems, pp. 74-81, May 1993.
26. IEEE 802.11 Working Group for Wireless Local Area Networks, http://ieee802.org/11/, 2003.
27. IEEE 802.15 Working Group for Wireless Personal Area Networks (WPANs), http://ieee802.org/15/, 2003.
28. Y.-J. Joung, "Asynchronous Group Mutual Exclusion (extended abstract)," Proc. 17th Ann. ACM Symp. Principles of Distributed Computing, pp. 51-60, June 1998.
29. Y.-J. Joung, "On Generalized Quorum Systems," technical report, Dept. of Information Management, Nat'l Taiwan Univ., Taipei, Taiwan, 2000.
30. Y.-J. Joung, "The Congenial Talking Philosophers Problem in Computer Networks," Distributed Computing, vol. 15, no. 3, pp. 155-175, 2002.
31. H. Kakugawa, S. Fujita, M. Yamashita, and T. Ae, "Availability of K-Coterie," IEEE Trans. Computers, vol. 42, no. 5, pp. 553-558, May 1993.
32. P. Keane and M. Moir, "A Simple Local-Spin Group Mutual Exclusion Algorithm," Proc. 18th Ann. ACM Symp. Principles of Distributed Computing, pp. 23-32,1999.
33. A. Kumar, "Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data," IEEE Trans. Computers, vol. 40, no. 9, pp. 996-1004, Sept. 1991.
34. A. Kumar, M. Rabinovich, and R.K. Sinha, "A Performance Study of General Grid Structures for Replicated Data," Proc. 13th Int'l Conf. Distributed Computing Systems, pp. 178-185, 1993.
35. Y.-C. Kuo and S.-T. Huang, "A Simple Scheme to Construct k-Coteries with O(√N) Uniform Quorum Sizes," Information Processing Letters, vol. 59, no. 1, pp. 31-36, July 1996.
36. L. Lamport, "Time, Clocks and the Ordering of Events in a Distributed System," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
37. M. Maekawa, "A √N Algorithm for Mutual Exclusion in Decentralized Systems," ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145-159, May 1985.
38. Y. Marcus and D. Peleg, "Construction Methods for Quorum Systems," Technical Report CS92-33, The Weizmann Inst. Of Science, Rehovot, Israel, 1992.
39. M.L. Neilsen, "Properties of Nondominated K-Coteries," J. Systems and Software, vol. 37, no. 1, pp. 91-96, Apr. 1997.
40. D. Peleg and A. Wool, "The Availability of Quorum Systems," Information and Computation, vol. 123, no. 2, pp. 210-223, Dec. 1995.
41. D. Peleg and A. Wool, "Crumbling Walls: A Class of Practical and Efficient Quorum Systems," Distributed Computing, vol. 10, no. 2, pp. 87-97, 1997.
42. G. Ricart and A.K. Agrawala, "An Optimal Algorithm for Mutual Exclusion in Computer Networks," Comm. ACM, vol. 24, no. 1, pp. 9-17, Jan. 1981.
43. M. Singhal, "A Class of Deadlock-Free Maekawa-Type Algorithms for Mutual Exclusion in Distributed Systems," Distributed Computing, vol. 4, no. 3, pp. 131-138, 1991.
44. K. Vidyasankar, "A Simple Group l-Exclusion Algorithm," Information Processing Letters, vol. 85, no. 2, pp. 79-85, Nov. 2002.
45. K.-P. Wu and Y.-J. Joung, "Asynchronous Group Mutual Exclusion in Ring Networks," IEE Proc. Computers and Digital Techniques, vol. 147, no. 1, pp. 1-8, 2000.