{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:08:44Z","timestamp":1775254124706,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030032319","type":"print"},{"value":"9783030032326","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-03232-6_24","type":"book-chapter","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T07:44:48Z","timestamp":1539935088000},"page":"365-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Concurrent Lock-Free Unbounded Priority Queue with Mutable Priorities"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Walulya","sequence":"first","affiliation":[]},{"given":"Bapi","family":"Chatterjee","sequence":"additional","affiliation":[]},{"given":"Ajoy K.","family":"Datta","sequence":"additional","affiliation":[]},{"given":"Rashmi","family":"Niyolia","sequence":"additional","affiliation":[]},{"given":"Philippas","family":"Tsigas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Kopinsky, J., Li, J., Shavit, N.: The spraylist: a scalable relaxed priority queue. In: ACM SIGPLAN Notices, vol. 50, pp. 11\u201320. ACM (2015)","DOI":"10.1145\/2858788.2688523"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Barnes, G.: A method for implementing lock-free shared-data structures. In: 5th SPAA, pp. 261\u2013270 (1993)","DOI":"10.1145\/165231.165265"},{"key":"24_CR3","unstructured":"Barnes, G.: Wait-free Algoritzms for Heaps. Department of Computer Science and Engineering, University of Washington (1994)"},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/2786763.2694359","volume":"43","author":"Tudor David","year":"2015","unstructured":"David, T., Guerraoui, R., Trigonakis, V.: Asynchronized concurrency: The secret to scaling concurrent search data structures. In: 20th ASPLOS, pp. 631\u2013644 (2015)","journal-title":"ACM SIGARCH Computer Architecture News"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11945529_11","volume-title":"Principles of Distributed Systems","author":"D Dechev","year":"2006","unstructured":"Dechev, D., Pirkelbauer, P., Stroustrup, B.: Lock-free dynamically resizable arrays. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 142\u2013156. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11945529_11"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"24_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: 23rd IPDPS, pp. 1\u20138 (2009)","DOI":"10.1109\/IPDPS.2009.5161153"},{"key":"24_CR9","unstructured":"Fraser, K.: Practical lock-freedom. Ph.D. thesis, University of Cambridge (2004)"},{"issue":"10","key":"24_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/84537.84545","volume":"33","author":"RM Fujimoto","year":"1990","unstructured":"Fujimoto, R.M.: Parallel discrete event simulation. Commun. ACM 33(10), 30\u201353 (1990)","journal-title":"Commun. ACM"},{"issue":"8","key":"24_CR11","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 Trans. Parallel Distrib. Syst. 20(8), 1173\u20131187 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. In: 16th SPAA, SPAA 2004, pp. 206\u2013215 (2004)","DOI":"10.1145\/1007912.1007944"},{"issue":"8","key":"24_CR13","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1002\/j.1538-7305.1984.tb00068.x","volume":"63","author":"GJ Henry","year":"1984","unstructured":"Henry, G.J.: The unix system: the fair share scheduler. AT&T Bell Lab. Tech. J. 63(8), 1845\u20131857 (1984)","journal-title":"AT&T Bell Lab. Tech. J."},{"issue":"1","key":"24_CR14","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 TOPLAS 13(1), 124\u2013149 (1991)","journal-title":"ACM TOPLAS"},{"issue":"5","key":"24_CR15","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1145\/161468.161469","volume":"15","author":"M Herlihy","year":"1993","unstructured":"Herlihy, M.: A methodology for implementing highly concurrent data objects. ACM Trans. Program. Lang. Syst. 15(5), 745\u2013770 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"24_CR16","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 TOPLAS 12(3), 463\u2013492 (1990)","journal-title":"ACM TOPLAS"},{"issue":"3","key":"24_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0020-0190(96)00148-2","volume":"60","author":"GC Hunt","year":"1996","unstructured":"Hunt, G.C., Michael, M.M., Parthasarathy, S., Scott, M.L.: An efficient algorithm for concurrent priority queue heaps. Inf. Process. Lett. 60(3), 151\u2013157 (1996)","journal-title":"Inf. Process. Lett."},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-57271-6_23","volume-title":"Distributed Algorithms","author":"A Israeli","year":"1993","unstructured":"Israeli, A., Rappoport, L.: Efficient wait-free implementation of a concurrent priority queue. In: Schiper, A. (ed.) WDAG 1993. LNCS, vol. 725, pp. 1\u201317. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57271-6_23"},{"issue":"6","key":"24_CR19","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."},{"issue":"6","key":"24_CR20","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Labs Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Labs Tech. J."},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Shavit, N., Lotan, I.: Skiplist-based concurrent priority queues. In: 14th IPDPS, pp. 263\u2013268. IEEE (2000)","DOI":"10.1109\/IPDPS.2000.845994"},{"issue":"2","key":"24_CR22","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s004460050028","volume":"10","author":"N Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. Distrib. Comput. 10(2), 99\u2013116 (1997)","journal-title":"Distrib. Comput."},{"issue":"5","key":"24_CR23","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(5), 609\u2013627 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"key":"24_CR24","unstructured":"Tamir, O., Morrison, A., Rinetzky, N.: A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms. In: 19th OPODIS (2016)"},{"issue":"4","key":"24_CR25","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1145\/31846.42227","volume":"34","author":"JS Vitter","year":"1987","unstructured":"Vitter, J.S.: Design and analysis of dynamic huffman codes. J. ACM (JACM) 34(4), 825\u2013845 (1987)","journal-title":"J. ACM (JACM)"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Walulya, I., Chatterjee, B., Datta, A.K., Niyoliya, R., Tsigas, P.: Concurrent lock-free unbounded priority queue with mutable priorities. Technical report, 2018:06, ISNN 1652\u2013926X, Department of Computer Science and Engineering, Chalmers University of Technology (2018)","DOI":"10.1007\/978-3-030-03232-6_24"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03232-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:49:31Z","timestamp":1775249371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03232-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030032319","9783030032326"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03232-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coord.c.titech.ac.jp\/symp\/sss2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}