{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T04:10:06Z","timestamp":1767845406491,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,17]],"date-time":"2019-11-17T00:00:00Z","timestamp":1573948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"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"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS 1763658, CCF 1725734"],"award-info":[{"award-number":["CNS 1763658, CCF 1725734"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,17]]},"DOI":"10.1145\/3295500.3356160","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T19:43:22Z","timestamp":1573155802000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Understanding priority-based scheduling of graph algorithms on a shared-memory platform"],"prefix":"10.1145","author":[{"given":"Serif","family":"Yesil","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azin","family":"Heidarshenas","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Morrison","sequence":"additional","affiliation":[{"name":"Tel Aviv University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josep","family":"Torrellas","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087810"},{"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":"publisher","DOI":"10.1145\/777792.777824"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2388996.2389013"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145840"},{"key":"e_1_3_2_1_7_1","volume-title":"The Adaptive Priority Queue with Elimination and Combining","author":"Calciu Irina","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."},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization. Springer-Verlag","author":"Boris","unstructured":"Boris V. Cherkassy and Andrew V. Goldberg. 1995. On Implementing Push-Relabel Method for the Maximum Flow Problem . In Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization. Springer-Verlag , London, UK, UK, 157--171. http:\/\/dl.acm.org\/citation.cfm?id=645586.659457 Boris V. Cherkassy and Andrew V. Goldberg. 1995. On Implementing Push-Relabel Method for the Maximum Flow Problem. In Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization. Springer-Verlag, London, UK, UK, 157--171. http:\/\/dl.acm.org\/citation.cfm?id=645586.659457"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087580"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_11_1","volume-title":"Retrieved","author":"DIMACS.","year":"2006","unstructured":"DIMACS. 2006 . 9th DIMACS Implementation Challenge . Retrieved August 28, 2019 from http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml DIMACS. 2006. 9th DIMACS Implementation Challenge. Retrieved August 28, 2019 from http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038037.1941557"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810540"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2830772.2830777"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594835.1504182"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_18_1","volume-title":"Euro-Par 2015: Parallel Processing, Jesper Larsson Tr\u00e4ff","author":"Lenharth Andrew","unstructured":"Andrew Lenharth , Donald Nguyen , and Keshav Pingali . 2015. Priority Queues Are Not Good Concurrent Priority Schedulers . In Euro-Par 2015: Parallel Processing, Jesper Larsson Tr\u00e4ff , Sascha Hunold, and Francesco Versaci (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 209--221. Andrew Lenharth, Donald Nguyen, and Keshav Pingali. 2015. Priority Queues Are Not Good Concurrent Priority Schedulers. In Euro-Par 2015: Parallel Processing, Jesper Larsson Tr\u00e4ff, Sascha Hunold, and Francesco Versaci (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 209--221."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03850-6_15"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI'10)","author":"Low Yucheng","year":"2010","unstructured":"Yucheng Low , Joseph Gonzalez , Aapo Kyrola , Danny Bickson , Carlos Guestrin , and Joseph Hellerstein . 2010 . GraphLab: A New Framework for Parallel Machine Learning . In Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI'10) . AUAI Press, Arlington, Virginia, United States, 340--349. http:\/\/dl.acm.org\/citation.cfm?id=3023549.3023589 Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny Bickson, Carlos Guestrin, and Joseph Hellerstein. 2010. GraphLab: A New Framework for Parallel Machine Learning. In Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI'10). AUAI Press, Arlington, Virginia, United States, 340--349. http:\/\/dl.acm.org\/citation.cfm?id=3023549.3023589"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926287"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1074013"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950404"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755616"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2000.845994"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3079079.3079097"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.12.005"},{"key":"e_1_3_2_1_34_1","volume-title":"System Issues, and Lessons Learned. In Euro-Par 2015: Parallel Processing, Jesper Larsson Tr\u00e4ff","author":"Whang Joyce Jiyoung","unstructured":"Joyce Jiyoung Whang , Andrew Lenharth , Inderjit S. Dhillon , and Keshav Pingali . 2015. Scalable Data-Driven PageRank: Algorithms , System Issues, and Lessons Learned. In Euro-Par 2015: Parallel Processing, Jesper Larsson Tr\u00e4ff , Sascha Hunold, and Francesco Versaci (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 438--450. Joyce Jiyoung Whang, Andrew Lenharth, Inderjit S. Dhillon, and Keshav Pingali. 2015. Scalable Data-Driven PageRank: Algorithms, System Issues, and Lessons Learned. In Euro-Par 2015: Parallel Processing, Jesper Larsson Tr\u00e4ff, Sascha Hunold, and Francesco Versaci (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 438--450."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688547"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555278"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688507"}],"event":{"name":"SC '19: The International Conference for High Performance Computing, Networking, Storage, and Analysis","location":"Denver Colorado","acronym":"SC '19","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3295500.3356160","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3295500.3356160","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3295500.3356160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:13Z","timestamp":1750208533000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3295500.3356160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,17]]},"references-count":36,"alternative-id":["10.1145\/3295500.3356160","10.1145\/3295500"],"URL":"https:\/\/doi.org\/10.1145\/3295500.3356160","relation":{},"subject":[],"published":{"date-parts":[[2019,11,17]]},"assertion":[{"value":"2019-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}