{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:21:46Z","timestamp":1737436906302,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679561"},{"type":"electronic","value":"9783540445203"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44520-x_167","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:51:43Z","timestamp":1188359503000},"page":"1185-1195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Token-Based Read\/Write-Locks for Distributed Mutual Exclusion"],"prefix":"10.1007","author":[{"given":"Claus","family":"Wagner","sequence":"first","affiliation":[]},{"given":"Frank","family":"Mueller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,18]]},"reference":[{"issue":"2","key":"167_CR1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1006\/jpdc.1996.0030","volume":"33","author":"Y. Chang","year":"1996","unstructured":"Y. Chang. A simulation study on distributed mutual exclusion. J. Parallel Distrib. Comput., 33(2):107\u2013121, March 1996.","journal-title":"J. Parallel Distrib. Comput."},{"key":"167_CR2","first-page":"295","volume":"3","author":"Y. Chang","year":"1990","unstructured":"Y. Chang, M. Singhal, and M. Liu. An improved O(log(n)) mutual exclusion algorithm for distributed processing. In Int. Conference on Parallel Processing, volume 3, pages 295\u2013302, 1990.","journal-title":"Int. Conference on Parallel Processing"},{"key":"167_CR3","doi-asserted-by":"crossref","unstructured":"S. Fu, N. Tzeng, and Z. Li. Empirical evaluation of distributed mutual exclusion algorithms. In International Parallel Processing Symposium, pages 255\u2013259, 1997.","DOI":"10.1109\/IPPS.1997.580904"},{"key":"167_CR4","doi-asserted-by":"crossref","unstructured":"T. Johnson. A performance comparison of fast distributed mutual exclusion algorithms. In Proc. 1995 Int. Conf. on Parallel Processing, pages 258\u2013264, 1995.","DOI":"10.1109\/IPPS.1995.395942"},{"issue":"9","key":"167_CR5","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1109\/12.83661","volume":"40","author":"A. Kumar","year":"1991","unstructured":"A. Kumar. Hierachical quorum consensus: A new algorithm for managing replicated data. IEEE Trans. On Computers, 40(9):994\u20131004, 1991.","journal-title":"IEEE Trans. On Computers"},{"issue":"7","key":"167_CR6","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"L. Lamport. Time, clocks and ordering of events in distributed systems. Comm. ACM, 21(7):558\u2013565, June 1978.","journal-title":"Comm. ACM"},{"issue":"4","key":"167_CR7","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/75104.75105","volume":"7","author":"K. Li","year":"1989","unstructured":"K. Li and P. Hudak. Memory coherence in shared virtual memory systems. ACM Trans. Comput. Systems, 7(4):321\u2013359, November 1989.","journal-title":"ACM Trans. Comput. Systems"},{"issue":"2","key":"167_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M. Maekawa","year":"1985","unstructured":"M. Maekawa. A sqrt(n) algorithm for mutual exclusion in decentralized systems. ACM Trans. on Computer Systems, 3(2):145\u2013159, 1985.","journal-title":"ACM Trans. on Computer Systems"},{"key":"167_CR9","doi-asserted-by":"crossref","unstructured":"F. Mueller. Prioritized token-based mutual exclusion for distributed systems. In International Parallel Processing Symposium, pages 791\u2013795, 1998.","DOI":"10.1109\/IPPS.1998.670018"},{"issue":"1","key":"167_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jpdc.1996.0041","volume":"34","author":"M. Naimi","year":"1996","unstructured":"M. Naimi, M. Trehel, and A. Arnold. A log(N) distributed mutual exclusion algorithm based on path reversal. J. Parallel Distrib. Comput., 34(1):1\u201313, April 1996.","journal-title":"J. Parallel Distrib. Comput."},{"key":"167_CR11","doi-asserted-by":"crossref","unstructured":"M. L. Neilsen and M. Mizuno. A dag-based algorithm for mutual exclusion. In Distributed Computer Systems, pages 354\u2013360, 1991.","DOI":"10.1109\/ICDCS.1991.148689"},{"issue":"4","key":"167_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0190(89)90211-1","volume":"30","author":"K. Raymond","year":"1989","unstructured":"K. Raymond. A distributed algorithm for multiple entries to a critical section. Information Processing Letters, 30(4):189\u2013193, February 1989.","journal-title":"Information Processing Letters"},{"issue":"1","key":"167_CR13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Systems, 7(1):61\u201377, February 1989.","journal-title":"ACM Trans. Comput. Systems"},{"issue":"1","key":"167_CR14","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(92)90079-B","volume":"41","author":"P. Srimani","year":"1992","unstructured":"P. Srimani and R. Reddy. Another distributed algorithm for multiple entries to a critical section. Information Processing Letters, 41(1):51\u201357, January 1992.","journal-title":"Information Processing Letters"},{"key":"167_CR15","volume-title":"Master\u2019s thesis","author":"C. Wagner","year":"1999","unstructured":"C. Wagner. Algorithmen zum gegenseiten Ausschlu\u00df in verteilten Systemen. Master\u2019s thesis, Humboldt University Berlin, Germany, December 1999."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2000 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44520-X_167","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:36:20Z","timestamp":1737398180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44520-X_167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679561","9783540445203"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44520-x_167","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"18 August 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}