{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:56:24Z","timestamp":1725638184724},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642271793"},{"type":"electronic","value":"9783642271809"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-27180-9_4","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T07:42:50Z","timestamp":1322898170000},"page":"25-34","source":"Crossref","is-referenced-by-count":1,"title":["Quorum Based Mutual Exclusion in Asynchronous Systems with Unreliable Failure Detectors"],"prefix":"10.1007","author":[{"given":"Sung-Hoon","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seon-Hyong","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing","author":"C. Delporte-Gallet","year":"2004","unstructured":"Delporte-Gallet, C., Fauconnier, H.: The weakest Failure Detector to Solve certain Fundamental Problems in Distributed computing. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. ACM, New York (2004)"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/103727.103728","volume":"9","author":"D. Agrawal","year":"1991","unstructured":"Agrawal, D., Abbadi, A.E.: An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Transactions on Computer Systems\u00a09(1), 1\u201320 (1991)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"Journal of the ACM"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Chockler, G., Malkhi, D., Reiter, M.K.: Backo. protocols for distributed mutual exclusion and ordering. In: Proceedings of the 21st International Conference on Distributed Computing Systems, ICDCS 2001 (April 2001)","DOI":"10.1109\/ICDSC.2001.918928"},{"issue":"9","key":"4_CR6","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"E.W. Dijkstra","year":"1965","unstructured":"Dijkstra, E.W.: Solution of a problem in concurrent programming control. Communications of the ACM\u00a08(9), 569 (1965)","journal-title":"Communications of the ACM"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM\u00a032(3), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1137\/S0097539799364912","volume":"31","author":"E. Gafni","year":"2001","unstructured":"Gafni, E., Mitzenmacher, M.: Analysis of timing-based mutual exclusion with random times. SIAM Journal on Computing\u00a031(3), 816\u2013837 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Hadzilacos, V.: A note on group mutual exclusion. In: 20th ACM SIGACTSIGOPS Symposium on Principles of Distributed Computing (August 2001)","DOI":"10.1145\/383962.383997"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Joung, Y.-J.: Asynchronous group mutual exclusion. In: 17th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 51\u201360 (June 1998)","DOI":"10.1145\/277697.277706"},{"issue":"7","key":"4_CR11","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/71.940743","volume":"12","author":"P. Keane","year":"2001","unstructured":"Keane, P., Moir, M.: A simple local-spin group mutual exclusion algorithm. IEEE Transactions on Parallel and Distributed Systems\u00a012(7), 673\u2013685 (2001)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"8","key":"4_CR12","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport, L.: A new solution of Dijkstra\u2019s concurrent programming problem. Communications of the ACM\u00a017(8), 453\u2013455 (1974)","journal-title":"Communications of the ACM"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/5383.5384","volume":"33","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem. Parts I&II. Journal of the ACM\u00a033(2), 313\u2013348 (1986)","journal-title":"Journal of the ACM"},{"issue":"6","key":"4_CR14","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1109\/71.862205","volume":"11","author":"S. Lodha","year":"2000","unstructured":"Lodha, S., Kshemkalyan, A.D.: A fair distributed mutual exclusion algorithm. IEEE Transactions on Parallel and Distributed Systems\u00a011(6), 537\u2013549 (2000)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"4_CR15","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers (1996)"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M. Maekawa","year":"1985","unstructured":"Maekawa, M.: A\u221aN algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems\u00a03(2), 145\u2013159 (1985)","journal-title":"ACM Transactions on Computer Systems"},{"key":"4_CR17","unstructured":"Manivannan, D., Singhal, M.: An efficient fault-tolerant mutual exclusion algorithm for distributed systems. In: Proceedings of the ISCA International Conference on Parallel and Distributed Computing Systems, pp. 525\u2013530 (October 1994)"}],"container-title":["Communications in Computer and Information Science","Grid and Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27180-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T06:46:50Z","timestamp":1561013210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27180-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642271793","9783642271809"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27180-9_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}