{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T06:57:11Z","timestamp":1794466631740,"version":"4.9.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319038490","type":"print"},{"value":"9783319038506","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03850-6_15","type":"book-chapter","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T00:53:16Z","timestamp":1386723196000},"page":"206-220","source":"Crossref","is-referenced-by-count":37,"title":["A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention"],"prefix":"10.1007","author":[{"given":"Jonatan","family":"Lind\u00e9n","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bengt","family":"Jonsson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-33651-5_39","volume-title":"Distributed Computing","author":"T. Crain","year":"2012","unstructured":"Crain, T., Gramoli, V., Raynal, M.: Brief announcement: a contention-friendly, non-blocking skip list. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 423\u2013424. Springer, Heidelberg (2012)"},{"issue":"76","key":"15_CR2","first-page":"1","volume":"6","author":"B. Drawert","year":"2012","unstructured":"Drawert, B., Engblom, S., Hellander, A.: URDME: a modular framework for stochastic simulation of reaction-transport processes in complex geometries. BMC Systems Biology\u00a06(76), 1\u201317 (2012)","journal-title":"BMC Systems Biology"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Fomitchev, M., Ruppert, E.: Lock-free linked lists and skip lists. In: PODC 2004, pp. 50\u201359. ACM (2004)","DOI":"10.1145\/1011767.1011776"},{"key":"15_CR4","unstructured":"Fraser, K.: Practical lock freedom. Ph.D. thesis, University of Cambridge (2003)"},{"key":"15_CR5","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":"T.L. Harris","year":"2001","unstructured":"Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 300\u2013314. Springer, Heidelberg (2001)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Hendler, D., Incze, I., Shavit, N., Tzafrir, M.: Flat combining and the synchronization-parallelism tradeoff. In: SPAA, pp. 355\u2013364. ACM (2010)","DOI":"10.1145\/1810479.1810540"},{"issue":"3","key":"15_CR7","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.\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"15_CR8","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc. (2008)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Holzmann, G.: The model checker SPIN. IEEE Trans. on Software Engineering SE-23(5), 279\u2013295 (1997)","DOI":"10.1109\/32.588521"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0020-0190(96)00148-2","volume":"60","author":"G.C. 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.\u00a060(3), 151\u2013157 (1996)","journal-title":"Inf. Process. Lett."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Lotan, I., Shavit., N.: Skiplist-based concurrent priority queues. In: IPDPS, pp. 263\u2013268. IEEE (2000)","DOI":"10.1109\/IPDPS.2000.845994"},{"issue":"6","key":"15_CR12","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TPDS.2004.8","volume":"15","author":"M.M. Michael","year":"2004","unstructured":"Michael, M.M.: Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst.\u00a015(6), 491\u2013504 (2004)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Molka, D., Hackenberg, D., Schone, R., Muller, M.: Memory performance and cache coherency effects on an intel nehalem multiprocessor system. In: PACT 2009, pp. 261\u2013270. ACM (2009)","DOI":"10.1109\/PACT.2009.22"},{"key":"15_CR14","unstructured":"Pugh, W.: Concurrent maintenance of skip lists. Tech. Rep. CS-TR-2222, Dept. of Computer Science, University of Maryland, College Park (1990)"},{"issue":"6","key":"15_CR15","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM\u00a033(6), 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Sundell, H., Tsigas, P.: Scalable and lock-free concurrent dictionaries. In: SAC 2004, pp. 1438\u20131445. ACM (2004)","DOI":"10.1145\/967900.968188"},{"issue":"5","key":"15_CR17","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.\u00a065(5), 609\u2013627 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Valois, J.D.: Lock-free linked lists using compare-and-swap. In: PODC 1995, pp. 214\u2013222. ACM (1995)","DOI":"10.1145\/224964.224988"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-02652-2_21","volume-title":"Model Checking Software","author":"M. Vechev","year":"2009","unstructured":"Vechev, M., Yahav, E., Yorsh, G.: Experience with model checking linearizability. In: P\u0103s\u0103reanu, C.S. (ed.) Model Checking Software. LNCS, vol.\u00a05578, pp. 261\u2013278. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03850-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:08:41Z","timestamp":1746058121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03850-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038490","9783319038506"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03850-6_15","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-03850-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}