{"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"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T00:00:00Z","timestamp":1489536000000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"U.S. Department of Energy, Office of Science, Advanced Scientific Computing Research","award":["DE-SC0008923"],"award-info":[{"award-number":["DE-SC0008923"]}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"crossref","award":["HR0011-07-9-0002"],"award-info":[{"award-number":["HR0011-07-9-0002"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Office of Science of the U.S. Department of Energy","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Parallel Comput."],"published-print":{"date-parts":[[2016,3,15]]},"abstract":"<jats:p>X10 is a high-performance, high-productivity programming language aimed at large-scale distributed and shared-memory parallel applications. It is based on the Asynchronous Partitioned Global Address Space (APGAS) programming model, supporting the same fine-grained concurrency mechanisms within and across shared-memory nodes.<\/jats:p>\n                  <jats:p>We demonstrate that X10 delivers solid performance at petascale by running (weak scaling) eight application kernels on an IBM Power--775 supercomputer utilizing up to 55,680 Power7 cores (for 1.7Pflop\/s of theoretical peak performance). For the four HPC Class 2 Challenge benchmarks, X10 achieves 41% to 87% of the system\u2019s potential at scale (as measured by IBM\u2019s HPCC Class 1 optimized runs). We also implement K-Means, Smith-Waterman, Betweenness Centrality, and Unbalanced Tree Search (UTS) for geometric trees. Our UTS implementation is the first to scale to petaflop systems.<\/jats:p>\n                  <jats:p>We describe the advances in distributed termination detection, distributed load balancing, and use of high-performance interconnects that enable X10 to scale out to tens of thousands of cores. We discuss how this work is driving the evolution of the X10 language, core class libraries, and runtime systems.<\/jats:p>","DOI":"10.1145\/2894746","type":"journal-article","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T09:50:44Z","timestamp":1458294644000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["X10 and APGAS at Petascale"],"prefix":"10.1145","volume":"2","author":[{"given":"Olivier","family":"Tardieu","sequence":"first","affiliation":[{"name":"IBM T.J. Watson Research Center, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Herta","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Cunningham","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Grove","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prabhanjan","family":"Kambadur","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay","family":"Saraswat","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avraham","family":"Shinnar","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikio","family":"Takeuchi","sequence":"additional","affiliation":[{"name":"IBM Research - Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mandana","family":"Vaziri","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,3,15]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Ettore Tiotto, Yevgen Voronenko, and Xing Xue.","author":"Alm\u00e1si George","year":"2010","unstructured":"George Alm\u00e1si, Barnaby Dalton, Lawrence L. Hu, Franz Franchetti, Yaxun Liu, Albert Sidelnik, Thomas Spelce, Ilie Gabriel Tanase, Ettore Tiotto, Yevgen Voronenko, and Xing Xue. 2010. 2010 IBM HPC Challenge Class II Submission. http:\/\/www.hpcchallenge.org\/presentations\/sc2010\/hpcc10_ibm.pdf."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2010.16"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1133995"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/545564.545567"},{"key":"e_1_2_1_5_1","unstructured":"Dan Bonachea. 2002. GASNet Specification v1.1. Technical Report UCB\/CSD-02-1207. EECS Department University of California Berkeley."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Deepayan Chakrabarti Yiping Zhan and Christos Faloutsos. 2004. R-MAT: A recursive model for graph mining. In SDM.","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_2_1_8_1","volume-title":"Chapel HPC Challenge Entry","author":"Chamberlain Brad","year":"2012","unstructured":"Brad Chamberlain, Sung-Eun Choi, Martha Dumler, Tom Hildebrandt, David Iten, Vass Litvinov, Greg Titus, Casey Battaglino, Rachel Sobel, Brandon Holt, and Jeff Keasler. 2012. Chapel HPC Challenge Entry: 2012. http:\/\/www.hpcchallenge.org\/presentations\/sc2012\/ChapelHPCC2012.pdf."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345211"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44202-9_27"},{"key":"e_1_2_1_11_1","unstructured":"Cray. 2013. Chapel Language Specification Version 0.93. http:\/\/chapel.cray.com\/spec\/spec-0.93.pdf."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2212736.2212744"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654113"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)00001-6"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the P-PHEC Workshop, held in conjunction with HPCA.","author":"Ebcioglu Kemal","year":"2006","unstructured":"Kemal Ebcioglu, Vivek Sarkar, Tarek El-Ghazawi, and John Urbanic. 2006. An experiment in measuring the productivity of three parallel programming languages. In Proceedings of the P-PHEC Workshop, held in conjunction with HPCA."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627373.2627380"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2212736.2212737"},{"key":"e_1_2_1_18_1","unstructured":"HPC Challenge. 2012. HPC Challenge Awards Competition. Retrieved from http:\/\/www.hpcchallenge.org\/."},{"key":"e_1_2_1_19_1","unstructured":"HPC Challenge Benchmark Record 482. 2012. HPC Challenge Benchmark Record 482. Retrieved from http:\/\/icl.cs.utk.edu\/hpcc\/hpcc_record.cgi?id&equals;482."},{"key":"e_1_2_1_20_1","unstructured":"HPC Challenge Benchmark Record 495. 2012. HPC Challenge Benchmark Record 495. Retrieved from http:\/\/icl.cs.utk.edu\/hpcc\/hpcc_record.cgi?id&equals;495."},{"key":"e_1_2_1_21_1","unstructured":"HPC Challenge Benchmarks. 2012. HPC Challenge Benchmarks. Retrieved from http:\/\/icl.cs.utk.edu\/hpcc\/."},{"key":"e_1_2_1_22_1","unstructured":"Laxmikant V. Kale Anshu Arya Abhinav Bhatele Abhishek Gupta Nikhil Jain Pritish Jetley Jonathan Lifflander Phil Miller Yanhua Sun Ramprasad Venkataramanz Lukasz Wesolowski and Gengbin Zheng. 2011. Charm++ for Productivity and Performance. http:\/\/www.hpcchallenge.org\/presentations\/sc2011\/hpcc11_report_charmplusplus.pdf."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693459"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_2_1_25_1","volume-title":"Proc. 5th Berkeley Symp. Math. Stat. Probab.","author":"MacQueen J.","year":"1967","unstructured":"J. MacQueen. 1967. Some methods for classification and analysis of multivariate observations. Proc. 5th Berkeley Symp. Math. Stat. Probab., Univ. Calif. 1965\/66, 1, 281--297 (1967)."},{"key":"e_1_2_1_26_1","volume-title":"Class II Submission to the HPC Challenge Award Competition Coarray Fortran 2.0. (Nov","author":"Mellor-Crummey John","year":"2011","unstructured":"John Mellor-Crummey, Laksono Adhianto, Guohua Jin, Mark Krentel, Karthik Murthy, William Scherer, and Chaoran Yang. 2011. Class II Submission to the HPC Challenge Award Competition Coarray Fortran 2.0. (Nov. 2011). http:\/\/www.hpcchallenge.org\/presentations\/sc2011\/hpcc11_report_caf2_0.pdf."},{"key":"e_1_2_1_27_1","unstructured":"Josh Milthorpe David Grove Benjamin Herta and Olivier Tardieu. 2015. Exploring the APGAS Programming Model using the LULESH Proxy Application. Technical Report RC25555. IBM Research."},{"key":"e_1_2_1_28_1","unstructured":"Masahiro Nakao Hitoshi Murai Takenori Shimosaka and Mitsuhisa Sato. 2012. XcalableMP 2012 HPC Challenge Class II Submission. http:\/\/www.hpcchallenge.org\/presentations\/sc2012\/HPCC12_XMP_slide.pdf."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1983576"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1757112.1757137"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.19"},{"key":"e_1_2_1_32_1","unstructured":"Parallel Programming Laboratory. 2013. The Charm++ Parallel Programming System Manual. Technical Report Version 6.4. Department of Computer Science University of Illinois Urbana-Champaign."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2212736.2212740"},{"key":"e_1_2_1_34_1","volume-title":"Technical Report 03-034. Univ. of North Carolina at Chapel Hill.","author":"Prins Jan","year":"2003","unstructured":"Jan Prins, Jun Huan, Bill Pugh, Chau-Wen Tseng, and P. Sadayappan. 2003. UPC Implementation of an Unbalanced Tree Search Benchmark. Technical Report 03-034. Univ. of North Carolina at Chapel Hill."},{"key":"e_1_2_1_35_1","volume-title":"ByungUn Ha, Jose Higino, Marc-Eric Kahle, Tsuyoshi Kamenoue, James Pearson, Mark Perez, Fernando Pizzano, Robert Simon, and Kai Sun.","author":"Quintero Dino","year":"2012","unstructured":"Dino Quintero, Kerry Bosworth, Puneet Chaudhary, Rodrigo Garcia da Silva, ByungUn Ha, Jose Higino, Marc-Eric Kahle, Tsuyoshi Kamenoue, James Pearson, Mark Perez, Fernando Pizzano, Robert Simon, and Kai Sun. 2012. IBM Power Systems 775 for AIX and Linux HPC Solution. IBM."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2464996.2465435"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674600.2682913"},{"key":"e_1_2_1_38_1","volume-title":"AMP\u201910: Proceedings of the 1st Workshop on Advances in Message Passing.","author":"Saraswat Vijay","year":"2010","unstructured":"Vijay Saraswat, Gheorghe Almasi, Ganesh Bikshandi, Calin Cascaval, David Cunningham, David Grove, Sreedhar Kodali, Igor Peshansky, and Olivier Tardieu. 2010. The asynchronous partitioned global address space model. In AMP\u201910: Proceedings of the 1st Workshop on Advances in Message Passing."},{"key":"e_1_2_1_39_1","unstructured":"Vijay Saraswat Bard Bloom Igor Peshansky Olivier Tardieu and David Grove. 2012. The X10 Language Specification v2.2.3. http:\/\/x10.sourceforge.net\/documentation\/languagespec\/x10-223.pdf."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","unstructured":"Vijay Saraswat and Radha Jagadeesan. 2005. Concurrent clustered programming. In Concur\u201905. 353--367. 10.1007\/11539452_28","DOI":"10.1007\/11539452_28"},{"key":"e_1_2_1_41_1","unstructured":"Vijay Saraswat Olivier Tardieu David Grove David Cunningham Mikio Takeuchi and Benjanmin Herta. 2013. A Brief Introduction to X10 (For the High Performance Programmer). Retrieved from http:\/\/x10.sourceforge.net\/documentation\/intro\/latest\/html\/."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941582"},{"key":"e_1_2_1_43_1","first-page":"93","article-title":"A Dynamic and Adaptive Quiescence Detection Algorithm","author":"Sinha Amitabh B.","year":"1993","unstructured":"Amitabh B. Sinha, L. V. Kale, and B. Ramkumar. 1993. A Dynamic and Adaptive Quiescence Detection Algorithm. Technical Report 93-11. Parallel Programming Laboratory, Department of Computer Science, University of Illinois, Urbana-Champaign.","journal-title":"Technical Report"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"e_1_2_1_45_1","unstructured":"Gabriel Tanase Gheorghe Alm\u00e1si Ettore Tiotto Michail Alvanos Anny Ly and Barnaby Dalton. 2013. Performance Analysis of the IBM XL UPC on the PERCS Architecture. Technical Report RC25360. IBM Research."},{"key":"e_1_2_1_46_1","unstructured":"Olivier Tardieu David Grove Bard Bloom David Cunningham Benjamin Herta Prabhanjan Kambadur Vijay A. Saraswat Avraham Shinnar Mikio Takeuchi and Mandana Vaziri. 2012. X10 for Productivity and Performance at Scale. http:\/\/www.hpcchallenge.org\/presentations\/sc2012\/x10-hpcc.pdf."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555245"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145850"},{"key":"e_1_2_1_49_1","unstructured":"Wikipedia. 2011. PERCS. Retrieved from http:\/\/en.wikipedia.org\/w\/index.php?title&equals;PERCS."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.17"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567634.2567639"}],"container-title":["ACM Transactions on Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2894746","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2894746","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2894746","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:27:45Z","timestamp":1763458065000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2894746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,15]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,3,15]]}},"alternative-id":["10.1145\/2894746"],"URL":"https:\/\/doi.org\/10.1145\/2894746","relation":{},"ISSN":["2329-4949","2329-4957"],"issn-type":[{"type":"print","value":"2329-4949"},{"type":"electronic","value":"2329-4957"}],"subject":[],"published":{"date-parts":[[2016,3,15]]},"assertion":[{"value":"2014-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-02-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-03-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}