{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:44:09Z","timestamp":1780994649903,"version":"3.54.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319268491","type":"print"},{"value":"9783319268507","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-26850-7_1","type":"book-chapter","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T04:14:46Z","timestamp":1455941686000},"page":"1-14","source":"Crossref","is-referenced-by-count":8,"title":["Scal: A Benchmarking Suite for Concurrent Data Structures"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Haas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"H\u00fctter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph M.","family":"Kirsch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Lippautz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mario","family":"Preishuber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ana","family":"Sokolova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,3,23]]},"reference":[{"key":"1_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. 6490, pp. 395\u2013410. Springer, Heidelberg (2010)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P., Michael, M.M., Vechev, M.: Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. In: Proceedings of Principles of Programming Languages (POPL), pp. 487\u2013498. ACM (2011)","DOI":"10.1145\/1925844.1926442"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Dodds, M., Haas, A., Kirsch, C.M.: A scalable, correct time-stamped stack. In: Proceedings of Symposium on Principles of Programming Languages (POPL), pp. 233\u2013246. ACM (2015)","DOI":"10.1145\/2775051.2676963"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Kallimanis, N.D.: A highly-efficient wait-free universal construction. In: Proceedings of Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 325\u2013334. ACM (2011)","DOI":"10.1145\/1989493.1989549"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Gramoli, V.: More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithms. In: Proceedings of Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 1\u201310. ACM (2015)","DOI":"10.1145\/2858788.2688501"},{"key":"1_CR6","unstructured":"Haas, A.: Fast Concurrent Data Structures Through Timestamping. Ph.D. thesis, University of Salzburg, Salzburg, Austria (2015)"},{"key":"1_CR7","unstructured":"Haas, A., Henzinger, T.A., Holzer, A., Kirsch, C.M., Lippautz, M., Payer, H., Sezgin, A., Sokolova, A., Veith, H.: Local linearizability. CoRR, abs\/1502.07118 (2015)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Haas, A., Henzinger, T.A., Kirsch, C.M., Lippautz, M., Payer, H., Sezgin, A., Sokolova, A.: Distributed queues in shared memory\u2013multicore performance and scalability through quantitative relaxation. In: Proceedings of International Conference on Computing Frontiers (CF). ACM (2013)","DOI":"10.1145\/2482767.2482789"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Haas, A., Kirsch, C.M., Lippautz, M., Payer, H.: How FIFO is your concurrent FIFO queue? In: Proceedings of Workshop on Relaxing Synchronization for Multicore and Manycore Scalability (RACES), pp. 1\u20138. ACM (2012)","DOI":"10.1145\/2414729.2414731"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Hendler, D., Incze, I., Shavit, N., Tzafrir, M.: Flat combining and the synchronization-parallelism tradeoff. In: Proceedings of Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 355\u2013364. ACM (2010)","DOI":"10.1145\/1810479.1810540"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. In: Proceedings of Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 206\u2013215. ACM (2004)","DOI":"10.1145\/1007912.1007944"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Kirsch, C.M., Payer, H., Sezgin, A., Sokolova, A.: Quantitative relaxation of concurrent data structures. In: Proceedings of Symposium on Principles of Programming Languages (POPL), pp. 317\u2013328. ACM (2013)","DOI":"10.1145\/2480359.2429109"},{"key":"1_CR13","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco (2008)"},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-39958-9_18","volume-title":"Parallel Computing Technologies","author":"CM Kirsch","year":"2013","unstructured":"Kirsch, C.M., Lippautz, M., Payer, H.: Fast and scalable, lock-free k-FIFO queues. In: Malyshkin, V. (ed.) PaCT 2013. LNCS, vol. 7979, pp. 208\u2013223. Springer, Heidelberg (2013)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-33078-0_20","volume-title":"Algorithms and Architectures for Parallel Processing","author":"CM Kirsch","year":"2012","unstructured":"Kirsch, C.M., Payer, H., R\u00f6ck, H., Sokolova, A.: Performance, scalability, and semantics of concurrent FIFO queues. In: Xiang, Y., Stojmenovic, I., Apduhan, B.O., Wang, G., Nakano, K., Zomaya, A. (eds.) ICA3PP 2012, Part I. LNCS, vol. 7439, pp. 273\u2013287. Springer, Heidelberg (2012)"},{"key":"1_CR17","series-title":"Fundamental Algorithms","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming. Fundamental Algorithms, vol. 1, 3rd edn. Addison Wesley, Redwood City (1997)","edition":"3"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Kogan, A., Petrank, E.: A methodology for creating fast wait-free data structures. In: Proceedings of Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 141\u2013150. ACM (2012)","DOI":"10.1145\/2370036.2145835"},{"key":"1_CR19","unstructured":"Michael, M.M.: ABA prevention using single-word instructions. Technical report RC 23089, IBM Research Center (2004)"},{"issue":"6","key":"1_CR20","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TPDS.2004.8","volume":"15","author":"MM Michael","year":"2004","unstructured":"Michael, M.M.: Hazard pointers: safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst. 15(6), 491\u2013504 (2004)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proceedings of Symposium on Principles of Distributed Computing (PODC), pp. 267\u2013275. ACM (1996)","DOI":"10.1145\/248052.248106"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Michael, M.M., Vechev, M.T., Saraswat, V.A.: Idempotent work stealing. In: Proceedings of Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 45\u201354. ACM (2009)","DOI":"10.1145\/1594835.1504186"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Morrison, A., Afek, Y.: Fast concurrent queues for x86 processors. In: Proceedings of Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 103\u2013112. ACM (2013)","DOI":"10.1145\/2517327.2442527"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Nguyen, H.H., Rinard, M.: Detecting and eliminating memory leaks using cyclic memory allocation. In: Proceedings of International Symposium on Memory Management (ISMM), pp. 15\u201330. ACM (2007)","DOI":"10.1145\/1296907.1296912"},{"issue":"3","key":"1_CR25","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. Commun. ACM 54(3), 76\u201384 (2011)","journal-title":"Commun. ACM"},{"key":"1_CR26","unstructured":"Treiber, R.K.: Systems programming: Coping with parallelism. Technical report RJ-5118, IBM Research Center (1986)"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26850-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:01:52Z","timestamp":1559386912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26850-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319268491","9783319268507"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26850-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}