{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:10Z","timestamp":1750220770820,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T00:00:00Z","timestamp":1593388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["CCF-1629431"],"award-info":[{"award-number":["CCF-1629431"]}]},{"DOI":"10.13039\/501100001742","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2005\/17"],"award-info":[{"award-number":["2005\/17"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,29]]},"DOI":"10.1145\/3392717.3392740","type":"proceedings-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T18:49:02Z","timestamp":1593456542000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Snug"],"prefix":"10.1145","author":[{"given":"Azin","family":"Heidarshenas","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]},{"given":"Tanmay","family":"Gangwani","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]},{"given":"Serif","family":"Yesil","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]},{"given":"Adam","family":"Morrison","sequence":"additional","affiliation":[{"name":"Tel Aviv University"}]},{"given":"Josep","family":"Torrellas","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]}],"member":"320","published-online":{"date-parts":[[2020,6,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92990-1_12"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688523"},{"volume-title":"Scaling Up Machine Learning: Parallel and Distributed Approaches","author":"Bekkerman Ron","key":"e_1_3_2_1_3_1","unstructured":"Ron Bekkerman , Mikhail Bilenko , and John Langford . 2011. Scaling Up Machine Learning: Parallel and Distributed Approaches . Cambridge University Press , New York, NY, USA . Ron Bekkerman, Mikhail Bilenko, and John Langford. 2011. Scaling Up Machine Learning: Parallel and Distributed Approaches. Cambridge University Press, New York, NY, USA."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02192173"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2024716.2024718"},{"key":"e_1_3_2_1_6_1","volume-title":"In Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming (PPoPP).","author":"Blelloch Guy E.","year":"2012","unstructured":"Guy E. Blelloch , Jeremy T. Fineman , Phillip B. Gibbons , and Julian Shun . 2012 . In Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming (PPoPP). Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, and Julian Shun. 2012. In Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming (PPoPP)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_28"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_10_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms ( 3 rd ed.). MIT Press . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms (3rd ed.). MIT Press.","edition":"3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"volume-title":"9th DIMACS Implementation Challenge","author":"DIMACS.","key":"e_1_3_2_1_12_1","unstructured":"DIMACS. 2010. 9th DIMACS Implementation Challenge . http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml. DIMACS. 2010. 9th DIMACS Implementation Challenge. http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml."},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (UAI).","author":"Elidan Gal","year":"2006","unstructured":"Gal Elidan , Ian McGraw , and Daphne Koller . 2006 . Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing . In Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (UAI). Gal Elidan, Ian McGraw, and Daphne Koller. 2006. Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing. In Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (UAI)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/84537.84545"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018112"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45414-4_21"},{"volume-title":"14th Colloquium on Structural Information and Communication Complexity (SIROCCO).","author":"Herlihy Maurice","key":"e_1_3_2_1_18_1","unstructured":"Maurice Herlihy , Yossi Lev , Victor Luchangco , and Nir Shavit . 2007. A Simple Optimistic Skiplist Algorithm . In 14th Colloquium on Structural Information and Communication Complexity (SIROCCO). Maurice Herlihy, Yossi Lev, Victor Luchangco, and Nir Shavit. 2007. A Simple Optimistic Skiplist Algorithm. In 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)."},{"volume-title":"The Art of Multiprocessor Programming","author":"Herlihy Maurice","key":"e_1_3_2_1_19_1","unstructured":"Maurice Herlihy and Nir Shavit . 2008. The Art of Multiprocessor Programming . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA. Maurice Herlihy and Nir Shavit. 2008. The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/PADS.2011.5936760"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00148-2"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3916.3988"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/3195638.3195644"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2830772.2830777"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1177\/0272989X12455462"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-015-1383-2"},{"key":"e_1_3_2_1_27_1","unstructured":"Khronos Group. 2019. OpenCL. http:\/\/www.khronos.org\/opencl\/.  Khronos Group. 2019. OpenCL. http:\/\/www.khronos.org\/opencl\/."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273440.1250683"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48096-0_17"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03850-6_15"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2012.42"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS).","author":"Lotan Itay","year":"2000","unstructured":"Itay Lotan and Nir Shavit . 2000 . Skiplist-Based Concurrent Priority Queues . In Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS). Itay Lotan and Nir Shavit. 2000. Skiplist-Based Concurrent Priority Queues. In Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2847263.2847268"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564881"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_36_1","unstructured":"NVIDIA. 2019. CUDA Programming Guide v3.1. http:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/.  NVIDIA. 2019. CUDA Programming Guide v3.1. http:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755616"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1736020.1736055"},{"key":"e_1_3_2_1_41_1","unstructured":"SNAP. 2003. SNAP Datasets. https:\/\/snap.stanford.edu\/data\/amazon0302.html.  SNAP. 2003. SNAP Datasets. https:\/\/snap.stanford.edu\/data\/amazon0302.html."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2197681"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.12.005"},{"key":"e_1_3_2_1_45_1","unstructured":"Wikipedia. 2019. Moving Average. https:\/\/en.wikipedia.org\/wiki\/Movingaverage.  Wikipedia. 2019. Moving Average. https:\/\/en.wikipedia.org\/wiki\/Movingaverage."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"M. Wimmer J. Gruber J. Larsson Tr\u00e4ff and P. Tsigas. 2015. The Lock-free k-LSM Relaxed Priority Queue. ArXiv e-prints (March 2015). arXiv:cs.DS\/1503.05698  M. Wimmer J. Gruber J. Larsson Tr\u00e4ff and P. Tsigas. 2015. The Lock-free k -LSM Relaxed Priority Queue. ArXiv e-prints (March 2015). arXiv:cs.DS\/1503.05698","DOI":"10.1145\/2688500.2688547"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688547"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555278"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.21128"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.0030059"}],"event":{"name":"ICS '20: 2020 International Conference on Supercomputing","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Barcelona Spain","acronym":"ICS '20"},"container-title":["Proceedings of the 34th ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3392717.3392740","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3392717.3392740","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3392717.3392740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:15Z","timestamp":1750200075000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3392717.3392740"}},"subtitle":["architectural support for relaxed concurrent priority queueing in chip multiprocessors"],"short-title":[],"issued":{"date-parts":[[2020,6,29]]},"references-count":48,"alternative-id":["10.1145\/3392717.3392740","10.1145\/3392717"],"URL":"https:\/\/doi.org\/10.1145\/3392717.3392740","relation":{},"subject":[],"published":{"date-parts":[[2020,6,29]]},"assertion":[{"value":"2020-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}