{"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":1750220770972,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"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":[{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1718481"],"award-info":[{"award-number":["CNS-1718481"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009917","name":"U.S. Naval Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009917","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.3392758","type":"proceedings-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T18:49:02Z","timestamp":1593456542000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Accelerating relax-ordered task-parallel workloads using multi-level dependency checking"],"prefix":"10.1145","author":[{"given":"Masab","family":"Ahmad","sequence":"first","affiliation":[{"name":"University of Connecticut"}]},{"given":"Mohsin","family":"Shan","sequence":"additional","affiliation":[{"name":"University of Connecticut"}]},{"given":"Akif","family":"Rehman","sequence":"additional","affiliation":[{"name":"University of Connecticut"}]},{"given":"Omer","family":"Khan","sequence":"additional","affiliation":[{"name":"University of Connecticut"}]}],"member":"320","published-online":{"date-parts":[[2020,6,29]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2014. Coloring Complex Networks. http:\/\/algo2.iti.kit.edu\/schulz\/abschluss\/thesis_huebner.pdf  2014. Coloring Complex Networks. http:\/\/algo2.iti.kit.edu\/schulz\/abschluss\/thesis_huebner.pdf"},{"key":"e_1_3_2_1_2_1","unstructured":"2015. Boost C++ Libraries. http:\/\/www.boost.org\/  2015. Boost C++ Libraries. http:\/\/www.boost.org\/"},{"volume-title":"SAM: Optimizing Multithreaded Cores for Speculative Parallelism. In 26th International Conference on Parallel Architectures and Compilation Techniques. 64--78","author":"Abeydeera M.","key":"e_1_3_2_1_3_1","unstructured":"M. Abeydeera , S. Subramanian , M. C. Jeffrey , J. Emer , and D. Sanchez . 2017 . SAM: Optimizing Multithreaded Cores for Speculative Parallelism. In 26th International Conference on Parallel Architectures and Compilation Techniques. 64--78 . M. Abeydeera, S. Subramanian, M. C. Jeffrey, J. Emer, and D. Sanchez. 2017. SAM: Optimizing Multithreaded Cores for Speculative Parallelism. In 26th International Conference on Parallel Architectures and Compilation Techniques. 64--78."},{"volume-title":"CRONO: A Benchmark Suite for Multithreaded Graph Algorithms Executing on Futuristic Multicores. In IEEE International Symposium on Workload Characterization.","author":"Ahmad M.","key":"e_1_3_2_1_4_1","unstructured":"M. Ahmad , F. Hijaz , Q. Shi , and O. Khan . 2015 . CRONO: A Benchmark Suite for Multithreaded Graph Algorithms Executing on Futuristic Multicores. In IEEE International Symposium on Workload Characterization. M. Ahmad, F. Hijaz, Q. Shi, and O. Khan. 2015. CRONO: A Benchmark Suite for Multithreaded Graph Algorithms Executing on Futuristic Multicores. In IEEE International Symposium on Workload Characterization."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2016.7581278"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2013.6704684"},{"key":"e_1_3_2_1_7_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 , Third Edition (3 rd ed.). The MIT Press . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, Third Edition (3rd ed.). The MIT Press.","edition":"3"},{"key":"e_1_3_2_1_8_1","unstructured":"Tilera Corporation. 2014. TILE-Gx72 Processor. (2014). http:\/\/www.mellanox.com\/related-docs\/prod_multi_core\/PB_TILE-Gx72.pdf  Tilera Corporation. 2014. TILE-Gx72 Processor. (2014). http:\/\/www.mellanox.com\/related-docs\/prod_multi_core\/PB_TILE-Gx72.pdf"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of a DIMACS Workshop","author":"Demetrescu Camil","year":"2006","unstructured":"Camil Demetrescu , Andrew V. Goldberg , and David S . Johnson (Eds.). 2009. The Shortest Path Problem , Proceedings of a DIMACS Workshop , Piscataway, New Jersey, USA , 2006 . DIMACS\/AMS. Camil Demetrescu, Andrew V. Goldberg, and David S. Johnson (Eds.). 2009. The Shortest Path Problem, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, 2006. DIMACS\/AMS."},{"key":"e_1_3_2_1_10_1","volume-title":"Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures","author":"Dhulipala Laxman","year":"2018","unstructured":"Laxman Dhulipala , Guy E. Blelloch , and Julian Shun . 2018 . Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures ( Vienna, Austria) (SPAA). 393--404. Laxman Dhulipala, Guy E. Blelloch, and Julian Shun. 2018. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures (Vienna, Austria) (SPAA). 393--404."},{"key":"e_1_3_2_1_11_1","volume-title":"Autotuning Algorithmic Choice for Input Sensitivity. In ACM SIGPLAN Conference on Programming Language Design and Implementation","author":"Ding Yufei","year":"2015","unstructured":"Yufei Ding , Jason Ansel , Kalyan Veeramachaneni , Xipeng Shen , Una-May O'Reilly , and Saman Amarasinghe . 2015 . Autotuning Algorithmic Choice for Input Sensitivity. In ACM SIGPLAN Conference on Programming Language Design and Implementation ( Portland, OR, USA) (PLDI '15). 379--390. Yufei Ding, Jason Ansel, Kalyan Veeramachaneni, Xipeng Shen, Una-May O'Reilly, and Saman Amarasinghe. 2015. Autotuning Algorithmic Choice for Input Sensitivity. In ACM SIGPLAN Conference on Programming Language Design and Implementation (Portland, OR, USA) (PLDI '15). 379--390."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2012.6408680"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2938369"},{"key":"e_1_3_2_1_14_1","volume-title":"KLA: A New Algorithmic Paradigm for Parallel Graph Computations. In ACM International Conference on Parallel Architectures and Compilation (Edmonton, AB, Canada) (PACT","author":"Fidel Adam","year":"2014","unstructured":"Harshvardhan, Adam Fidel , Nancy M. Amato , and Lawrence Rauchwerger . 2014 . KLA: A New Algorithmic Paradigm for Parallel Graph Computations. In ACM International Conference on Parallel Architectures and Compilation (Edmonton, AB, Canada) (PACT 2014). 27--38. Harshvardhan, Adam Fidel, Nancy M. Amato, and Lawrence Rauchwerger. 2014. KLA: A New Algorithmic Paradigm for Parallel Graph Computations. In ACM International Conference on Parallel Architectures and Compilation (Edmonton, AB, Canada) (PACT 2014). 27--38."},{"volume-title":"Kinetic Dependence Graphs. In ACM International Conference on Architectural Support for Programming Languages and Operating Systems","author":"Hassaan Muhammad Amber","key":"e_1_3_2_1_16_1","unstructured":"Muhammad Amber Hassaan , Donald D. Nguyen , and Keshav K. Pingali . 2015 . Kinetic Dependence Graphs. In ACM International Conference on Architectural Support for Programming Languages and Operating Systems ( Istanbul, Turkey) (ASPLOS '15). 15. Muhammad Amber Hassaan, Donald D. Nguyen, and Keshav K. Pingali. 2015. Kinetic Dependence Graphs. In ACM International Conference on Architectural Support for Programming Languages and Operating Systems (Istanbul, Turkey) (ASPLOS '15). 15."},{"volume-title":"IEEE\/ACM International Symposium on Microarchitecture (MICRO). 228--241","author":"Jeffrey M. C.","key":"e_1_3_2_1_17_1","unstructured":"M. C. Jeffrey , S. Subramanian , C. Yan , J. Emer , and D. Sanchez . 2015. A scalable architecture for ordered parallelism . In IEEE\/ACM International Symposium on Microarchitecture (MICRO). 228--241 . M. C. Jeffrey, S. Subramanian, C. Yan, J. Emer, and D. Sanchez. 2015. A scalable architecture for ordered parallelism. In IEEE\/ACM International Symposium on Microarchitecture (MICRO). 228--241."},{"key":"e_1_3_2_1_18_1","volume-title":"Lonestar: A Suite of Parallel Irregular Programs. In ISPASS '09: IEEE International Symposium on Performance Analysis of Systems and Software","author":"Kulkarni Milind","year":"2009","unstructured":"Milind Kulkarni , Martin Burtscher , Calin Cas\u00e7aval , and Keshav Pingali . 2009 . Lonestar: A Suite of Parallel Irregular Programs. In ISPASS '09: IEEE International Symposium on Performance Analysis of Systems and Software ( Boston, MA, USA). http:\/\/iss.ices.utexas.edu\/Publications\/Papers\/ispass 2009.pdf Milind Kulkarni, Martin Burtscher, Calin Cas\u00e7aval, and Keshav Pingali. 2009. Lonestar: A Suite of Parallel Irregular Programs. In ISPASS '09: IEEE International Symposium on Performance Analysis of Systems and Software (Boston, MA, USA). http:\/\/iss.ices.utexas.edu\/Publications\/Papers\/ispass2009.pdf"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"volume-title":"Euro-Par 2015: Parallel Processing","author":"Lenharth Andrew","key":"e_1_3_2_1_20_1","unstructured":"Andrew Lenharth , Donald Nguyen , and Keshav Pingali . 2015. Priority Queues Are Not Good Concurrent Priority Schedulers . In Euro-Par 2015: Parallel Processing . 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. Springer Berlin Heidelberg, Berlin, Heidelberg, 209--221."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"J. W. Lichtman H. Pfister and N. Shavit. 2014. The big data challenges of connectomics. In Nature Neuroscience 17.  J. W. Lichtman H. Pfister and N. Shavit. 2014. The big data challenges of connectomics. In Nature Neuroscience 17.","DOI":"10.1038\/nn.3837"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1561\/106.00000003"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"volume-title":"Unordered: A Comparison of Parallelism and Work-efficiency in Irregular Algorithms. In ACM Symposium on Principles and Practices of Parallel Programming (San Antonio) (PPoPP). 10","author":"Keshav","key":"e_1_3_2_1_24_1","unstructured":"Keshav Pingali and et. al. 2011. Ordered vs . Unordered: A Comparison of Parallelism and Work-efficiency in Irregular Algorithms. In ACM Symposium on Principles and Practices of Parallel Programming (San Antonio) (PPoPP). 10 . Keshav Pingali and et. al. 2011. Ordered vs. Unordered: A Comparison of Parallelism and Work-efficiency in Irregular Algorithms. In ACM Symposium on Principles and Practices of Parallel Programming (San Antonio) (PPoPP). 10."},{"key":"e_1_3_2_1_25_1","volume-title":"Advances in Artificial Intelligence - SBIA","author":"Oliveira Rios Luis Henrique","year":"2010","unstructured":"Luis Henrique Oliveira Rios and Luiz Chaimowicz . 2010. A Survey and Classification of A* Based Best-First Heuristic Search Algorithms . In Advances in Artificial Intelligence - SBIA 2010 , Ant\u00f4nio Carlos da Rocha Costa, Rosa Maria Vicari, and Flavio Tonidandel (Eds.). Springer Berlin Heidelberg , 253--262. Luis Henrique Oliveira Rios and Luiz Chaimowicz. 2010. A Survey and Classification of A* Based Best-First Heuristic Search Algorithms. In Advances in Artificial Intelligence - SBIA 2010, Ant\u00f4nio Carlos da Rocha Costa, Rosa Maria Vicari, and Flavio Tonidandel (Eds.). Springer Berlin Heidelberg, 253--262."},{"volume-title":"Proceedings of the Twenty-Ninth AAAI Conference on AI.","author":"Ryan","key":"e_1_3_2_1_26_1","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization . In Proceedings of the Twenty-Ninth AAAI Conference on AI. Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In Proceedings of the Twenty-Ninth AAAI Conference on AI."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151113.3151122"},{"key":"e_1_3_2_1_28_1","volume-title":"Harsha Vardhan Simhadri, and Kanat Tangwongsan","author":"Shun Julian","year":"2012","unstructured":"Julian Shun , Guy E. Blelloch , Jeremy T. Fineman , Phillip B. Gibbons , Aapo Kyrola , Harsha Vardhan Simhadri, and Kanat Tangwongsan . 2012 . Brief announcement: the problem based benchmark suite. In SPAA. Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri, and Kanat Tangwongsan. 2012. Brief announcement: the problem based benchmark suite. In SPAA."},{"volume-title":"Proc. of the 29th ACM SPAA","author":"Julian","key":"e_1_3_2_1_29_1","unstructured":"Julian Shun and et. al. 2017. Julienne: A Framework for Parallel Graph Algorithms Using Work-efficient Bucketing . In Proc. of the 29th ACM SPAA ( Washington, DC, USA). 12. Julian Shun and et. al. 2017. Julienne: A Framework for Parallel Graph Algorithms Using Work-efficient Bucketing. In Proc. of the 29th ACM SPAA (Washington, DC, USA). 12."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356206"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/339647.339650"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3079856.3080218"},{"key":"e_1_3_2_1_33_1","volume-title":"Johannes Gehrke. CIDR","author":"Wang Guozhang","year":"2013","unstructured":"Guozhang Wang , Wenlei Xie , Alan Demers , and Johannes Gehrke. CIDR 2013 . Asynchronous Large-Scale Graph Processing Made Easy. Guozhang Wang, Wenlei Xie, Alan Demers, and Johannes Gehrke. CIDR 2013. Asynchronous Large-Scale Graph Processing Made Easy."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3108140"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Yichao Zhou and Jianyang Zeng. 2015. Massively Parallel A* Search on a GPU. In AAAI.  Yichao Zhou and Jianyang Zeng. 2015. Massively Parallel A * Search on a GPU. In AAAI.","DOI":"10.1609\/aaai.v29i1.9367"}],"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.3392758","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3392717.3392758","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3392717.3392758","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.3392758"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,29]]},"references-count":34,"alternative-id":["10.1145\/3392717.3392758","10.1145\/3392717"],"URL":"https:\/\/doi.org\/10.1145\/3392717.3392758","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"}}]}}