{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:35:13Z","timestamp":1763458513206,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,11,15]],"date-time":"2016-11-15T00:00:00Z","timestamp":1479168000000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-14-1-0316"],"award-info":[{"award-number":["W911NF-14-1-0316"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["IIS-0905220, OCI-1048018, CNS-1162405, IIS-1247632, IIP-1414153, IIS-1447788"],"award-info":[{"award-number":["IIS-0905220, OCI-1048018, CNS-1162405, IIS-1247632, IIP-1414153, IIS-1447788"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,11,15]]},"DOI":"10.1145\/2833179.2833188","type":"proceedings-article","created":{"date-parts":[[2015,11,18]],"date-time":"2015-11-18T08:42:32Z","timestamp":1447836152000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Improving graph partitioning for modern graphs and architectures"],"prefix":"10.1145","author":[{"given":"Dominique","family":"LaSalle","sequence":"first","affiliation":[{"name":"University of Minnesota, Minneapolis, Minnesota"}]},{"given":"Md Mostofa Ali","family":"Patwary","sequence":"additional","affiliation":[{"name":"Intel Corporation, Santa Clara, California"}]},{"given":"Nadathur","family":"Satish","sequence":"additional","affiliation":[{"name":"Intel Corporation, Santa Clara, California"}]},{"given":"Narayanan","family":"Sundaram","sequence":"additional","affiliation":[{"name":"Intel Corporation, Santa Clara, California"}]},{"given":"Pradeep","family":"Dubey","sequence":"additional","affiliation":[{"name":"Intel Corporation, Santa Clara, California"}]},{"given":"George","family":"Karypis","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, Minnesota"}]}],"member":"320","published-online":{"date-parts":[[2015,11,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/588\/11706"},{"key":"e_1_3_2_1_2_1","volume-title":"Recent advances in graph partitioning. CoRR, abs\/1311.3144","author":"Bulu\u00e7 A.","year":"2013","unstructured":"A. Bulu\u00e7, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz. Recent advances in graph partitioning. CoRR, abs\/1311.3144, 2013."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.81"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2007.12.001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/229473.229480"},{"key":"e_1_3_2_1_7_1","unstructured":"B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. Technical Report SAND93-1301 Sandia National Labratories 1993."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596300656"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470485"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/369028.369103"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.50"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.09.012"},{"key":"e_1_3_2_1_14_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.44"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/645560.658570"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2040572.2040624"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0956-0521(91)90014-V"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1964536.1964553"}],"event":{"name":"SC15: The International Conference for High Performance Computing, Networking, Storage and Analysis","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE-CS\\DATC IEEE Computer Society"],"location":"Austin Texas","acronym":"SC15"},"container-title":["Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2833179.2833188","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2833179.2833188","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2833179.2833188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:27:42Z","timestamp":1763458062000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2833179.2833188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,15]]},"references-count":19,"alternative-id":["10.1145\/2833179.2833188","10.1145\/2833179"],"URL":"https:\/\/doi.org\/10.1145\/2833179.2833188","relation":{},"subject":[],"published":{"date-parts":[[2015,11,15]]},"assertion":[{"value":"2015-11-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}