{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:03Z","timestamp":1750221123503,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"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":[{"name":"Swiss National Supercomputing Centre (CSCS)"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,17]]},"DOI":"10.1145\/3295500.3356199","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T19:43:22Z","timestamp":1573155802000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A constraint-based approach to automatic data partitioning for distributed memory execution"],"prefix":"10.1145","author":[{"given":"Wonchan","family":"Lee","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Manolis","family":"Papadakis","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Elliott","family":"Slaughter","sequence":"additional","affiliation":[{"name":"SLAC National Accelerator Laboratory"}]},{"given":"Alex","family":"Aiken","sequence":"additional","affiliation":[{"name":"Stanford University"}]}],"member":"320","published-online":{"date-parts":[[2019,11,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2018. Piz Daint & Piz Dora - CSCS. http:\/\/www.cscs.ch\/computers\/piz_daint.  2018. Piz Daint & Piz Dora - CSCS. http:\/\/www.cscs.ch\/computers\/piz_daint."},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI)","author":"Vikram","year":"1998","unstructured":"Vikram S. Adve and John M. Mellor-Crummey. 1998. Using Integer Sets for Data-Parallel Program Analysis and Optimization . In Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI) , Montreal, Canada, June 17--19 , 1998 . 186--198. Vikram S. Adve and John M. Mellor-Crummey. 1998. Using Integer Sets for Data-Parallel Program Analysis and Optimization. In Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI), Montreal, Canada, June 17--19, 1998. 186--198."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(99)00007-6"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_14"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1122990"},{"key":"e_1_3_2_1_6_1","volume-title":"Legion: Expressing Locality and Independence with Logical Regions. In Supercomputing (SC).","author":"Bauer M.","year":"2012","unstructured":"M. Bauer , S. Treichler , E. Slaughter , and A. Aiken . 2012 . Legion: Expressing Locality and Independence with Logical Regions. In Supercomputing (SC). M. Bauer, S. Treichler, E. Slaughter, and A. Aiken. 2012. Legion: Expressing Locality and Independence with Logical Regions. In Supercomputing (SC)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Uday Bondhugula. 2013. Compiling Affine Loop Nests for Distributed-Memory Parallel Architectures. In Supercomputing (SC). ACM 33.  Uday Bondhugula. 2013. Compiling Affine Loop Nests for Distributed-Memory Parallel Architectures. In Supercomputing (SC). ACM 33.","DOI":"10.1145\/2503210.2503289"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1155\/1992\/258136"},{"volume-title":"High-Performance Distributed Computing, 2000. Proceedings. The Ninth International Symposium on. 33--41","author":"de St J. Davison","key":"e_1_3_2_1_9_1","unstructured":"J. Davison de St .Germain, J. McCorquodale , S.G. Parker , and C.R. Johnson . 2000. Uintah: a massively parallel problem solving environment . In High-Performance Distributed Computing, 2000. Proceedings. The Ninth International Symposium on. 33--41 . J. Davison de St.Germain, J. McCorquodale, S.G. Parker, and C.R. Johnson. 2000. Uintah: a massively parallel problem solving environment. In High-Performance Distributed Computing, 2000. Proceedings. The Ninth International Symposium on. 33--41."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/781498.781526"},{"key":"e_1_3_2_1_12_1","volume-title":"6th International Conference, SAT 2003","author":"E\u00e9n Niklas","year":"2003","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson . [n.d.]. An Extensible SAT-solver. In Theory and Applications of Satisfiability Testing , 6th International Conference, SAT 2003 . Santa Margherita Ligure, Italy, May 5--8 , 2003 Selected Revised Papers. Niklas E\u00e9n and Niklas S\u00f6rensson. [n.d.]. An Extensible SAT-solver. In Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5--8, 2003 Selected Revised Papers."},{"key":"e_1_3_2_1_13_1","volume-title":"PENNANT: an unstructured mesh mini-app for advanced architecture research. Concurrency and Computation: Practice and Experience","author":"Ferenbaugh Charles R.","year":"2014","unstructured":"Charles R. Ferenbaugh . 2014. PENNANT: an unstructured mesh mini-app for advanced architecture research. Concurrency and Computation: Practice and Experience ( 2014 ). Charles R. Ferenbaugh. 2014. PENNANT: an unstructured mesh mini-app for advanced architecture research. Concurrency and Computation: Practice and Experience (2014)."},{"key":"e_1_3_2_1_14_1","volume-title":"Johnson","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and David S . Johnson . 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman . M. R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/135226.135230"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1238844.1238851"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.97901"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Okwan Kwon Fahed Jubair Rudolf Eigenmann and Samuel Midkiff. 2012. A Hybrid Approach of OpenMP for Clusters (PPoPP). ACM 75--84.  Okwan Kwon Fahed Jubair Rudolf Eigenmann and Samuel Midkiff. 2012. A Hybrid Approach of OpenMP for Clusters (PPoPP). ACM 75--84.","DOI":"10.1145\/2370036.2145827"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00037"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Mahesh Ravishankar Roshan Dathathri Venmugil Elango Louis-No\u00ebl Pouchet J. Ramanujam Atanas Rountev and P. Sadayappan. 2015. Distributed Memory Code Generation for Mixed Irregular\/Regular Computations (PPoPP). ACM 65--75.  Mahesh Ravishankar Roshan Dathathri Venmugil Elango Louis-No\u00ebl Pouchet J. Ramanujam Atanas Rountev and P. Sadayappan. 2015. Distributed Memory Code Generation for Mixed Irregular\/Regular Computations (PPoPP). ACM 65--75.","DOI":"10.1145\/2858788.2688515"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Mahesh Ravishankar John Eisenlohr Louis-No\u00ebl Pouchet J. Ramanujam Atanas Rountev and P. Sadayappan. 2012. Code Generation for Parallel Execution of a Class of Irregular Loops on Distributed Memory Systems. In Supercomputing (SC).  Mahesh Ravishankar John Eisenlohr Louis-No\u00ebl Pouchet J. Ramanujam Atanas Rountev and P. Sadayappan. 2012. Code Generation for Parallel Execution of a Class of Irregular Loops on Distributed Memory Systems. In Supercomputing (SC).","DOI":"10.1109\/SC.2012.30"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807629"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3126908.3126949"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2857721"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984016"},{"key":"e_1_3_2_1_27_1","volume-title":"Van der Wijngaart and Timothy G. Mattson","author":"Rob","year":"2014","unstructured":"Rob F. Van der Wijngaart and Timothy G. Mattson . 2014 . The Parallel Research Kernels. In HPEC. 1--6. Rob F. Van der Wijngaart and Timothy G. Mattson. 2014. The Parallel Research Kernels. In HPEC. 1--6."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15582-6_49"},{"key":"e_1_3_2_1_29_1","volume-title":"5th International Workshop","author":"von Hanxleden Reinhard","year":"1992","unstructured":"Reinhard von Hanxleden , Ken Kennedy , Charles Koelbel , Raja Das , and Joel H. Saltz . 1992. Compiler Analysis for Irregular Problems in Fortran D. In Languages and Compilers for Parallel Computing , 5th International Workshop , New Haven, Connecticut, USA, August 3--5 , 1992 , Proceedings. 97--111. Reinhard von Hanxleden, Ken Kennedy, Charles Koelbel, Raja Das, and Joel H. Saltz. 1992. Compiler Analysis for Irregular Problems in Fortran D. In Languages and Compilers for Parallel Computing, 5th International Workshop, New Haven, Connecticut, USA, August 3--5, 1992, Proceedings. 97--111."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2259016.2259044"}],"event":{"name":"SC '19: 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","IEEE CS"],"location":"Denver Colorado","acronym":"SC '19"},"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.3356199","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3295500.3356199","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.3356199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,17]]},"references-count":29,"alternative-id":["10.1145\/3295500.3356199","10.1145\/3295500"],"URL":"https:\/\/doi.org\/10.1145\/3295500.3356199","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"}}]}}