{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T19:45:27Z","timestamp":1745437527807,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031606021"},{"type":"electronic","value":"9783031606038"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-60603-8_14","type":"book-chapter","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:01:39Z","timestamp":1716379299000},"page":"238-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Highly-Efficient Persistent FIFO Queues"],"prefix":"10.1007","author":[{"given":"Panagiota","family":"Fatourou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Giachoudis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Mallis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,23]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Attiya, H., Ben-Baruch, O., Fatourou, P., Hendler, D., Kosmas, E.: Detectable recovery of lock-free data structures. In: Lee, J., Agrawal, K., Spear, M.F. (eds.) PPoPP 2022: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2\u20136, 2022, pp. 262\u2013277. ACM (2022). https:\/\/doi.org\/10.1145\/3503221.3508444","DOI":"10.1145\/3503221.3508444"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Ben-David, N., Blelloch, G.E., Friedman, M., Wei, Y.: Delay-free concurrency on faulty persistent memory. In: The 31st ACM Symposium on Parallelism in Algorithms and Architectures, pp. 253\u2013264. SPAA 2019, Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3323165.3323187","DOI":"10.1145\/3323165.3323187"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Correia, A., Felber, P., Ramalhete, P.: Romulus: efficient algorithms for persistent transactional memory. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, pp. 271\u2013282. SPAA 2018, Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3210377.3210392","DOI":"10.1145\/3210377.3210392"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Correia, A., Felber, P., Ramalhete, P.: Persistent memory and the rise of universal constructions. In: Proceedings of the Fifteenth European Conference on Computer Systems. EuroSys 2020, Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3342195.3387515","DOI":"10.1145\/3342195.3387515"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Fatourou, P., Kallimanis, N.D.: A highly-efficient wait-free universal construction. In: Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 325\u2013334. SPAA 2011, Association for Computing Machinery, New York, NY, USA (2011). https:\/\/doi.org\/10.1145\/1989493.1989549","DOI":"10.1145\/1989493.1989549"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Fatourou, P., Kallimanis, N.D.: Revisiting the combining synchronization technique. In: Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 257\u2013626. PPoPP 2012, Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2145816.2145849","DOI":"10.1145\/2145816.2145849"},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00224-013-9491-y","volume":"55","author":"P Fatourou","year":"2014","unstructured":"Fatourou, P., Kallimanis, N.D.: Highly-efficient wait-free synchronization. Theory Comput. Syst. 55(3), 475\u2013520 (2014)","journal-title":"Theory Comput. Syst."},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Fatourou, P., Kallimanis, N.D.: Lock oscillation: boosting the performance of concurrent data structures. In: Aspnes, J., Bessani, A., Felber, P., Leit\u00e3o, J. (eds.) 21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisbon, Portugal, December 18\u201320, 2017. LIPIcs, vol.\u00a095, pp. 8:1\u20138:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017https:\/\/doi.org\/10.4230\/LIPICS.OPODIS.2017.8","DOI":"10.4230\/LIPICS.OPODIS.2017.8"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Fatourou, P., Kallimanis, N.D., Kosmas, E.: The performance power of software combining in persistence. In: Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 337\u2013352. PPoPP 2022, Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3503221.3508426","DOI":"10.1145\/3503221.3508426"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Fatourou, P., Kallimanis, N.D., Ropars, T.: An efficient wait-free resizable hash table. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, pp. 111\u2013120. SPAA 2018, Association for Computing Machinery, New York, NY, USA (2018).https:\/\/doi.org\/10.1145\/3210377.3210408","DOI":"10.1145\/3210377.3210408"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Friedman, M., Herlihy, M., Marathe, V., Petrank, E.: A persistent lock-free queue for non-volatile memory. SIGPLAN Not. 53(1), 28\u201340 (2018). https:\/\/doi.org\/10.1145\/3200691.3178490","DOI":"10.1145\/3200691.3178490"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/3200691.3178490","volume":"53","author":"M Friedman","year":"2018","unstructured":"Friedman, M., Herlihy, M., Marathe, V., Petrank, E.: A persistent lock-free queue for non-volatile memory. ACM SIGPLAN Notices 53(1), 28\u201340 (2018)","journal-title":"ACM SIGPLAN Notices"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Giachoudis, N., Fatourou, P., Mallis, G.: Highly-efficient persistent fifo queues. Zenodo (2024). https:\/\/doi.org\/10.5281\/zenodo.10699312","DOI":"10.5281\/zenodo.10699312"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Hendler, D., Incze, I., Shavit, N., Tzafrir, M.: Flat combining and the synchronization-parallelism tradeoff. In: Proceedings of the Twenty-second Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 355\u2013364 (2010)","DOI":"10.1145\/1810479.1810540"},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990). https:\/\/doi.org\/10.1145\/78969.78972","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"14_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-662-53426-7_23","volume-title":"Distributed Computing","author":"J Izraelevitz","year":"2016","unstructured":"Izraelevitz, J., Mendes, H., Scott, M.L.: Linearizability of persistent memory objects under a full-system-crash failure model. In: Gavoille, C., Ilcinkas, D. (eds.) Distributed Computing. LNCS, vol. 9888, pp. 313\u2013327. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_23"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1109\/TPDS.2017.2767046","volume":"29","author":"D Klaftenegger","year":"2018","unstructured":"Klaftenegger, D., Sagonas, K., Winblad, K.: Queue delegation locking. IEEE Trans. Parallel Distrib. Syst. 29(3), 687\u2013704 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"14_CR18","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 the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 267\u2013275 (1996)","DOI":"10.1145\/248052.248106"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Morrison, A., Afek, Y.: Fast concurrent queues for x86 processors. In: Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 103\u2013112 (2013)","DOI":"10.1145\/2442516.2442527"},{"key":"14_CR20","unstructured":"PMDK: The persistent memory development kit. https:\/\/github.com\/pmem\/pmdk\/, https:\/\/github.com\/pmem\/pmdk\/"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Ramalhete, P., Correia, A., Felber, P., Cohen, N.: Onefile: a wait-free persistent transactional memory. In: 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 151\u2013163. IEEE (2019)","DOI":"10.1109\/DSN.2019.00028"},{"key":"14_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-030-91081-5_38","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Rusanovsky","year":"2021","unstructured":"Rusanovsky, M., Attiya, H., Ben-Baruch, O., Gerby, T., Hendler, D., Ramalhete, P.: Flat-combining-based persistent data structures for non-volatile memory. In: Johnen, C., Schiller, E.M., Schmid, S. (eds.) SSS 2021. LNCS, vol. 13046, pp. 505\u2013509. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-91081-5_38"},{"key":"14_CR23","unstructured":"Rusanovsky, M., Ben-Baruch, O., Hendler, D., Ramalhete, P.: A flat-combining-based persistent stack for non-volatile memory. CoRR abs\/2012.12868 (2020). (version submited at 23 December, 2020), https:\/\/arxiv.org\/abs\/2012.12868"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Sela, G., Petrank, E.: Durable queues: the second amendment. In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, pp. 385\u2013397. Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3409964.3461791","DOI":"10.1145\/3409964.3461791"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60603-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:03:17Z","timestamp":1716379397000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60603-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031606021","9783031606038"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60603-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietri sul Mare","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sirocco2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}