{"id":"https://openalex.org/W3008456146","doi":"https://doi.org/10.1145/3332466.3374508","title":"Restricted memory-friendly lock-free bounded queues","display_name":"Restricted memory-friendly lock-free bounded queues","publication_year":2020,"publication_date":"2020-02-19","ids":{"openalex":"https://openalex.org/W3008456146","doi":"https://doi.org/10.1145/3332466.3374508","mag":"3008456146"},"language":"en","primary_location":{"id":"doi:10.1145/3332466.3374508","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3332466.3374508","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","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/A5047006729","display_name":"Nikita Koval","orcid":"https://orcid.org/0000-0002-1260-4616"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nikita Koval","raw_affiliation_strings":["JetBrains"],"affiliations":[{"raw_affiliation_string":"JetBrains","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069723237","display_name":"Vitaly Aksenov","orcid":"https://orcid.org/0000-0001-9134-5490"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Vitaly Aksenov","raw_affiliation_strings":["ITMO University"],"affiliations":[{"raw_affiliation_string":"ITMO University","institution_ids":["https://openalex.org/I173089394"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047006729"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1542,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.48534694,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"433","last_page":"434"},"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.9998999834060669,"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.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9912999868392944,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7933312058448792},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.7213335037231445},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6811286211013794},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6189504861831665},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.532801628112793},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5129994750022888},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4142530858516693},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34147053956985474},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15248361229896545},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1315230429172516},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09854766726493835}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7933312058448792},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.7213335037231445},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6811286211013794},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6189504861831665},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.532801628112793},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5129994750022888},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4142530858516693},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34147053956985474},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15248361229896545},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1315230429172516},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09854766726493835},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3332466.3374508","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3332466.3374508","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8947625814","display_name":null,"funder_award_id":"08-08","funder_id":"https://openalex.org/F4320321912","funder_display_name":"Ministry of Education and Science of the Russian Federation"}],"funders":[{"id":"https://openalex.org/F4320321912","display_name":"Ministry of Education and Science of the Russian Federation","ror":"https://ror.org/00ghqgy32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1931014159","https://openalex.org/W1966054908","https://openalex.org/W2062200908","https://openalex.org/W2551733116","https://openalex.org/W3015821333","https://openalex.org/W3089033718"],"related_works":["https://openalex.org/W2389214306","https://openalex.org/W4235240664","https://openalex.org/W2036343335","https://openalex.org/W189328514","https://openalex.org/W2262651858","https://openalex.org/W2951223296","https://openalex.org/W4297169359","https://openalex.org/W2143289692","https://openalex.org/W3049636605","https://openalex.org/W1974858599"],"abstract_inverted_index":{"Multi-producer":[0],"multi-consumer":[1],"FIFO":[2],"queue":[3,133,167],"is":[4,36,109,123],"one":[5],"of":[6,18,55,62,75,93,115,157,164],"the":[7,53,60,73,83,99,102,140,165,190],"fundamental":[8],"concurrent":[9,25,57],"data":[10],"structures":[11],"used":[12],"in":[13,128,160],"software":[14],"systems.":[15],"A":[16],"lot":[17],"progress":[19],"has":[20],"been":[21],"done":[22],"on":[23,113,134],"designing":[24],"bounded":[26,143,166],"and":[27,66,86],"unbounded":[28,120],"queues":[29,68,112,121,144],"[1--10].":[30],"As":[31],"previous":[32],"works":[33],"show,":[34],"it":[35,122],"extremely":[37],"hard":[38],"to":[39,51,105,110,125],"come":[40],"up":[41],"with":[42,172,189],"an":[43],"efficient":[44,80],"algorithm.":[45],"There":[46],"are":[47,145,151],"two":[48],"orthogonal":[49],"ways":[50],"improve":[52],"performance":[54],"fair":[56],"queues:":[58],"reducing":[59,72],"number":[61,74],"compare-and-swap":[63],"(CAS)":[64],"calls,":[65],"making":[67],"more":[69,88,146],"memory-friendly":[70,107,147],"by":[71,148],"allocations.":[76],"The":[77,142],"most":[78,163],"up-to-date":[79],"algorithms":[81],"choose":[82],"first":[84],"path":[85],"use":[87,179],"scalable":[89],"fetch-and-add":[90],"(FAA)":[91],"instead":[92],"CAS":[94],"[3,":[95],"4,":[96],"10].":[97,118],"For":[98,119],"second":[100],"path,":[101],"standard":[103],"way":[104],"design":[106],"versions":[108],"implement":[111],"top":[114],"arrays":[116],"[2--4,":[117],"reasonable":[124],"allocate":[126],"memory":[127,173],"chunks,":[129],"constructing":[130],"a":[131,154],"linked":[132],"them;":[135],"this":[136],"approach":[137],"significantly":[138],"improves":[139],"performance.":[141],"design:":[149],"they":[150,177],"represented":[152],"as":[153],"fixed-sized":[155],"array":[156],"elements":[158,191],"even":[159],"theory.":[161],"However,":[162],"implementations":[168],"still":[169],"have":[170],"issues":[171],"allocations":[174],"---":[175],"typically,":[176],"either":[178],"descriptors":[180],"[5,":[181],"8]":[182],"or":[183],"store":[184],"some":[185],"additional":[186],"meta-information":[187],"along":[188],"[1,":[192],"6,":[193],"7,":[194],"9].":[195]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}