Bamboo - Translating MPI applications to a latency-tolerant, data-driven form

International Conference for High Performance Computing, Networking, Storage and Analysis, SC

Volumn , Issue , 2012, Pages

  Nguyen, Tan ^a   Cicotti, Pietro ^a   Bylaska, Eric ^b   Quinlan, Dan ^c   Baden, Scott B ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

^c LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE SOLVERS; MATRIX MULTIPLICATION; MPI APPLICATIONS; MPI IMPLEMENTATIONS; SOURCE-TO-SOURCE TRANSLATORS; SPLIT-PHASE;

BAMBOO; COMMUNICATION; ITERATIVE METHODS; MESSAGE PASSING;

PROGRAM PROCESSORS;

EID: 84877704866     PISSN: 21674329     EISSN: 21674337     Source Type: Conference Proceeding    
DOI: 10.1109/SC.2012.23     Document Type: Conference Paper

References (35)

1. Arvind. Executing a program on the mit tagged-token dataflow architecture. IEEE Transactions on Computers, 39(3):300-318, March 1990.
2. R. G. Babb, II. Parallel processing with large-grain data flow technique. Computer, 17(7):55-61, July 1984.
3. C. Bell, D. Bonachea, R. Nishtala, and K. Yelick. Optimizing bandwidth limited problems using one-sided communication and overlap. In Proceedings of the 20th international conference on Parallel and distributed processing, IPDPS'06, pages 84-84, Washington, DC, USA, 2006. IEEE Computer Society.
4. M. Beynon, T. M. Kurc, U. V. Catalyurek, C. Chang, A. Sussman, and J. H. Saltz. Distributed processing of very large datasets with datacutter. Par. Comput., pages 1457-1478, Dec 2001.
5. D. Bonachea. Gasnet specification, v1.1. Technical Report CSD-02-1207, University of California, Lawrence Berkeley Laboratory, October 2002.
6. G. Bronevetsky. Communication-sensitive static dataflow for parallel message passing applications. In Proceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization, CGO '09, pages 1-12, Washington, DC, USA, 2009. IEEE Computer Society.
7. B. Broom, R. Fowler, and K. Kennedy. Kelpio: A telescope-ready domain-specific i/o library for irregular block-structured applications. In Proc. First IEEE/ACM International Symposium on Cluster Computing and the Grid, pages 148-155. IEEE, 2001.
8. E. Bylaska, K. Tsemekhman, N. Govind, and M. Valiev. Large-scale plane-wave-based density functional theory: Formalism, parallelization, and applications. In J. R. Reimers, editor, Computational Methods for Large Systems: Electronic Structure Approaches for Biotechnology and Nanotechnology. John Wiley and Sons, Inc., 2011.
9. P. Cicotti. Tarragon: a Programming Model for Latency-Hiding Scientific Computations. PhD thesis, Department of Computer Science and Engineering, University of California, San Diego, 2011.
10. P. Cicotti and S. B. Baden. Asynchronous programming with tarragon. In Proc. 15th IEEE International Symposium on High Performance Distributed Computing, pages 375-376, Paris, France, Jun. 2006.
11. P. Cicotti and S. B. Baden. Latency hiding and performance tuning with graph-based execution. In The Seventh IEEE eScience Conference, Data-Flow Execution Models for Extreme Scale Computing (DFM 2011), Galveston Island, Texas, 2011.
12. P. Colella. Defining software requirements for scientific computing, 2004.
13. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT Press, Cambridge, MA, USA, 2nd edition, 2001.
14. A. Danalis, K.-Y. Kim, L. Pollock, and M. Swany. Transformations to parallel codes for communication-computation overlap. In Proceedings of the ACM/IEEE SC 2005 Conference, pages 58-68, November 2005.
15. J. Dennis. Data flow supercomputers. IEEE Computer, 13(11):48-56, 1980.
16. G. Gopalakrishnan, R. M. Kirby, S. Siegel, R. Thakur, W. Gropp, E. Lusk, B. R. De Supinski, M. Schulz, and G. Bronevetsky. Formal analysis of mpi-based parallel programs. Commun. ACM, 54(12):82-91, Dec. 2011.
17. S. Z. Guyer and C. Lin. An annotation language for optimizing software libraries. ACM SIGPLAN Notices, 35(1):39-52, January 2000.
18. C. Huang, O. Lawlor, and L. Kalé. Adaptive mpi. In Proc. 16th International Workshop on Languages and Compilers for Parallel Computing (LCPC 03), 2003.
19. P. Husbands and K. Yelick. Multithreading and one-sided communication in parallel lu factorization. In SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing, Reno, Nevada, Nov. 2007. ACM.
20. L. V. Kalé. The virtualization model of parallel programming : Runtime optimizations and the state of art. In LACSI 2002, Albuquerque, October 2002.
21. L. V. Kale and S. Krishnan. Charm++: a portable concurrent object oriented system based on c++. In Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications, OOPSLA '93, pages 91-108, New York, NY, USA, 1993. ACM.
22. K. Kennedy, B. Broom, A. Chauhan, R. Fowler, J. Garvin, C. Koelbel, C. McCosh, and J. Mellor-Crummey. Telescoping languages: A system for automatic generation of domain languages. Proc. IEEE, 93:387-408, 2005. (Pubitemid 40851231)
23. J. Kurzak and J. Dongarra. Fully dynamic scheduler for numerical computing on multicore processors lapack working note 220.
24. V. Marjanović, J. Labarta, E. Ayguadé, and M. Valero. Overlapping communication and computation by using a hybrid mpi/smpss approach. In Proceedings of the 24th ACM International Conference on Supercomputing, ICS '10, pages 5-16, 2010.
25. D. Marx and J. Hutter. Ab-initio molecular dynamics: Theory and implementation. In J. Grotendorst, editor, Modern Methods and Algorithms of Quantum Chemistry, NIC, chapter 13, pages 301-449. Forschungszentrum Jlich, i edition, 2000. Publicly available at the URL: http://www2.fz-juelich.de/nic- series/Volume3/marx.pdf.
26. Message Passing Interface Forum. MPI:A message-passing interface standard. International Journal of Supercomputing Applications, 8(3/4), 1994.
27. J. Perez, R. Badia, and J. Labarta. A dependency-aware task-based programming environment for multi-core architectures. In Cluster Computing, 2008 IEEE International Conference on, pages 142-151, 2008.
28. R. Preissl, M. Schulz, D. Kranzlmuller, B. de Supinski, and D. Quinlan. Using mpi communication patterns to guide source code transformations. In Computational Science ICCS 2008, volume 5103 of Lecture Notes in Computer Science, pages 253-260. Springer Berlin / Heidelberg, 2008.
29. D. Quinlan, D. Miller, B. Philip, and M. Schordan. Treating a user-defined parallel library as a domain-specific language. In Proceedings of the 16th international Parallel and Distributed Processing Symposium, IPDPS 2002, Los Alamitos, CA, USA, April 2002. IEEE.
30. D. R. Shires, L. L. Pollock, and S. Sprenkle. Program flow graph construction for static analysis of mpi programs. In PDPTA, pages 1847-1853, 1999.
31. E. Solomonik and J. Demmel. Communication-optimal parallel 2.5d matrix multiplication and lu factorization algorithms. Technical Report UCB/EECS-2011-72, EECS Department, University of California, Berkeley, Jun 2011.
32. J. Sorensen and S. B. Baden. Hiding communication latency with non-spmd, graph-based execution. In Proc. 9th Intl Conf. Computational Sci. (ICCS '09), pages 155-164, Berlin, Heidelberg, 2009. Springer-Verlag.
33. J. D. Teresco, M. W. Beall, J. E. Flaherty, and M. S. Shephard. A hierarchical partition model for adaptive finite element computation. Comput. Methods. Appl. Mech. Engrg., 184:269-285, 2000.
34. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33:103-111, August 1990.
35. A. Zekri and S. Sedukhin. The general matrix multiply-add operation on 2d torus. In Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International, page 8 pp., april 2006.