{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:29:51Z","timestamp":1725568191705},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287001"},{"type":"electronic","value":"9783540319252"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11549468_72","type":"book-chapter","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T17:18:34Z","timestamp":1288027114000},"page":"654-663","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Fault-Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree"],"prefix":"10.1007","author":[{"given":"Julien","family":"Sopena","sequence":"first","affiliation":[]},{"given":"Luciana","family":"Arantes","sequence":"additional","affiliation":[]},{"given":"Marin","family":"Bertier","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Sens","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"72_CR1","unstructured":"Bertier, M., Arantes, L., Sens, P.: Hierarchical token based mutual exclusion algorithms. In: 4th IEEE\/ACM CCGrid 2004 (April 10, 2004)"},{"issue":"7","key":"72_CR2","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM\u00a021(7), 558\u2013564 (1978)","journal-title":"Communications of the ACM"},{"issue":"2","key":"72_CR3","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":"72_CR4","volume-title":"Workshop on Fault-Tolerant Parallel and Distributed Systems","author":"F. Mueller","year":"2001","unstructured":"Mueller, F.: Fault tolerance for token-based synchronization protocols. In: Workshop on Fault-Tolerant Parallel and Distributed Systems, April 2001, IEEE, Los Alamitos (2001)"},{"issue":"1","key":"72_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jpdc.1996.0041","volume":"34","author":"M. Naimi","year":"1996","unstructured":"Naimi, M., Trehel, M., Arnold, A.: A log (N) distributed mutual exclusion algorithm based on path reversal. Journal of Parallel and Distributed Computing\u00a034(1), 1\u201313 (1996)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"72_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BFb0019802","volume-title":"Distributed Algorithms","author":"M. Naimi","year":"1988","unstructured":"Naimi, M., Trehel, M.: How to detect a failure and regenerate the token in the log(n) distributed algorithm for mutual exclusion. In: van Leeuwen, J. (ed.) WDAG 1987. LNCS, vol.\u00a0312, pp. 155\u2013166. Springer, Heidelberg (1988)"},{"issue":"1","key":"72_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems (TOCS)\u00a07(1), 61\u201377 (1989)","journal-title":"ACM Transactions on Computer Systems (TOCS)"},{"key":"72_CR8","doi-asserted-by":"crossref","unstructured":"Ricart, G., Agrawala, A.: An optimal algorithm for mutual exclusion in computer networks. CACM: Communications of the ACM\u00a024 (1981)","DOI":"10.1145\/358527.358537"},{"issue":"4","key":"72_CR9","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1145\/6110.214406","volume":"3","author":"I. Suzuki","year":"1985","unstructured":"Suzuki, I., Kasami, T.: A distributed mutual exclusion algorithm. ACM Transactions on Computer Systems (TOCS)\u00a03(4), 344\u2013349 (1985)","journal-title":"ACM Transactions on Computer Systems (TOCS)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2005 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549468_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:20:07Z","timestamp":1587342007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549468_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287001","9783540319252"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11549468_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}