{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:09:23Z","timestamp":1725563363459},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152900"},{"type":"electronic","value":"9783642152917"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","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":[[2010]]},"DOI":"10.1007\/978-3-642-15291-7_16","type":"book-chapter","created":{"date-parts":[[2010,8,30]],"date-time":"2010-08-30T11:56:39Z","timestamp":1283169399000},"page":"151-162","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Scalable Producer-Consumer Pools Based on Elimination-Diffraction Trees"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[]},{"given":"Guy","family":"Korland","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Natanzon","sequence":"additional","affiliation":[]},{"given":"Nir","family":"Shavit","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"The Art of Multiprocessor Programming","year":"2008","author":"M. Herlihy","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann, NY (2008)","key":"16_CR1"},{"issue":"5","key":"16_CR2","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/1506409.1506431","volume":"52","author":"W.N. Scherer III","year":"2009","unstructured":"Scherer III, W.N., Lea, D., Scott, M.L.: Scalable synchronous queues. Commun. ACM\u00a052(5), 100\u2013111 (2009)","journal-title":"Commun. ACM"},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/235543.235546","volume":"14","author":"N. Shavit","year":"1996","unstructured":"Shavit, N., Zemach, A.: Diffracting trees. ACM Trans. Comput. Syst.\u00a014(4), 385\u2013428 (1996)","journal-title":"ACM Trans. Comput. Syst."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/215399.215419","volume-title":"SPAA 1995: Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures","author":"N. Shavit","year":"1995","unstructured":"Shavit, N., Touitou, D.: Elimination trees and the construction of pools and stacks: preliminary version. In: SPAA 1995: Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, pp. 54\u201363. ACM, New York (1995)"},{"issue":"5","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1145\/185675.185815","volume":"41","author":"J. Aspnes","year":"1994","unstructured":"Aspnes, J., Herlihy, M., Shavit, N.: Counting networks. Journal of the ACM\u00a041(5), 1020\u20131048 (1994)","journal-title":"Journal of the ACM"},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1145\/210223.210225","volume":"13","author":"M. Herlihy","year":"1995","unstructured":"Herlihy, M., Lim, B., Shavit, N.: Scalable concurrent counting. ACM Transactions on Computer Systems\u00a013(4), 343\u2013364 (1995)","journal-title":"ACM Transactions on Computer Systems"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/1007912.1007944","volume-title":"SPAA 2004: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures","author":"D. Hendler","year":"2004","unstructured":"Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. In: SPAA 2004: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pp. 206\u2013215. ACM, New York (2004)"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/248052.248106","volume-title":"PODC 1996: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing","author":"M.M. Michael","year":"1996","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: PODC 1996: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, pp. 267\u2013275. ACM, New York (1996)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2010 - Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15291-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T10:25:25Z","timestamp":1589883925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15291-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152900","9783642152917"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15291-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}
