{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:10:04Z","timestamp":1750205404554,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:00:00Z","timestamp":1556582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"General Secretariat for Research and Technology (GSRT)"},{"name":"Hellenic Foundation for Research and Innovation (HFRI)"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,4,30]]},"DOI":"10.1145\/3310273.3323164","type":"proceedings-article","created":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T14:11:36Z","timestamp":1557324696000},"page":"135-144","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["An adaptive concurrent priority queue for NUMA architectures"],"prefix":"10.1145","author":[{"given":"Foteini","family":"Strati","sequence":"first","affiliation":[{"name":"National Technical University of Athens"}]},{"given":"Christina","family":"Giannoula","sequence":"additional","affiliation":[{"name":"National Technical University of Athens"}]},{"given":"Dimitrios","family":"Siakavaras","sequence":"additional","affiliation":[{"name":"National Technical University of Athens"}]},{"given":"Georgios","family":"Goumas","sequence":"additional","affiliation":[{"name":"National Technical University of Athens"}]},{"given":"Nectarios","family":"Koziris","sequence":"additional","affiliation":[{"name":"National Technical University of Athens"}]}],"member":"320","published-online":{"date-parts":[[2019,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Lisa A. Torrey Joyce Coleman and Barton Miller. 2007. A comparison of interactivity in the Linux 2.6 scheduler and an MLFQ scheduler. Software Practice and Experience. 37 (04 2007) 347--364.   Lisa A. Torrey Joyce Coleman and Barton Miller. 2007. A comparison of interactivity in the Linux 2.6 scheduler and an MLFQ scheduler. Software Practice and Experience. 37 (04 2007) 347--364.","DOI":"10.1002\/spe.772"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688523"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Akrem Benatia Weixing Ji Yizhuo Wang and Feng Shi. 2016. Sparse Matrix Format Selection with Multiclass SVM for SpMV on GPU. 496--505.  Akrem Benatia Weixing Ji Yizhuo Wang and Feng Shi. 2016. Sparse Matrix Format Selection with Multiclass SVM for SpMV on GPU. 496--505.","DOI":"10.1109\/ICPP.2016.64"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1425"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Irina Calciu Hammurabi Mendes and Maurice Herlihy. 2014. The Adaptive Priority Queue with Elimination and Combining. In Distributed Computing Fabian Kuhn (Ed.). Springer Berlin Heidelberg Berlin Heidelberg 406--420.  Irina Calciu Hammurabi Mendes and Maurice Herlihy. 2014. The Adaptive Priority Queue with Elimination and Combining. In Distributed Computing Fabian Kuhn (Ed.). Springer Berlin Heidelberg Berlin Heidelberg 406--420.","DOI":"10.1007\/978-3-662-45174-8_28"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037721"},{"key":"e_1_3_2_1_7_1","unstructured":"Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest and Clifford Stein. 2009. Introduction to Algorithms Third Edition.   Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest and Clifford Stein. 2009. Introduction to Algorithms Third Edition."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.42"},{"volume-title":"NUMASK: High Performance Scalable Skip List for NUMA. In 32nd International Symposium on Distributed Computing, DISC 2018","year":"2018","author":"Daly Henry","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694359"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Ian Dick Alan Fekete and Vincent Gramoli. 2017. A skip list for multicore. Concurrency and Computation: Practice and Experience 29 4 (2017).  Ian Dick Alan Fekete and Vincent Gramoli. 2017. A skip list for multicore. Concurrency and Computation: Practice and Experience 29 4 (2017).","DOI":"10.1002\/cpe.3876"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998582.1998587"},{"volume-title":"Performance Analysis and Optimization of Sparse Matrix-Vector Multiplication on Modern Multi- and Many-Core Processors. In 46th International Conference on Parallel Processing, ICPP 2017","year":"2017","author":"Elafrou Athena","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835736"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011776"},{"volume-title":"University of Cambridge, 2004","year":"2004","author":"Fraser K.","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/762483.762486"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645958.676105"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810540"},{"volume-title":"DISC (Lecture Notes in Computer Science)","author":"Hendler Danny","key":"e_1_3_2_1_20_1"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760631.1760646"},{"key":"e_1_3_2_1_23_1","unstructured":"Maurice Herlihy and Nir Shavit. 2008. The Art of Multiprocessor Programming.   Maurice Herlihy and Nir Shavit. 2008. The Art of Multiprocessor Programming."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312036"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Vladimir Kolmogorov. 2009. Blossom V: A new implementation of a minimum cost perfect matching algorithm.  Vladimir Kolmogorov. 2009. Blossom V: A new implementation of a minimum cost perfect matching algorithm.","DOI":"10.1007\/s12532-009-0002-8"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_3_2_1_27_1","unstructured":"L. T. Schermerhorn. 2007. Automatic Page Migration for Linux {A Matter of Hygiene}.  L. T. Schermerhorn. 2007. Automatic Page Migration for Linux {A Matter of Hygiene}."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.50"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03850-6_15"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087582"},{"volume-title":"Proceedings of the 14th International Symposium on Parallel and Distributed Processing (IPDPS '00)","author":"Lotan I.","key":"e_1_3_2_1_31_1"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/3021426.3021434"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564881"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555256"},{"volume-title":"Scikit-learn: Machine Learning in Python. J. Mach. Learn. Res.","year":"2011","author":"Pedregosa Fabian","key":"e_1_3_2_1_35_1"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Juan Carlos Pichel and Beatriz Pateiro-L\u00f3pez. 2018. A New Approach for Sparse Matrix Classification Based on Deep Learning Techniques. In CLUSTER. IEEE Computer Society 46--54.  Juan Carlos Pichel and Beatriz Pateiro-L\u00f3pez. 2018. A New Approach for Sparse Matrix Classification Based on Deep Learning Techniques. In CLUSTER. IEEE Computer Society 46--54.","DOI":"10.1109\/CLUSTER.2018.00017"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"volume-title":"SWIFT: Scheduling in Web Servers for Fast Response Time. In 2nd IEEE International Symposium on Network Computing and Applications (NCA","year":"2003","author":"Rawat Mayank","key":"e_1_3_2_1_38_1"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Hamza Rihani Peter Sanders and Roman Dementiev. 2014. MultiQueues: Simpler Faster and Better Relaxed Concurrent Priority Queues.  Hamza Rihani Peter Sanders and Roman Dementiev. 2014. MultiQueues: Simpler Faster and Better Relaxed Concurrent Priority Queues.","DOI":"10.1145\/2755573.2755616"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132771"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Konstantinos Sagonas and Kjell Winblad. 2017. The Contention Avoiding Concurrent Priority Queue. In Languages and Compilers for Parallel Computing.  Konstantinos Sagonas and Kjell Winblad. 2017. The Contention Avoiding Concurrent Priority Queue. In Languages and Compilers for Parallel Computing.","DOI":"10.1007\/978-3-319-52709-3_23"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.12.005"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103323.1103324"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780566"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688547"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.02.122"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2419651"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178495"}],"event":{"name":"CF '19: Computing Frontiers Conference","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"],"location":"Alghero Italy","acronym":"CF '19"},"container-title":["Proceedings of the 16th ACM International Conference on Computing Frontiers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3310273.3323164","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3310273.3323164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:36Z","timestamp":1750204416000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3310273.3323164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,30]]},"references-count":48,"alternative-id":["10.1145\/3310273.3323164","10.1145\/3310273"],"URL":"https:\/\/doi.org\/10.1145\/3310273.3323164","relation":{},"subject":[],"published":{"date-parts":[[2019,4,30]]},"assertion":[{"value":"2019-04-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}