{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T06:41:36Z","timestamp":1778654496783,"version":"3.51.4"},"reference-count":100,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Standards &amp; Interfaces"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0920-5489(02)00105-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"159-181","source":"Crossref","is-referenced-by-count":34,"title":["A survey of permission-based distributed mutual exclusion algorithms"],"prefix":"10.1016","volume":"25","author":[{"given":"P.C.","family":"Saxena","sequence":"first","affiliation":[]},{"given":"J.","family":"Rai","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/S0920-5489(02)00105-8_BIB1","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1109\/12.83661","article-title":"Hierarchical quorum consensus: a new algorithm for managing replicated data","volume":"40","author":"Kumar","year":"1991","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"10.1016\/S0920-5489(02)00105-8_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/103727.103728","article-title":"An efficient and fault tolerant solution for distributed mutual exclusion","volume":"9","author":"Agrawal","year":"1991","journal-title":"ACM Transactions on Computer Systems"},{"issue":"4","key":"10.1016\/S0920-5489(02)00105-8_BIB3","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1145\/146931.146935","article-title":"The generalized tree quorum protocol: an efficient approach for managing replicated data","volume":"17","author":"Agrawal","year":"1992","journal-title":"ACM Transactions on Database Systems"},{"issue":"4","key":"10.1016\/S0920-5489(02)00105-8_BIB4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1145\/118544.118552","article-title":"Multi-dimensional voting","volume":"9","author":"Ahmad","year":"1991","journal-title":"ACM Transactions on Computer Systems"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB5","series-title":"Readings in Distributed Computing Systems","first-page":"572","article-title":"Replicated data management in distributed systems","author":"Ahmad","year":"1994"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0020-0190(91)90199-R","article-title":"A high availability \u221aN hierarchical grid algorithm for replicated data","volume":"40","author":"Kumar","year":"1991","journal-title":"Information Processing Letters"},{"issue":"5","key":"10.1016\/S0920-5489(02)00105-8_BIB7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/71.598279","article-title":"Analysis of quorum-based protocols for distributed (k+1)-exclusion","volume":"1","author":"Agrawal","year":"1997","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0020-0190(97)00145-2","article-title":"Billiard quorums on the grid","volume":"64","author":"Agrawal","year":"1997","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0020-0190(98)00017-9","article-title":"Optimal availability quorum systems: theory and practice","volume":"65","author":"Amir","year":"1998","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB10","series-title":"Concurrent Systems","author":"Bacon","year":"1998"},{"issue":"3","key":"10.1016\/S0920-5489(02)00105-8_BIB11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/363162.363167","article-title":"Additional comments on a problem in concurrent programming control","volume":"10","author":"De Bruijn","year":"1967","journal-title":"Communications of the ACM"},{"issue":"4","key":"10.1016\/S0920-5489(02)00105-8_BIB12","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/1994.2207","article-title":"An algorithm for concurrency control and recovery for replicated database","volume":"9","author":"Bernstein","year":"1984","journal-title":"ACM Transactions on Database Systems"},{"issue":"3","key":"10.1016\/S0920-5489(02)00105-8_BIB13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/6420.6421","article-title":"The vulnerability of vote-assignments","volume":"4","author":"Barbara","year":"1986","journal-title":"ACM Transactions on Computer Systems"},{"issue":"10","key":"10.1016\/S0920-5489(02)00105-8_BIB14","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1109\/TC.1987.1676860","article-title":"The reliability of voting mechanisms","volume":"c-36","author":"Barbara","year":"1987","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"10.1016\/S0920-5489(02)00105-8_BIB15","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/75104.75107","article-title":"Increasing availability under mutual exclusion constraints with dynamic vote reassignment","volume":"7","author":"Barbara","year":"1989","journal-title":"ACM Transactions on Computer Systems"},{"issue":"9","key":"10.1016\/S0920-5489(02)00105-8_BIB16","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/71.466629","article-title":"Generating and approximating non-dominated coteries","volume":"6","author":"Bioch","year":"1995","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"10.1016\/S0920-5489(02)00105-8_BIB17","first-page":"234","article-title":"Deadlock-free information structure distributed mutual exclusion algorithms","volume":"18","author":"Bonollo","year":"1996","journal-title":"Australian Computer Science Communications (ACSC'96)"},{"issue":"3","key":"10.1016\/S0920-5489(02)00105-8_BIB18","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/TSE.1979.234182","article-title":"Formal aspects of serializability in database concurrency control","volume":"5","author":"Bernstein","year":"1979","journal-title":"IEEE Transactions on Software Engineering SE"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB19","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1006\/jpdc.1996.0030","article-title":"A simulation study on distributed mutual exclusion","volume":"33","author":"Chang","year":"1996","journal-title":"Journal of Parallel Distributed Computing"},{"issue":"3","key":"10.1016\/S0920-5489(02)00105-8_BIB20","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1109\/69.87983","article-title":"Optimizing vote and quorum assignments for reading and writing replicated data","volume":"1","author":"Cheung","year":"1989","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"6","key":"10.1016\/S0920-5489(02)00105-8_BIB21","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1109\/69.180609","article-title":"The grid protocol: a high performance scheme for maintaining replicated data","volume":"4","author":"Cheung","year":"1992","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"4","key":"10.1016\/S0920-5489(02)00105-8_BIB22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0020-0190(01)00164-8","article-title":"A generalized grid quorum strategy for k-mutual exclusion in distributed systems","volume":"80","author":"Chang","year":"2001","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB23","series-title":"Distributed Systems: Concepts and Design","author":"Coulouris","year":"1994"},{"issue":"2","key":"10.1016\/S0920-5489(02)00105-8_BIB24","first-page":"146","article-title":"On the mutual exclusion in computer networks","volume":"26","author":"Carvalho","year":"1983","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB25","first-page":"444","article-title":"A delay-optimal quorum-based mutual exclusion scheme with fault-tolerance capability","author":"Cao","year":"1998"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB26","first-page":"295","article-title":"An improved o(log(n)) mutual exclusion algorithm for distributed systems","author":"Chang","year":"1990","journal-title":"International Conference on Parallel Processing"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB27","first-page":"148","article-title":"On the availability of k-coteries in networks with unreliable nodes and links","author":"Choi","year":"1999"},{"issue":"7","key":"10.1016\/S0920-5489(02)00105-8_BIB28","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1587\/transinf.2017EDL8042","article-title":"New constructions for nondominated k-coteries","volume":"E83D","author":"Choi","year":"2000","journal-title":"IEICE Transactions on Information and Systems"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB29","series-title":"Programming Languages","first-page":"43","article-title":"Co-operating sequential processes","author":"Dijkstra","year":"1965"},{"issue":"3","key":"10.1016\/S0920-5489(02)00105-8_BIB30","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/5505.5508","article-title":"Consistency in partitioned networks","volume":"17","author":"Davidson","year":"1985","journal-title":"Computing Surveys"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(94)00064-6","article-title":"Optimal coteries and voting schemes","volume":"51","author":"Diks","year":"1994","journal-title":"Information Processing Letters"},{"issue":"11","key":"10.1016\/S0920-5489(02)00105-8_BIB32","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1145\/355606.361895","article-title":"Further comments on Dijkstra's concurrent programming control problem","volume":"15","author":"Eisenberg","year":"1972","journal-title":"Communications of the ACM"},{"issue":"1","key":"10.1016\/S0920-5489(02)00105-8_BIB33","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/71.569655","article-title":"Delay optimal quorum consensus for distributed systems","volume":"8","author":"Fu","year":"1997","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"10.1016\/S0920-5489(02)00105-8_BIB34","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0020-0190(98)00109-4","article-title":"A quorum based k-mutual exclusion by weighted k-quorum systems","volume":"67","author":"Fujita","year":"1998","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB35","unstructured":"A.W. Fu, M.H. Wong, T.W. Lau, G.F. Ng, Cost Optimal Coteries. Technical Report CS-TR-94-07, Chinese University of Hong Kong (1994)."},{"key":"10.1016\/S0920-5489(02)00105-8_BIB36","series-title":"Proceedings of 7th Symposium on Operating Systems","first-page":"150","article-title":"Weighted voting for replicated data","author":"Gifford","year":"1979"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB37","unstructured":"Gupta S., Delay optimal mutual exclusion algorithms in distributed systems. PhD Thesis, School of Computer and Systems Sciences, Jawahar Lal Nehru University, New Delhi, 1998."},{"issue":"4","key":"10.1016\/S0920-5489(02)00105-8_BIB38","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/4221.4223","article-title":"How to assign votes in a distributed system","volume":"32","author":"Garcia-Molina","year":"1985","journal-title":"Journal for the Association for Computing Machinery"},{"issue":"11","key":"10.1016\/S0920-5489(02)00105-8_BIB39","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1109\/71.329670","article-title":"A general scheme for token and tree based distributed mutual exclusion algorithms","volume":"5","author":"Helary","year":"1994","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"10.1016\/S0920-5489(02)00105-8_BIB40","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1093\/comjnl\/31.4.289","article-title":"A distributed algorithm for mutual exclusion in an arbitrary network","volume":"31","author":"Helary","year":"1988","journal-title":"The Computer Journal"},{"issue":"6","key":"10.1016\/S0920-5489(02)00105-8_BIB41","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1109\/71.595585","article-title":"Non-dominated Coteries on Graphs","volume":"8","author":"Harada","year":"1997","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"9","key":"10.1016\/S0920-5489(02)00105-8_BIB42","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1109\/71.954617","article-title":"Coterie join operation and tree structured k-coteries","volume":"12","author":"Harada","year":"2001","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"7","key":"10.1016\/S0920-5489(02)00105-8_BIB43","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1109\/71.238300","article-title":"A theory of coteries: mutual exclusion in distributed systems","volume":"4","author":"Ibaraki","year":"1991","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB44","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02242737","article-title":"Optimal coteries for rings and related networks","volume":"8","author":"Ibaraki","year":"1995","journal-title":"Distributed Computing"},{"issue":"2","key":"10.1016\/S0920-5489(02)00105-8_BIB45","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1109\/12.565603","article-title":"Cohorts structures for fault-tolerant k entries to a critical section","volume":"46","author":"Jiang","year":"1997","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"10.1016\/S0920-5489(02)00105-8_BIB46","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/78922.78926","article-title":"Dynamic voting algorithms for maintaining the consistency of a replicated data","volume":"15","author":"Jajodia","year":"1990","journal-title":"ACM Transactions on Database Systems"},{"issue":"5","key":"10.1016\/S0920-5489(02)00105-8_BIB47","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/355592.365595","article-title":"Additional comments on a problem in concurrent programming control","volume":"9","author":"Knuth","year":"1966","journal-title":"Communications of the ACM"},{"issue":"4","key":"10.1016\/S0920-5489(02)00105-8_BIB48","first-page":"615","article-title":"k-arbiter join operation","volume":"17","author":"Kuo","year":"2001","journal-title":"Journal of Information Science and Engineering"},{"issue":"11","key":"10.1016\/S0920-5489(02)00105-8_BIB49","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1109\/71.969124","article-title":"Composite k-arbiters","volume":"12","author":"Kuo","year":"2001","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"5","key":"10.1016\/S0920-5489(02)00105-8_BIB50","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/12.223674","article-title":"Availability of k-coterie","volume":"42","author":"Kakugawa","year":"1993","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB51","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0020-0190(94)90014-0","article-title":"A distributed k-mutual exclusion algorithm using k-coterie","volume":"49","author":"Kakugawa","year":"1994","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB52","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(96)00089-0","article-title":"A simple scheme to construct k-coteries with O(N) uniform quorum sizes","volume":"59","author":"Kuo","year":"1996","journal-title":"Information Processing Letters"},{"issue":"4","key":"10.1016\/S0920-5489(02)00105-8_BIB53","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1109\/71.588618","article-title":"A geometric approach for constructing coteries and k-coteries","volume":"8","author":"Kuo","year":"1997","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"8","key":"10.1016\/S0920-5489(02)00105-8_BIB54","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/71.706045","article-title":"Recognizing ND-coteries and wr-coteries by availability","volume":"9","author":"Kuo","year":"1998","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0164-1212(01)00023-1","article-title":"Minimizing the mean delay of quorum-based mutual exclusion schemes","volume":"58","author":"Kobayashi","year":"2001","journal-title":"The Journal of Systems and Software"},{"issue":"7","key":"10.1016\/S0920-5489(02)00105-8_BIB56","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks and the ordering of events in a distributed computing","volume":"21","author":"Lamport","year":"1978","journal-title":"Communications of the ACM"},{"issue":"3","key":"10.1016\/S0920-5489(02)00105-8_BIB57","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"Byzantine generals problem","volume":"4","author":"Lamport","year":"1982","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB58","series-title":"Proceedings of the 17th International Conference on Distributed Computing Systems, USA, ICDCS' 97","first-page":"100","article-title":"Two new quorum based algorithms for distributed mutual exclusion","author":"Luk","year":"1997"},{"issue":"2","key":"10.1016\/S0920-5489(02)00105-8_BIB59","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/214438.214445","article-title":"A \u221aN algorithm for mutual exclusion in decentralized systems","volume":"3","author":"Maekawa","year":"1985","journal-title":"ACM Transactions on Computer Systems"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB60","series-title":"Distributed Systems","author":"Mullender","year":"1993"},{"issue":"1\u20132","key":"10.1016\/S0920-5489(02)00105-8_BIB61","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0304-3975(97)00303-4","article-title":"k-Arbiter: a safe and general scheme for h-out of-k mutual exclusion","volume":"193","author":"Manabe","year":"1998","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10.1016\/S0920-5489(02)00105-8_BIB62","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0164-1212(96)00042-8","article-title":"Properties of nondominated k-coteries","volume":"37","author":"Neilsen","year":"1997","journal-title":"Journal of Systems and Software"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB63","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/ICDCS.1991.148689","article-title":"A DAG based algorithm for distributed mutual exclusion","author":"Neilson","year":"1991","journal-title":"International Conference on Distributed Computer Systems"},{"issue":"5","key":"10.1016\/S0920-5489(02)00105-8_BIB64","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1109\/71.159041","article-title":"Coteries join algorithm","volume":"3","author":"Neilson","year":"1992","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB65","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(94)00039-5","article-title":"Nondominated k-coteries for multiple mutual exclusion","volume":"50","author":"Neilsen","year":"1994","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB66","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jpdc.1996.0041","article-title":"A log(n) distributed mutual exclusion algorithm based on path reversal","volume":"34","author":"Naimi","year":"1996","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"10.1016\/S0920-5489(02)00105-8_BIB67","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/71.485505","article-title":"Folded Petersen cube networks: new competitors for the hypercubes","volume":"7","author":"\u00d6hring","year":"1996","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"3","key":"10.1016\/S0920-5489(02)00105-8_BIB68","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","article-title":"Myths about the mutual exclusion problem","volume":"12","author":"Peterson","year":"1981","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB69","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1006\/inco.1995.1169","article-title":"The availability of quorum systems","volume":"123","author":"Peleg","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB70","series-title":"Algorithms for Mutual Exclusion","author":"Raynal","year":"1986"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB71","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0190(89)90211-1","article-title":"A distributed algorithm for multiple entries to a critical section","volume":"30","author":"Raymond","year":"1989","journal-title":"Information Processing Letters"},{"issue":"1","key":"10.1016\/S0920-5489(02)00105-8_BIB72","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/58564.59295","article-title":"A tree based algorithm for distributed mutual exclusion algorithms","volume":"7","author":"Raymond","year":"1989","journal-title":"ACM Transactions on Computer Systems"},{"issue":"2","key":"10.1016\/S0920-5489(02)00105-8_BIB73","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/122120.122123","article-title":"A simple taxonomy for distributed mutual exclusion algorithms","volume":"23","author":"Raynal","year":"1991","journal-title":"ACM Operating Systems Review"},{"issue":"1","key":"10.1016\/S0920-5489(02)00105-8_BIB74","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/358527.358537","article-title":"An optimal algorithm for mutual exclusion in computer networks","volume":"24","author":"Ricart","year":"1981","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB75","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1145\/141484.130319","article-title":"Improving fault-tolerance and supporting partial writes in structured coterie protocols for replicated objects","author":"Rabinowich","year":"1992","journal-title":"Proceedings ACM SIGMOD"},{"issue":"12","key":"10.1016\/S0920-5489(02)00105-8_BIB76","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.1109\/71.476168","article-title":"A fault-tolerant algorithm for replicated data management","volume":"6","author":"Rangarajan","year":"1995","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"3","key":"10.1016\/S0920-5489(02)00105-8_BIB77","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1145\/24068.28052","article-title":"The information structure of distributed mutual exclusion algorithms","volume":"5","author":"Sanders","year":"1987","journal-title":"ACM Transactions on Computer Systems"},{"issue":"8","key":"10.1016\/S0920-5489(02)00105-8_BIB78","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/12.24268","article-title":"A heuristically aided algorithm for mutual exclusion in distributed systems","volume":"38","author":"Singhal","year":"1989","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB79","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01798960","article-title":"A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems","volume":"4","author":"Singhal","year":"1991","journal-title":"Distributed Computing"},{"issue":"1","key":"10.1016\/S0920-5489(02)00105-8_BIB80","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1109\/71.113087","article-title":"A dynamic information-structure mutual exclusion algorithm for distributed systems","volume":"3","author":"Singhal","year":"1992","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB81","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1006\/jpdc.1993.1048","article-title":"A taxonomy of distributed mutual exclusion","volume":"18","author":"Singhal","year":"1993","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"20","key":"10.1016\/S0920-5489(02)00105-8_BIB82","first-page":"191","article-title":"Synchronization of replicated data in distributed systems","volume":"12","author":"Son","year":"1987","journal-title":"Information Systems"},{"issue":"1","key":"10.1016\/S0920-5489(02)00105-8_BIB83","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/71.262589","article-title":"Voting as the optimal static pessimistic scheme for managing replicated data","volume":"5","author":"Spasojevic","year":"1994","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB84","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1006\/jnca.1998.0072","article-title":"A performance comparison of token and tree based mutual exclusion algorithms on chordal rings","volume":"21","author":"Saxena","year":"1998","journal-title":"Journal of Networks and Computer Applications"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB85","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0920-5489(99)00003-3","article-title":"A token-based delay optimal algorithm for mutual exclusion in distributed systems","volume":"21","author":"Saxena","year":"1999","journal-title":"Computer Standards and Interfaces"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB86","series-title":"Operating System Concepts","author":"Silberschatz","year":"1998"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB87","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0920-5489(01)00080-0","article-title":"Delay optimal coteries on regular symmetric networks","volume":"23","author":"Saxena","year":"2001","journal-title":"Computer Standards and Interfaces"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB88","unstructured":"P.C. Saxena S. Gupta, J. Rai, A delay optimal coterie on the k-dimensional folded Petersen Graph. Appearing."},{"issue":"4","key":"10.1016\/S0920-5489(02)00105-8_BIB89","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1145\/6110.214406","article-title":"A distributed mutual exclusion algorithm","volume":"3","author":"Suzuki","year":"1985","journal-title":"ACM Transactions on Computer Systems"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB90","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(92)90079-B","article-title":"Another distributed algorithm for multiple entries to a critical section","volume":"41","author":"Srimani","year":"1992","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB91","unstructured":"P.C. Saxena, J. Rai, Communication Cost of k-coteries, submitted for publication."},{"key":"10.1016\/S0920-5489(02)00105-8_BIB92","unstructured":"P.C. Saxena, J. Rai, Cross Product of Coteries, submitted for publication."},{"issue":"3","key":"10.1016\/S0920-5489(02)00105-8_BIB93","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1145\/357369.357371","article-title":"Fail-stop processors: an approach to designing fault-tolerant computing systems","volume":"1","author":"Schlichting","year":"1983","journal-title":"ACM Transactions on Computer Systems"},{"issue":"2","key":"10.1016\/S0920-5489(02)00105-8_BIB94","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1145\/320071.320076","article-title":"A majority consensus approach to concurrency control","volume":"4","author":"Thomas","year":"1979","journal-title":"ACM Transactions on Database Systems"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB95","series-title":"Proceedings of 7th IEEE Symposium on Reliable Distributed Systems, SRDS' 88, Ohio State University, Columbus, Ohio, USA","first-page":"138","article-title":"Vote assignments in weighted voting mechanisms","author":"Tong","year":"1988"},{"issue":"7","key":"10.1016\/S0920-5489(02)00105-8_BIB96","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1093\/comjnl\/42.7.613","article-title":"Availability evaluation of quorum-based mutual exclusion schemes in general topology networks","volume":"42","author":"Tsuchiya","year":"1999","journal-title":"The Computer Journal"},{"issue":"4","key":"10.1016\/S0920-5489(02)00105-8_BIB97","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/71.762814","article-title":"Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion","volume":"10","author":"Tsuchiya","year":"1999","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"12","key":"10.1016\/S0920-5489(02)00105-8_BIB98","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1109\/12.338112","article-title":"Comments on availability of k-coterie","volume":"43","author":"Yuan","year":"1994","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"10.1016\/S0920-5489(02)00105-8_BIB99","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<221::AID-NET7>3.0.CO;2-M","article-title":"Modeling k-coteries by well-covered graphs","volume":"34","author":"Yamashita","year":"1999","journal-title":"Networks"},{"key":"10.1016\/S0920-5489(02)00105-8_BIB100","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1006\/jpdc.1996.0078","article-title":"A fast token chasing mutual exclusion algorithm in arbitrary network topologies","volume":"35","author":"Yan","year":"1996","journal-title":"Journal of Parallel and Distributed Computing"}],"container-title":["Computer Standards &amp; Interfaces"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0920548902001058?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0920548902001058?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T04:03:09Z","timestamp":1583899389000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0920548902001058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":100,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0920548902001058"],"URL":"https:\/\/doi.org\/10.1016\/s0920-5489(02)00105-8","relation":{},"ISSN":["0920-5489"],"issn-type":[{"value":"0920-5489","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}