{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,8]],"date-time":"2026-09-08T07:23:41Z","timestamp":1788852221219,"version":"build-2803163510"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,17]],"date-time":"2013-11-17T00:00:00Z","timestamp":1384646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,11,17]]},"DOI":"10.1145\/2503210.2503293","type":"proceedings-article","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T08:55:22Z","timestamp":1383123322000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":96,"title":["Scalable matrix computations on large scale-free graphs using 2D graph partitioning"],"prefix":"10.1145","author":[{"given":"Erik G.","family":"Boman","sequence":"first","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karen D.","family":"Devine","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sivasankaran","family":"Rajamanickam","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,11,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Epetra home page. http:\/\/trilinos.sandia.gov\/packages\/epetra.  Epetra home page. http:\/\/trilinos.sandia.gov\/packages\/epetra."},{"key":"e_1_3_2_1_2_1","unstructured":"The Graph500 list. http:\/\/www.graph500.org\/.  The Graph500 list. http:\/\/www.graph500.org\/."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1898953.1899055"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1527286.1527287"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198529392.001.0001","volume-title":"Parallel Scientific Computing: A structured approach using BSP and MPI","author":"Bisseling R. H.","year":"2004","unstructured":"R. H. Bisseling . Parallel Scientific Computing: A structured approach using BSP and MPI . Oxford University Press , 2004 . R. H. Bisseling. Parallel Scientific Computing: A structured approach using BSP and MPI. Oxford University Press, 2004."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/265932"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/713587"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/pamm.200700703"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2013.6670333"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549970_12"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. IPDPS 8th Int'l Workshop on Solving Irregularly Structured Problems in Parallel (Irregular 2001)","author":"Aykanat C.","year":"2001","unstructured":"\u00dc. \u00c7ataly\u00fcrek and C. Aykanat . A fine-grain hypergraph model for 2d decomposition of sparse matrices . In Proc. IPDPS 8th Int'l Workshop on Solving Irregularly Structured Problems in Parallel (Irregular 2001) , April 2001 . \u00dc. \u00c7ataly\u00fcrek and C. Aykanat. A fine-grain hypergraph model for 2d decomposition of sparse matrices. In Proc. IPDPS 8th Int'l Workshop on Solving Irregularly Structured Problems in Parallel (Irregular 2001), April 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/582034.582062"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/080737770"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2010.119"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129053395000051"},{"key":"e_1_3_2_1_19_1","volume-title":"Special issue on Trilinos. Scientific Programming, 20(2--3)","author":"Heroux M.","year":"2012","unstructured":"M. Heroux and D. Rouson . Special issue on Trilinos. Scientific Programming, 20(2--3) , 2012 . M. Heroux and D. Rouson. Special issue on Trilinos. Scientific Programming, 20(2--3), 2012."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089014.1089021"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/266021.266273"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.2298\/AADM110205006K"},{"key":"e_1_3_2_1_24_1","unstructured":"J. Leskovec. SNAP (Stanford Network Analysis Platform) network data sets. http:\/\/snap.stanford.edu\/data\/index.html.  J. Leskovec. SNAP (Stanford Network Analysis Platform) network data sets. http:\/\/snap.stanford.edu\/data\/index.html."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/4021.4025"},{"key":"e_1_3_2_1_26_1","volume-title":"The PageRank citation ranking: Bringing order to the web. Technical report","author":"Page L.","year":"1998","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The PageRank citation ranking: Bringing order to the web. Technical report , Stanford Digital Library Technologies Project , 1998 . L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"F.\n      Pellegrini\n     and \n      J.\n      Roman\n  . \n  Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs\n  . In H. Liddell A. Colbrook B. Hertzberger and P. Sloot editors High-Performance Computing and Networking volume \n  1067\n   of \n  Lecture Notes in Computer Science pages \n  493\n  --\n  498\n  . \n  Springer Berlin Heidelberg 1996\n  .   F. Pellegrini and J. Roman. Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In H. Liddell A. Colbrook B. Hertzberger and P. Sloot editors High-Performance Computing and Networking volume 1067 of Lecture Notes in Computer Science pages 493--498. Springer Berlin Heidelberg 1996.","DOI":"10.1007\/3-540-61142-8_588"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"S.\n      Rajamanickam\n     and \n      E. G.\n      Boman\n  . \n  Parallel partitioning with Zoltan: Is hypergraph partitioning worth it? In D\n  . A. Bader H. Meyerhenke P. Sanders and D. Wagner editors Graph Partitioning and Graph Clustering volume \n  588\n   of \n  AMS Contemporary Mathematics pages \n  37\n  --\n  52\n  . \n  AMS 2013\n  .  S. Rajamanickam and E. G. Boman. Parallel partitioning with Zoltan: Is hypergraph partitioning worth it? In D. A. Bader H. Meyerhenke P. Sanders and D. Wagner editors Graph Partitioning and Graph Clustering volume 588 of AMS Contemporary Mathematics pages 37--52. AMS 2013.","DOI":"10.1090\/conm\/588\/11711"},{"key":"e_1_3_2_1_29_1","volume-title":"GPS: A graph processing system. Technical report","author":"Salihoglu S.","year":"2012","unstructured":"S. Salihoglu and J. Widom . GPS: A graph processing system. Technical report , Stanford University , 2012 . S. Salihoglu and J. Widom. GPS: A graph processing system. Technical report, Stanford University, 2012."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.605"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.056109"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479800371529"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502409019"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063469"},{"key":"e_1_3_2_1_35_1","volume-title":"Parallel massive scale-free graph generators","author":"Yoo A.","year":"2010","unstructured":"A. Yoo and K. Henderson . Parallel massive scale-free graph generators , 2010 . A. Yoo and K. Henderson. Parallel massive scale-free graph generators, 2010."}],"event":{"name":"SC13: International Conference for High Performance Computing, Networking, Storage and Analysis","location":"Denver Colorado","acronym":"SC13","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 Computer Society"]},"container-title":["Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503210.2503293","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2503210.2503293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:21Z","timestamp":1750217301000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503210.2503293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,17]]},"references-count":34,"alternative-id":["10.1145\/2503210.2503293","10.1145\/2503210"],"URL":"https:\/\/doi.org\/10.1145\/2503210.2503293","relation":{},"subject":[],"published":{"date-parts":[[2013,11,17]]},"assertion":[{"value":"2013-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}