{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T01:53:15Z","timestamp":1782870795252,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642330773","type":"print"},{"value":"9783642330780","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33078-0_20","type":"book-chapter","created":{"date-parts":[[2012,9,3]],"date-time":"2012-09-03T17:37:49Z","timestamp":1346693869000},"page":"273-287","source":"Crossref","is-referenced-by-count":24,"title":["Performance, Scalability, and Semantics of Concurrent FIFO Queues"],"prefix":"10.1007","author":[{"given":"Christoph M.","family":"Kirsch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hannes","family":"Payer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harald","family":"R\u00f6ck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ana","family":"Sokolova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-17653-1_29","volume-title":"Principles of Distributed Systems","author":"Y. Afek","year":"2010","unstructured":"Afek, Y., Korland, G., Yanovsky, E.: Quasi-Linearizability: Relaxed Consistency for Improved Concurrency. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol.\u00a06490, pp. 395\u2013410. Springer, Heidelberg (2010)"},{"key":"20_CR2","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, 1020\u20131048 (1994)","journal-title":"Journal of the ACM"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P., Michael, M., Vechev, M.: Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. In: Proc. of Principles of Programming Languages (POPL), pp. 487\u2013498. ACM (2011)","DOI":"10.1145\/1925844.1926442"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocations (extended abstract). In: Proc. Symposium on Theory of computing (STOC), pp. 593\u2013602. ACM (1994)","DOI":"10.1145\/195058.195412"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1016\/j.jpdc.2005.03.011","volume":"65","author":"D. Bader","year":"2005","unstructured":"Bader, D., Cong, G.: A fast, parallel spanning tree algorithm for symmetric multiprocessors (smps). Journal of Parallel and Distributed Computing\u00a065, 994\u20131006 (2005)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"6","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1137\/S009753970444435X","volume":"35","author":"P. Berenbrink","year":"2006","unstructured":"Berenbrink, P., Czumaj, A., Steger, A., V\u00f6cking, B.: Balanced allocations: The heavily loaded case. SIAM Journal on Computing\u00a035(6), 1350\u20131385 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Chakradhar, S., Raghunathan, A.: Best-effort computing: re-thinking parallel software and hardware. In: Proc. Design Automation Conference, pp. 865\u2013870. ACM (2010)","DOI":"10.1145\/1837274.1837492"},{"key":"20_CR8","unstructured":"Henzinger, T., Kirsch, C., Payer, H., Sezgin, A., Sokolova, A.: Quantitative relaxation of concurrent data structures. Technical Report 2012-03. Department of Computer Sciences. University of Salzburg (May 2012)"},{"key":"20_CR9","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc. (2008)"},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.: Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"20_CR11","unstructured":"Incze, D.H.I., Shavit, N., Tzafrir, M.: Flat combining and the synchronization-parallelism tradeoff. In: Proc. Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 355\u2013364. ACM (2010)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Kirsch, C., Payer, H., R\u00f6ck, H., Sokolova, A.: Brief announcement: Scalability versus semantics of concurrent FIFO queues. In: Proc. Symposium on Principles of Distributed Computing (PODC). ACM (2011)","DOI":"10.1145\/1993806.1993869"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Michael, M., Scott, M.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proc. Symposium on Principles of Distributed Computing (PODC), pp. 267\u2013275. ACM (1996)","DOI":"10.1145\/248052.248106"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Michael, M., Vechev, M., Saraswat, V.: Idempotent work stealing. In: Proc. Principles and Practice of Parallel Programming (PPoPP), pp. 45\u201354. ACM (2009)","DOI":"10.1145\/1594835.1504186"},{"issue":"10","key":"20_CR15","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1145\/63039.63042","volume":"31","author":"S. Park","year":"1988","unstructured":"Park, S., Miller, K.: Random number generators: good ones are hard to find. Communications of the ACM\u00a031(10), 1192\u20131201 (1988)","journal-title":"Communications of the ACM"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-49543-6_13","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"M. Raab","year":"1998","unstructured":"Raab, M., Steger, A.: \"Balls into Bins\" - A Simple and Tight Analysis. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol.\u00a01518, pp. 159\u2013170. Springer, Heidelberg (1998)"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/1897852.1897873","volume":"54","author":"N. Shavit","year":"2011","unstructured":"Shavit, N.: Data structures in the multicore age. Communications ACM\u00a054, 76\u201384 (2011)","journal-title":"Communications ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33078-0_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:54:27Z","timestamp":1620114867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33078-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330773","9783642330780"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33078-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}