{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,16]],"date-time":"2025-03-16T04:16:32Z","timestamp":1742098592126,"version":"3.38.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,12,16]],"date-time":"2011-12-16T00:00:00Z","timestamp":1323993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s00446-011-0150-8","type":"journal-article","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T12:54:08Z","timestamp":1323953648000},"page":"109-162","source":"Crossref","is-referenced-by-count":18,"title":["RMR-efficient implementations of comparison primitives using read and write operations"],"prefix":"10.1007","volume":"25","author":[{"given":"Wojciech","family":"Golab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassos","family":"Hadzilacos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Hendler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Woelfel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,16]]},"reference":[{"issue":"5","key":"150_CR1","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/j.jpdc.2006.11.006","volume":"67","author":"J. Anderson","year":"2007","unstructured":"Anderson J., Kim Y.-J.: A generic local-spin fetch-and- $${\\phi}$$ -based mutual exclusion algorithm. J. Parallel Distrib. Comput. 67(5), 551\u2013580 (2007)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"150_CR2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s00446-002-0084-2","volume":"15","author":"J. Anderson","year":"2002","unstructured":"Anderson J., Kim Y.-J.: An improved lower bound for the time complexity of mutual exclusion. Distrib. Comput. 15(4), 221\u2013253 (2002)","journal-title":"Distrib. Comput."},{"key":"150_CR3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00446-003-0088-6","volume":"16","author":"J. Anderson","year":"2003","unstructured":"Anderson J., Kim Y.-J., Herman T.: Shared-memory mutual exclusion: major research trends since 1986. Distrib. Comput. 16, 75\u2013110 (2003)","journal-title":"Distrib. Comput."},{"issue":"1","key":"150_CR4","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/71.80120","volume":"1","author":"T. Anderson","year":"1990","unstructured":"Anderson T.: The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst. 1(1), 6\u201316 (1990)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"150_CR5","doi-asserted-by":"crossref","unstructured":"Attiya, H., Hendler, D., Woelfel, P.: Tight RMR lower bounds for mutual exclusion and other problems. In: Proceedings of the 40th STOC (2008)","DOI":"10.1145\/1374376.1374410"},{"key":"150_CR6","doi-asserted-by":"crossref","unstructured":"Craig, T.: Queuing spin lock algorithms to support timing predictability. In: Proceedings of the 14th RTSS, pp. 148\u2013156 (1993)","DOI":"10.1109\/REAL.1993.393505"},{"key":"150_CR7","doi-asserted-by":"crossref","unstructured":"Cypher, R.: The communication requirements of mutual exclusion. In: Proceedings of the 7th SPAA, pp. 147\u2013156 (1995)","DOI":"10.1145\/215399.215434"},{"issue":"2","key":"150_CR8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s00446-010-0096-2","volume":"23","author":"R. Danek","year":"2010","unstructured":"Danek R., Golab W.: Closing the complexity gap between FCFS mutual exclusion and mutual exclusion. Distrib. Comput. 23(2), 87\u2013111 (2010)","journal-title":"Distrib. Comput."},{"issue":"9","key":"150_CR9","doi-asserted-by":"crossref","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. Commun. ACM 8(9), 569 (1965)","journal-title":"Commun. ACM"},{"issue":"6","key":"150_CR10","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1145\/268999.269000","volume":"44","author":"C. Dwork","year":"1997","unstructured":"Dwork C., Herlihy M., Waarts O.: Contention in shared memory algorithms. J. ACM 44(6), 779\u2013805 (1997)","journal-title":"J. ACM"},{"issue":"5","key":"150_CR11","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1145\/290179.290183","volume":"45","author":"F. Ellen","year":"1998","unstructured":"Ellen F., Herlihy M., Shavit N.: On the space complexity of randomized synchronization. J. ACM 45(5), 843\u2013862 (1998)","journal-title":"J. ACM"},{"key":"150_CR12","doi-asserted-by":"crossref","unstructured":"Fan, R., Lynch, N.: An Omega(n log n) lower bound on the cost of mutual exclusion. In: Proceedings of the 25th PODC, pp. 275\u2013284 (2006)","DOI":"10.1145\/1146381.1146423"},{"key":"150_CR13","doi-asserted-by":"crossref","unstructured":"Golab, W.: A complexity separation between the cache-coherent and distributed shared memory models. In: Proceedings of the 30th PODC, pp. 109\u2013118 (2011)","DOI":"10.1145\/1993806.1993822"},{"key":"150_CR14","unstructured":"Golab, W.: Constant-RMR implementations of CAS and other synchronization primitives using read and write operations. Ph.D. thesis, University of Toronto (2010)"},{"issue":"7","key":"150_CR15","doi-asserted-by":"crossref","first-page":"2726","DOI":"10.1137\/070686445","volume":"39","author":"W. Golab","year":"2010","unstructured":"Golab W., Hendler D., Woelfel P.: An O(1) RMRs leader election algorithm. SIAM J. Comput. 39(7), 2726\u20132760 (2010)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"150_CR16","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"150_CR17","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy M., Wing J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"150_CR18","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: A complete and constant time wait-free implementation of CAS from LL\/SC and vice versa. In: Proceedings of the 12th DISC, pp. 216\u2013230 (1998)","DOI":"10.1007\/BFb0056485"},{"key":"150_CR19","unstructured":"Lee, H.: Transformations of mutual exclusion algorithms from the cache-coherent model to the distributed shared memory model. In: Proceedings of the 25th ICDCS, pp. 261\u2013270 (2005)"},{"key":"150_CR20","doi-asserted-by":"crossref","unstructured":"Luchangco, V., Moir, M., Shavit, N.: On the uncontended complexity of consensus. In: Proceedings of the 17th DISC, pp. 45\u201359 (2003)","DOI":"10.1007\/978-3-540-39989-6_4"},{"issue":"3","key":"150_CR21","first-page":"219","volume":"2","author":"N. Lynch","year":"1989","unstructured":"Lynch N., Tuttle M.: An introduction to input\/output automata. CWI Q. 2(3), 219\u2013246 (1989)","journal-title":"CWI Q."},{"key":"150_CR22","doi-asserted-by":"crossref","unstructured":"Moir, M.: Practical implementations of non-blocking synchronization primitives. In: Proceedings of the 16th PODC, pp. 219\u2013228 (1997)","DOI":"10.1145\/259380.259442"},{"key":"150_CR23","volume-title":"Computer Organization & Design: The Hardware\/Software Interface","author":"D.A. Patterson","year":"1994","unstructured":"Patterson D.A., Hennessy J.L.: Computer Organization & Design: The Hardware\/Software Interface. Morgan Kaufmann, San Francisco, California (1994)"},{"issue":"1","key":"150_CR24","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01784242","volume":"9","author":"J.-H. Yang","year":"1995","unstructured":"Yang J.-H., Anderson J.: A fast, scalable mutual exclusion algorithm. Distrib. Comput. 9(1), 51\u201360 (1995)","journal-title":"Distrib. Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-011-0150-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-011-0150-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-011-0150-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T22:15:28Z","timestamp":1742076928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-011-0150-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,16]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["150"],"URL":"https:\/\/doi.org\/10.1007\/s00446-011-0150-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2011,12,16]]}}}