{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T10:14:01Z","timestamp":1761128041306},"reference-count":20,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ipdps.2003.1213189","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"11","source":"Crossref","is-referenced-by-count":17,"title":["Fast and lock-free concurrent priority queues for multi-thread systems"],"prefix":"10.1109","author":[{"given":"H.","family":"Sundell","sequence":"first","affiliation":[]},{"given":"P.","family":"Tsigas","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Correction of a Memory Management Method for Lock-Free Data Structures","author":"michael","year":"1995","journal-title":"Technical Report"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.1990.89257"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/12.57058"},{"article-title":"Operating System Concepts","year":"1994","author":"silberschatz","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2000.896423"},{"key":"ref16","article-title":"Noble: A Non-Blocking Inter-Process Communication Library","author":"sundell","year":"2002","journal-title":"Proceedings of the 6th Workshop on Languages Compilers and Runtime Systems for Scalable Computers (LCR'02) Lecture Notes in Computer Science"},{"key":"ref17","article-title":"Fast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems, Extended Version","author":"sundell","year":"2003","journal-title":"Technical Report"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/378420.378810"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/584369.584378"},{"key":"ref4","article-title":"A Pragmatic Implementation of Non-Blocking Linked Lists","author":"harris","year":"2001","journal-title":"Proc 15th Int'l Symp Distributed Computing"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/32.846298"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57271-6_23"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00148-2"},{"journal-title":"Wait-Free Algorithms for Heaps Technical Report","year":"1992","author":"barnes","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01094342"},{"key":"ref9","article-title":"Skiplist-Based Concurrent Priority Queues","author":"lotan","year":"2000","journal-title":"International Parallel and Distributed Processing Symposium"},{"journal-title":"Lock-Free Data Structures","year":"1995","author":"valois","key":"ref20"}],"event":{"name":"International Parallel and Distributed Processing Symposium (IPDPS 2003)","acronym":"IPDPS-03","location":"Nice, France"},"container-title":["Proceedings International Parallel and Distributed Processing Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8608\/27277\/01213189.pdf?arnumber=1213189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T15:06:49Z","timestamp":1489417609000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1213189\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2003.1213189","relation":{},"subject":[]}}