{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:11:33Z","timestamp":1725570693315},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176524"},{"type":"electronic","value":"9783642176531"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17653-1_27","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T05:50:47Z","timestamp":1291614647000},"page":"364-379","source":"Crossref","is-referenced-by-count":5,"title":["Fast Local-Spin Abortable Mutual Exclusion with Bounded Space"],"prefix":"10.1007","author":[{"given":"Hyonho","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, J.H., Kim, Y.-J., Herman, T.: Shared-Memory Mutual Exclusion: Major Research Trends Since 1986. Distributed Computing (2002)","DOI":"10.1007\/s00446-003-0088-6"},{"key":"27_CR2","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 Annual ACM Symposium on Theory of Computing, pp. 217\u2013226 (2008)","DOI":"10.1145\/1374376.1374410"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1007\/978-3-540-87779-0_41","volume-title":"DISC 2008","author":"R. Danek","year":"2008","unstructured":"Danek, R., Lee, H.: Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 512\u2013513. Springer, Heidelberg (2008)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Detlefs, D.L., Martin, P.A., Moir, M., Steele Jr., G.L.: Lock-Free Reference Counting. In: The 20th Annual ACM Symposium on Principles of Distributed Computing, pp. 190\u2013199 (2001)","DOI":"10.1145\/383962.384016"},{"issue":"9","key":"27_CR5","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"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Goldberg, B.: Generational Reference Counting: A Reduced-communication Distributed Storage Reclamation Scheme. In: Proceedings of the ACM SIGPLAN 1989 Conference on Programming Language Design and Implementation (1989)","DOI":"10.1145\/73141.74846"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Martin, P., Moir, M.: Brief Announcement: Dynamic-sized lock-free data structures. In: Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (2002)","DOI":"10.1145\/571842.571847"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/S1571-0661(04)81017-X","volume":"78","author":"M. Herlihy","year":"2003","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Space and Time Adaptive Non-blocking Algorithms. Electronic Notes in Theoretical Computer Science\u00a078, 260\u2013280 (2003)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: Adaptive and Efficient Abortable Mutual Exclusion. In: Proceedings of the 22th Annual ACM Symposium on Principles of Distributed Computing (July 2003)","DOI":"10.1145\/872035.872079"},{"issue":"8","key":"27_CR10","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"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Michael, M.M.: Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects. IEEE Transactions on Parallel and Distributed Systems\u00a015(6) (2004)","DOI":"10.1109\/TPDS.2004.8"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Scott, M.L.: Non-blocking Timeout in Scalable Queue-based Spin Locks. In: The 21st Annual Symposium on Principles of Distributed Computing (July 2002)","DOI":"10.1145\/571825.571830"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Scott, M.L., Scherer III, W.N.: Scalable Queue-based Spin Locks with Timeout. In: The 8th ACM Symposium on Principles and Practice of Parallel Programming (June 2001)","DOI":"10.1145\/379539.379566"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Valois, J.D.: Lock-Free Linked Lists Using Compare-and-Swap. In: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pp. 214\u2013222 (1995)","DOI":"10.1145\/224964.224988"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17653-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T20:51:39Z","timestamp":1559854299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17653-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176524","9783642176531"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17653-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}