{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T17:59:16Z","timestamp":1765994356164,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319436586"},{"type":"electronic","value":"9783319436593"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-43659-3_34","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T02:54:01Z","timestamp":1470624841000},"page":"460-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["CBPQ: High Performance Lock-Free Priority Queue"],"prefix":"10.1007","author":[{"given":"Anastasia","family":"Braginsky","sequence":"first","affiliation":[]},{"given":"Nachshon","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"Erez","family":"Petrank","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"key":"34_CR1","unstructured":"Braginsky, A., Cohen, N., Petrank, E.: CBPQ: High performance lock-free priority queue (full version). \n                      http:\/\/www.cs.technion.ac.il\/~erez\/papers.html"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Braginsky, A., Kogan, A., Petrank, E.: Drop the anchor: lightweight memory management for non-blocking data structures. SPAA (2013)","DOI":"10.1145\/2486159.2486184"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-17679-1_10","volume-title":"Distributed Computing and Networking","author":"A Braginsky","year":"2011","unstructured":"Braginsky, A., Petrank, E.: Locality-conscious lock-free linked lists. In: Aguilera, M.K., Yu, H., Vaidya, N.H., Srinivasan, V., Choudhury, R.R. (eds.) ICDCN 2011. LNCS, vol. 6522, pp. 107\u2013118. Springer, Heidelberg (2011)"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Brown, T.A.: Reclaiming memory for lock-free data structures: There has to be a better way. In: PODC (2015)","DOI":"10.1145\/2767386.2767436"},{"key":"34_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/978-3-662-45174-8_28","volume-title":"Distributed Computing","author":"I Calciu","year":"2014","unstructured":"Calciu, I., Mendes, H., Herlihy, M.: The adaptive priority queue with elimination and combining. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 406\u2013420. Springer, Heidelberg (2014)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, N., Petrank, E.: Automatic memory reclamation for lock-free data structures. In: OOPSLA 2015 (2015)","DOI":"10.1145\/2814270.2814298"},{"key":"34_CR7","unstructured":"Cohen, N., Petrank, E.: Efficient memory management for lock-free data structures with optimistic access, SPAA 2015, pp. 254\u2013263. ACM (2015). \n                      http:\/\/doi.acm.org\/10.1145\/2755573.2755579"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Dragicevic, K., Bauer, D.: Optimization techniques for concurrent stm-based implementations: a concurrent binary heap as a case study. In: IPDPS (2009)","DOI":"10.1109\/IPDPS.2009.5161153"},{"key":"34_CR9","unstructured":"Fraser, K.: Practical lock-freedom. In: Ph.D. dissertation, University of Cambridge (2004)"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45414-4_21","volume-title":"Distributed Computing","author":"TL Harris","year":"2001","unstructured":"Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 300\u2013314. Springer, Heidelberg (2001)"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2009.08.011","volume":"70","author":"D Hendler","year":"2010","unstructured":"Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. J. Parallel Distrib. Comput. 70, 1\u201312 (2010)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"34_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"34_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 Pub. Inc., San Francisco (2008)"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Hunt, G., Michael, M., Parthasarathy, S., Scott, M.: An efficient algorithm for concurrent priority queue heaps. In: Information Processing Letters (1996)","DOI":"10.1016\/S0020-0190(96)00148-2"},{"key":"34_CR15","first-page":"206","volume-title":"Lecture Notes in Computer Science","author":"Jonatan Lind\u00e9n","year":"2013","unstructured":"Linden, J., Jonsson, B.: A skiplist-based concurrent priority queue with minimal memory contention. In: OPODIS 2013 (2013)"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Liu, Y., Spear, M.: Mounds: array-based concurrent priority queues. In: Proceedings of the ICpp (2012)","DOI":"10.1109\/ICPP.2012.42"},{"key":"34_CR17","unstructured":"Lotan, I., Shavit, N.: Skiplist-based concurrent priority queues. In: Proceedings of the IPDPS (2000)"},{"key":"34_CR18","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s002240000072","volume":"30","author":"N Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Elimination trees and the construction of pools and stacks. Theory Comput. Syst. 30, 645\u2013670 (1997)","journal-title":"Theory Comput. Syst."},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/j.jpdc.2004.12.005","volume":"65","author":"H Sundell","year":"2005","unstructured":"Sundell, H., Tsigas, P.: Fast and lock-free concurrent priority queues for multi-thread systems. J. Parallel Distrib. Comput. 65, 609\u2013627 (2005)","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2016: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43659-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T00:06:58Z","timestamp":1596931618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43659-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319436586","9783319436593"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43659-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/europar2016.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}