
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ranganath Atreya, Neeraj Mittal, Sathya Peri, "A QuorumBased Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 10, pp. 13451360, October, 2007.  
BibTex  x  
@article{ 10.1109/TPDS.2007.1072, author = {Ranganath Atreya and Neeraj Mittal and Sathya Peri}, title = {A QuorumBased Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {18}, number = {10}, issn = {10459219}, year = {2007}, pages = {13451360}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.1072}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A QuorumBased Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set IS  10 SN  10459219 SP1345 EP1360 EPD  13451360 A1  Ranganath Atreya, A1  Neeraj Mittal, A1  Sathya Peri, PY  2007 KW  messagepassing system KW  resource management KW  mutual exclusion KW  group mutual exclusion KW  KW  quorumbased algorithm VL  18 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] R. Atreya and N. Mittal, “A Dynamic Group Mutual Exclusion Algorithm Using SurrogateQuorums,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS '05), pp. 251260, June 2005.
[2] E.W. Dijkstra, “Solution of a Problem in Concurrent Programming Control,” Comm. ACM, vol. 8, no. 9, p. 569, 1965.
[3] L. Lamport, “Time, Clocks, and the Ordering of Events in a Distributed System,” Comm. ACM, vol. 21, no. 7, pp. 558565, July 1978.
[4] G. Ricart and A.K. Agrawala, “An Optimal Algorithm for Mutual Exclusion in Computer Networks,” Comm. ACM, vol. 24, no. 1, pp.917, Jan. 1981.
[5] I. Suzuki and T. Kasami, “A Distributed Mutual Exclusion Algorithm,” ACM Trans. Computer Systems, vol. 3, no. 4, pp. 344349, 1985.
[6] K. Raymond, “A Tree Based Algorithm for Distributed Mutual Exclusion,” ACM Trans. Computer Systems, vol. 7, no. 1, pp. 6177, 1989.
[7] 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 (FOCS '79), pp. 234254, Oct. 1979.
[8] E.W. Dijkstra, “Hierarchical Ordering of Sequential Processes,” Acta Informatica, vol. 1, no. 2, pp. 115138, Oct. 1971.
[9] K.M. Chandy and J. Misra, “The Drinking Philosophers Problem,” ACM Trans. Programming Languages and Systems, vol. 6, no. 4, pp.632646, 1984.
[10] K.M. Chandy and J. Misra, Parallel Program Design: A Foundation. AddisonWesley, 1988.
[11] Y.J. Joung, “Asynchronous Group Mutual Exclusion,” Distributed Computing, vol. 13, no. 4, pp. 189206, 2000.
[12] Y.J. Joung, “QuorumBased Algorithms for Group Mutual Exclusion,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 5, pp. 463475, May 2003.
[13] M. Toyomura, S. Kamei, and H. Kakugawa, “A QuorumBased Distributed Algorithm for Group Mutual Exclusion,” Proc. Fourth Int'l Conf. Parallel and Distributed Computing, Applications and Technologies (PDCAT '03), pp. 742746, Aug. 2003.
[14] P. Keane and M. Moir, “A Simple LocalSpin Group Mutual Exclusion Algorithm,” Proc. 18th ACM Symp. Principles of Distributed Computing (PODC '99), pp. 2332, 1999.
[15] V. Hadzilacos, “A Note on Group Mutual Exclusion,” Proc. 20th ACM Symp. Principles of Distributed Computing (PODC '01), Aug. 2001.
[16] K. Vidyasankar, “Brief Announcement: A Highly Concurrent Group Mutual LExclusion Algorithm,” Proc. 21st ACM Symp. Principles of Distributed Computing (PODC '02), p. 130, July 2002.
[17] K. Vidyasankar, “A Simple Group Mutual LExclusion Algorithm,” Information Processing Letters, vol. 85, no. 2, pp. 7985, 2003.
[18] 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. 18, 2000.
[19] S. Cantarell, A.K. Datta, F. Petit, and V. Villain, “Group Mutual Exclusion in Token Rings,” Computer J., vol. 48, no. 2, pp. 239252, 2005.
[20] J. Beauquier, S. Cantarell, A.K. Datta, and F. Petit, “Group Mutual Exclusion in Tree Networks,” J. Information Science and Eng., vol. 19, no. 3, pp. 415432, May 2003.
[21] Y.J. Joung, “The Congenial Talking Philosophers Problem in Computer Networks,” Distributed Computing, pp. 155175, 2002.
[22] M. Maekawa, “A $\sqrt{N}$ Algorithm for Mutual Exclusion in Decentralized Systems,” ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145159, May 1985.
[23] Y. Manabe and J. Park, “A QuorumBased Extended Group Mutual Exclusion Algorithm without Unnecessary Blocking,” Proc. 10th Int'l Conf. Parallel and Distributed Systems (ICPADS '04), pp. 341348, 2004.
[24] F. Mattern, “Global Quiescence Detection Based on Credit Distribution and Recovery,” Information Processing Letters, vol. 30, no. 4, pp. 195200, 1989.