{"title":"On Bounding Jayanti's Distributed Mutual Exclusion Algorithm","authors":"Awadhesh Kumar Singh","volume":14,"journal":"International Journal of Computer and Information Engineering","pagesStart":329,"pagesEnd":336,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/1133","abstract":"
Jayanti-s algorithm is one of the best known abortable mutual exclusion algorithms. This work is an attempt to overcome an already known limitation of the algorithm while preserving its all important properties and elegance. The limitation is that the token number used to assign process identification number to new incoming processes is unbounded. We have used a suitably adapted alternative data structure, in order to completely eliminate the use of token number, in the algorithm.<\/p>\r\n","references":"[1] P. Jayanti, \"Adaptive and efficient abortable mutual exclusion,\" in Proc.\r\n22nd ACM Annual Symposium on Principles of Distributed Computing,\r\nJuly 13-16, 2003, pp. 295-304.\r\n[2] P. Jayanti, \"Efficient and practical constructions of LL\/SC variables,\" in\r\nProc. 22nd ACM Annual Symposium on Principles of Distributed\r\nComputing PODC 2003, July 13-16, 2003, pp. 285-294.\r\n[3] D. L. Weaver and T. Germond, The SPARC Architecture Manual.\r\nVersion 9, SPARC International, Inc.\r\n[4] Intel Corporation. Intel Itanium Architecture Software Developer's\r\nManual, Volume 1: Application Architecture Revision 2.1, Oct. 2002.\r\n[5] J. M. Tendler, S. Dodson, S. Fields, H. Le, and B. Sinharoy, IBM eserver\r\nPOWER4 System Microarchitecture, IBM, Oct. 2001.\r\n[6] MIPS Computer Systems, MIPS64 Architecture for Programmers.\r\nVolume II: The MIPS64 Instruction Set, Aug. 2002.\r\n[7] R. Site, Alpha Architecture Reference Manual. Digital equipment\r\nCorporation, 1992.\r\n[8] P. Jayanti, \"f-arrays: Implementation and applications,\" in Proc. 21st\r\nACM Annual Symposium on Principles of Distributed Computing PODC\r\n2002, July 21-24, 2002, pp. 270-279.\r\n[9] L. Lamport, \"Time, clocks and the ordering of events in a distributed\r\nsystem,\" Communications of the ACM, 1978, 21(7): 558-565.\r\n[10] P. Tang, P.-C. Yew, and C.-Q. Zhu, \"A parallel linked list for sharedmemory\r\nmultiprocessors,\" in Proc. 13th IEEE Annual International\r\nConference on Computer Software and Applications COMPSAC-89,\r\nSep. 20-22, 1989, pp. 130-135.\r\n[11] M. J. Quinn, Parallel Computing: Theory and Practice. 2\/e, McGraw-\r\nHill Companies, Inc., 1994.\r\n[12] E. G. Jr. Coffman and P. J. Denning, Operating Systems Theory.\r\nPrentice-Hall, Englewood Cliffs, NJ, 1973.\r\n[13] V. J. Marathe, M. Moir, and N. Shavit, \"Composite abortable locks,\" in\r\nProc. 20th IEEE International Parallel and Distributed Processing\r\nSymposium IPDPS-06, April 25-29, 2006, pp. 1-10.\r\n[14] H. Maegawa, \"Memory organization and management for linked data\r\nstructures,\" in Proc. 19th ACM Annual Conference on Computer Science,\r\nApril 1991, pp. 105-112.","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 14, 2008"}