{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T00:05:08Z","timestamp":1789949108099,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642176524","type":"print"},{"value":"9783642176531","type":"electronic"}],"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_23","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T00:50:47Z","timestamp":1291596647000},"page":"302-317","source":"Crossref","is-referenced-by-count":18,"title":["Cache-Aware Lock-Free Queues for Multiple Producers\/Consumers and Weak Memory Consistency"],"prefix":"10.1007","author":[{"given":"Anders","family":"Gidenstam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H\u00e5kan","family":"Sundell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philippas","family":"Tsigas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","first-page":"43","volume-title":"Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2008)","author":"J. Giacomoni","year":"2008","unstructured":"Giacomoni, J., Moseley, T., Vachharajani, M.: Fastforward for efficient pipeline parallelism: a cache-optimized concurrent lock-free queue. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2008), pp. 43\u201352. ACM, New York (2008)"},{"issue":"8","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1109\/TPDS.2008.167","volume":"20","author":"A. Gidenstam","year":"2009","unstructured":"Gidenstam, A., Papatriantafilou, M., Sundell, H., Tsigas, P.: Efficient and reliable lock-free memory reclamation based on reference counting. IEEE Transactions on Parallel and Distributed Systems\u00a020(8), 1173\u20131187 (2009)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"11","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems\u00a011(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"23_CR4","first-page":"25","volume-title":"Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks","author":"L. Higham","year":"2005","unstructured":"Higham, L., Kawash, J.: Impact of instruction re-ordering on the correctness of shared-memory programs. In: Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 25\u201332. IEEE, Los Alamitos (December 2005)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-77096-1_29","volume-title":"Principles of Distributed Systems","author":"M. Hoffman","year":"2007","unstructured":"Hoffman, M., Shalev, O., Shavit, N.: The baskets queue. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol.\u00a04878, pp. 401\u2013414. Springer, Heidelberg (2007)"},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/69624.357207","volume":"5","author":"L. Lamport","year":"1983","unstructured":"Lamport, L.: Specifying concurrent program modules. ACM Trans. Program. Lang. Syst.\u00a05(2), 190\u2013222 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"23_CR7","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(8) (August 2004)","DOI":"10.1109\/TPDS.2004.8"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/248052.248106","volume-title":"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: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 267\u2013275. ACM Press, New York (1996)"},{"key":"23_CR9","first-page":"253","volume-title":"Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)","author":"M. Moir","year":"2005","unstructured":"Moir, M., Nussbaum, D., Shalev, O., Shavit, N.: Using elimination to implement scalable and lock-free fifo queues. In: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 253\u2013262. ACM, New York (2005)"},{"issue":"5","key":"23_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/1556444.1556455","volume":"36","author":"H. Sundell","year":"2008","unstructured":"Sundell, H., Tsigas, P.: Noble: non-blocking programming support via lock-free shared abstract data types. SIGARCH Comput. Archit. News\u00a036(5), 80\u201387 (2008)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"23_CR11","first-page":"134","volume-title":"Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001)","author":"P. Tsigas","year":"2001","unstructured":"Tsigas, P., Zhang, Y.: A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), pp. 134\u2013143. ACM Press, New York (2001)"}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T13:53:54Z","timestamp":1553262834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17653-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176524","9783642176531"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17653-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}