{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:44Z","timestamp":1720624964837},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3772,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1571-0661(04)81017-x","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"260-280","source":"Crossref","is-referenced-by-count":12,"special_numbering":"C","title":["Space- and Time-adaptive Nonblocking Algorithms"],"prefix":"10.1016","volume":"78","author":[{"given":"Maurice","family":"Herlihy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Luchangco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Moir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Long-lived renaming made adaptive. In Proceedings of the 18th Annual ACM Symposium on Principles of Dsitributed Computing, pages 91\u2013104, 1999.","DOI":"10.1145\/301308.301335"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB2","doi-asserted-by":"crossref","unstructured":"Y. Afek, D. Dauber, and D. Touitou. Wait-free made fast. In Proceedings of the 27th Annual Symposium on Theory of Computing, pages 538\u2013547, 1995.","DOI":"10.1145\/225058.225271"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB3","doi-asserted-by":"crossref","unstructured":"A. Agesen, D. Detlefs, C. Flood, A. Garthwaite, P. Martin, M. Moir, N. Shavit, and G. Steele. DCAS-based concurrent deques. Theory of Computing Systems, 2002. To appear. A preliminary version appeared in the Proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures.","DOI":"10.1007\/s00224-002-1058-2"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB4","doi-asserted-by":"crossref","unstructured":"J. Anderson and M. Moir. Using local-spin \u03ba-exclusion algorithms to improve wait-free object implementations. Distributed Computing, 11:1\u201320, 1997. A preliminary version appeared in Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, 1994 pp. 141\u2013150.","DOI":"10.1007\/s004460050039"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB5","doi-asserted-by":"crossref","unstructured":"H. Attiya, A. Bar-Noy, D. Dolve, D. Koller, D. Peleg, and R. Reischuk. Achievable cases in a asynchronous environment. In Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pages 337\u2013346, 1987.","DOI":"10.1109\/SFCS.1987.5"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB6","doi-asserted-by":"crossref","unstructured":"H. Attiya, A. Fouren, and E. Gafni. An adaptive collect algorithm and application. Distributed Computing, 2002. to appear.","DOI":"10.1007\/s004460100067"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB7","doi-asserted-by":"crossref","unstructured":"D. Detlefs, C. Flood, A. Garthwaite, P. Martin, N. Shavit, and G. Steele. Even better DCAS-based concurrent deques. In Proceedings of the 14th International Conference on Distributed Computing, pages 59\u201373, 2000.","DOI":"10.1007\/3-540-40026-5_4"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB8","doi-asserted-by":"crossref","unstructured":"D. Detlefs, P. Martin, M. Moir, and G. Steele. Lock-free refernece counting. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, pages 190\u2013199, 2001.","DOI":"10.1145\/383962.384016"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Dave Dice and Alex Garthwaite. Mostly lock-free malloc. In ACM SIGPLAN international symposium on Memory management. ACM Press, 2002.","DOI":"10.1145\/512429.512451"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB10","doi-asserted-by":"crossref","unstructured":"M. Herlihy, V. Luchangco, P. Martin, and M. Moir. Dynamic-sized lock-free data structures. Technical Report TR-2002-110, Sun Microsystems Laboratories, 2002.","DOI":"10.1145\/571825.571847"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB11","doi-asserted-by":"crossref","unstructured":"M. Herlihy, V. Luchangco, and M. Moir. The repeat offender problem: A mechanism for supporting lock-free dynamic-sized data structures. In Proceedings of the 16th International Symposium on DIStributed Computing, 2002. A improved version of this paper is in preparation for journal submission; please contact authors.","DOI":"10.1007\/3-540-36108-1_23"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB12","first-page":"241","article-title":"How to make a multiprocessor computer that correctly executes multiprocess programs","author":"Lamport","year":"1979","journal-title":"IEEE Transactions on Computers, C-28(9)"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB13","unstructured":"P. Martin, M. Moir, and G. Steele. Dcas-based concurrent deques supporting bulk allocation. Technical Report TR-2002-111, Sun Microsystems Laboratories, 2002."},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB14","doi-asserted-by":"crossref","unstructured":"M. Michael. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In Proceedings of the 21st Annual ACM Symposium on the Principles of Distributed Computing, 2002.","DOI":"10.1145\/571825.571829"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB15","doi-asserted-by":"crossref","unstructured":"M. Nichael and M. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proceedings of the 15th Annual ACM Symposium on the Principles of Distributed Computing, pages 267\u2013276, 1996.","DOI":"10.1145\/248052.248106"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB16","doi-asserted-by":"crossref","unstructured":"M. Moir and J. Anderson. Waite-free algorithms for last,-long-lived renaming. Science of Computer Programming, 25:1\u201339 1995. A preliminary version appeared in Proceedings of the 8th International Workshop on Distributed Algorithms, 1994, pp. 141\u2013155.","DOI":"10.1016\/0167-6423(95)00009-H"},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB17","unstructured":"M. Saks, N. Shavit, and H. Woll. Optimal time randomized consensus\u2013making resilient algorithms fast in practice. In Proceedings of the second annual ACM-SIAM Symposium on Discrete algorithms, pages 351\u2013362, 1991."},{"key":"10.1016\/S1571-0661(04)81017-X_NEWBIB18","unstructured":"R. Treiber. Systems programming: Coping with parallelism. Technical Report RJ5118, IBM Almaden Research Center, 1986."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610481017X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610481017X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T03:12:47Z","timestamp":1585883567000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610481017X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":18,"alternative-id":["S157106610481017X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)81017-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}