{"id":"https://openalex.org/W1847396493","doi":"https://doi.org/10.1109/ipdps.2003.1213189","title":"Fast and lock-free concurrent priority queues for multi-thread systems","display_name":"Fast and lock-free concurrent priority queues for multi-thread systems","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W1847396493","doi":"https://doi.org/10.1109/ipdps.2003.1213189","mag":"1847396493"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2003.1213189","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2003.1213189","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Parallel and Distributed Processing Symposium","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111790200","display_name":"H\u00e5kan Sundell","orcid":"https://orcid.org/0000-0003-4308-434X"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"H. Sundell","raw_affiliation_strings":["Department of Computing Science, Chalmers University of Technology and G\u00f6teborg University, Goteborg, Sweden","Department of Computer Science Chalmers University of Technology G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Chalmers University of Technology and G\u00f6teborg University, Goteborg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Department of Computer Science Chalmers University of Technology G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003177344","display_name":"Philippas Tsigas","orcid":"https://orcid.org/0000-0001-9635-9154"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"P. Tsigas","raw_affiliation_strings":["Department of Computing Science, Chalmers University of Technology and G\u00f6teborg University, Goteborg, Sweden","Department of Computer Science Chalmers University of Technology G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Chalmers University of Technology and G\u00f6teborg University, Goteborg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Department of Computer Science Chalmers University of Technology G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111790200"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":2.2436,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.89643079,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8582345247268677},{"id":"https://openalex.org/keywords/concurrent-data-structure","display_name":"Concurrent data structure","score":0.8431941270828247},{"id":"https://openalex.org/keywords/mutual-exclusion","display_name":"Mutual exclusion","score":0.8276015520095825},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.6862573623657227},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.6546429395675659},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6297454833984375},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6140708327293396},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.5992712378501892},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5895499587059021},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5800760984420776},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.5709273815155029},{"id":"https://openalex.org/keywords/lock","display_name":"Lock (firearm)","score":0.5479580760002136},{"id":"https://openalex.org/keywords/priority-ceiling-protocol","display_name":"Priority ceiling protocol","score":0.5410825610160828},{"id":"https://openalex.org/keywords/priority-inheritance","display_name":"Priority inheritance","score":0.5321221947669983},{"id":"https://openalex.org/keywords/critical-section","display_name":"Critical section","score":0.4957007169723511},{"id":"https://openalex.org/keywords/concurrency-control","display_name":"Concurrency control","score":0.4362831115722656},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.43400466442108154},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22122743725776672},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.18997901678085327},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.17619985342025757},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08916157484054565},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.07091081142425537},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.06648388504981995}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8582345247268677},{"id":"https://openalex.org/C203222032","wikidata":"https://www.wikidata.org/wiki/Q5159104","display_name":"Concurrent data structure","level":3,"score":0.8431941270828247},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.8276015520095825},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.6862573623657227},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.6546429395675659},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6297454833984375},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6140708327293396},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.5992712378501892},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5895499587059021},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5800760984420776},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.5709273815155029},{"id":"https://openalex.org/C174839445","wikidata":"https://www.wikidata.org/wiki/Q1134386","display_name":"Lock (firearm)","level":2,"score":0.5479580760002136},{"id":"https://openalex.org/C117420606","wikidata":"https://www.wikidata.org/wiki/Q386027","display_name":"Priority ceiling protocol","level":5,"score":0.5410825610160828},{"id":"https://openalex.org/C63160601","wikidata":"https://www.wikidata.org/wiki/Q253831","display_name":"Priority inheritance","level":5,"score":0.5321221947669983},{"id":"https://openalex.org/C124343487","wikidata":"https://www.wikidata.org/wiki/Q1046373","display_name":"Critical section","level":2,"score":0.4957007169723511},{"id":"https://openalex.org/C84511453","wikidata":"https://www.wikidata.org/wiki/Q2914952","display_name":"Concurrency control","level":3,"score":0.4362831115722656},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.43400466442108154},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22122743725776672},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.18997901678085327},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.17619985342025757},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08916157484054565},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.07091081142425537},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.06648388504981995},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1109/ipdps.2003.1213189","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2003.1213189","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Parallel and Distributed Processing Symposium","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.113.4552","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.4552","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"http://www.cs.chalmers.se/~dcs/ConcurrentDataStructures/phd_chap5.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.14.679","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.chalmers.se/~phs/TechnicalReports/SunT03_PQueue.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.1310","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.1310","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.chalmers.se/~tsigas/papers/JPDC-Lock-free-skip-lists-and-Queues.pdf","raw_type":"text"},{"id":"pmh:oai:publications.lib.chalmers.se:315","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/315-fast-and-lock-free-concurrent-priority-queues-for-multi-thread-systems","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Conference.PeerReviewed"},{"id":"pmh:oai:publications.lib.chalmers.se:4463","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/4463-fast-and-lock-free-concurrent-priority-queues-for-multi-thread-systems","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Journal.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:315","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/315","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:research.chalmers.se:4463","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/4463","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1490590586","https://openalex.org/W1520380662","https://openalex.org/W1578961151","https://openalex.org/W1591718490","https://openalex.org/W1597622247","https://openalex.org/W2029390211","https://openalex.org/W2030085880","https://openalex.org/W2032742044","https://openalex.org/W2070991879","https://openalex.org/W2072035527","https://openalex.org/W2074891761","https://openalex.org/W2085407655","https://openalex.org/W2091183052","https://openalex.org/W2096154194","https://openalex.org/W2097938163","https://openalex.org/W2099292526","https://openalex.org/W2100443549","https://openalex.org/W2101939036","https://openalex.org/W2107079306","https://openalex.org/W2127976210","https://openalex.org/W2129257059","https://openalex.org/W2136651966","https://openalex.org/W2140908587","https://openalex.org/W2160293203","https://openalex.org/W2167282885","https://openalex.org/W2187800381","https://openalex.org/W2665868045","https://openalex.org/W2751601659","https://openalex.org/W3152703111","https://openalex.org/W6631393152","https://openalex.org/W6635349530","https://openalex.org/W6679355201","https://openalex.org/W6744131798"],"related_works":["https://openalex.org/W2024013325","https://openalex.org/W2056266125","https://openalex.org/W3204002890","https://openalex.org/W2159239521","https://openalex.org/W1983252028","https://openalex.org/W2461293263","https://openalex.org/W153378917","https://openalex.org/W2127509987","https://openalex.org/W1847396493","https://openalex.org/W2129017891"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"efficient":[3,127],"and":[4,49,59,82,104,153],"practical":[5],"lock-free":[6,62,140],"implementation":[7,141],"of":[8,69,79,108,124,129],"a":[9,105],"concurrent":[10,19,32,158],"priority":[11,33,70,130],"queue":[12],"that":[13,138],"is":[14,94,111],"suitable":[15],"for":[16,31,150],"both":[17,155],"fully":[18,157],"(large":[20],"multi-processor)":[21],"systems":[22],"as":[23,25,159,161],"well":[24,75,160],"pre-emptive":[26,163],"(multi-process)":[27],"systems.":[28,164],"Many":[29],"algorithms":[30,56,68],"queues":[34,71,131],"are":[35,60,84],"based":[36,86,95],"on":[37,87,96,156,162],"mutual":[38,41],"exclusion.":[39],"However,":[40],"exclusion":[42],"causes":[43],"blocking":[44],"which":[45],"has":[46],"several":[47],"drawbacks":[48],"degrades":[50],"the":[51,97,125,143],"system's":[52],"overall":[53],"performance.":[54],"Non-blocking":[55],"avoid":[57],"blocking,":[58],"either":[61],"or":[63],"wait-free.":[64],"Previously":[65],"known":[66],"non-blocking":[67],"did":[72],"not":[73],"perform":[74],"in":[76,147],"practice":[77],"because":[78],"their":[80],"complexity,":[81],"they":[83],"often":[85],"non-available":[88],"atomic":[89],"synchronization":[90],"primitives.":[91],"Our":[92],"algorithm":[93,110,121],"randomized":[98],"sequential":[99],"list":[100],"structure":[101],"called":[102],"Skiplist,":[103],"real-time":[106],"extension":[107],"our":[109,115,120,139],"also":[112],"described.":[113],"In":[114],"performance":[116],"evaluation":[117],"we":[118],"compare":[119],"with":[122],"some":[123],"most":[126],"implementations":[128,146],"known.":[132],"The":[133],"experimental":[134],"results":[135],"clearly":[136],"show":[137],"outperforms":[142],"other":[144],"lock-based":[145],"all":[148],"cases":[149],"3":[151],"threads":[152],"more,":[154]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}