Hiding communication latency with non-spmd, graph-based execution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5544 LNCS, Issue PART 1, 2009, Pages 155-164

  Sorensen, Jacob ^a   Baden, Scott B ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Coarse grain dataflow; Latency tolerance; Non SPMD; Parallel programming

Indexed keywords

ALTERNATIVE APPROACH; COARSE GRAIN DATAFLOW; COMMUNICATION DELAYS; COMMUNICATION LATENCY; DATAFLOW; GRAPH-BASED; LATENCY TOLERANCE; NON-SPMD;

PARALLEL PROGRAMMING;

EID: 68849085832     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01970-8_16     Document Type: Conference Paper

References (27)

1. Gropp, W., Lusk, E., Doss, N., Skjellum, A.: A high-performance, portableim-plementation of the MPI message passing interface standard. Technical report, Argonne National Laboratory, Argonne, IL (1997), http://www.mcs.anl. gov/mpi/mpich/
2. Dennis, J.: Data flow supercomputers. IEEE Computer 13(11), 48-56 (1980)
3. Gurd, J.R., Kirkham, C.C., Watson, I.: The Manchester prototype dataflow computer. Communications of the ACM 28(1), 34-52 (1985)
4. Arvind: Executing a program on the mit tagged-token dataflow architecture. IEEE Transactions on Computers 39(3), 300-318 (1990)
5. Babb II, R.G.: Parallel processing with large-grain data flow technique. Computer 17(7), 55-61 (1984)
6. Kelly, P., Beckmann, O., Field, A., Baden, S.: Themis: Component dependence metadata in adaptive parallel applications. Parallel Processing Letters 11(4), 455-470 (2001)
7. Little, J.D.C.: A proof of the queuing formula L = λ W. Operations Research 9, 383-387 (1961)
8. Colella, P.: Defining software requirements for scientific computing (2004)
9. NASA Advanced Supercomputing Division: NAS parallel benchmarks, http://www.nas.nasa.gov/Resources/Software/npb.html
10. Sawdey, A.C., O'Keefe, M.T., Jones, W.B.: A general programming model for developing scalable ocean circulation applications. In: Proceedings of the ECMWF Workshop on the Use of Parallel Processors in Meteorology (January 1997)
11. Baden, S.B., Shalit, D.: Performance tradeoffs in multi-tier formulation of a finite difference method. In: Proc. 2001 International Conference on Computational Science, San Francisco, CA (May 2001)
12. van de Geign, R., Watts, J.: SUMMA: Scalable universal matrix multiplication algorithm. Concurrency: Practice and Experience 9(4), 255-274 (1997)
13. Iancu, C.C., Strohmaier, E.: Optimizing communication overlap for high-speed networks. In: Proc. 12th ACM SIGPLAN Symp on Principles and Practice of Parallel Prog (PPoPP 2007), pp. 35-45. ACM Press, New York (2007)
14. Vajracharya, S., Karmesin, S., Beckman, P., Crotinger, J., Malony, A., Shende,
15. S., Oldehoeft, R., Smith, S.: Smarts: Exploting temporal locality and parallelism through vertical execution. In: International Conference on Supercomputing (1999)
16. Kasahara, H., Yoshida, A.: A data-localization compilation scheme using partialstatic task assignment for fortran coarse-grain parallel processing. Parallel Computing 24, 579-596 (1998)
17. Leiserson, C., Randall, K., Zhou, Y.: Cilk: An efficient multithreaded runtime system. In: Proc. Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), Santa Barbara, CA (July 1995)
18. Grimshaw, A.S., Weissman, J.B., Strayer, W.T.: Portable run-time support for dynamic object-oriented parallel processing. ACM Transactions on Computer Systems 14(2), 139-170 (1996)
19. Johnson, C., Parker, S., Weinstein, D., Heffernan, S.: Component-based, problem solving environments for large-scale scientific computing. Concurrency and Computation: Practice and Experience 14(13-15), 1337-1349 (2002)
20. McCorquodale, J., de St. Germain, D., Parker, S., Johnson, C.: The uintah parallelism infrastructure: A performance evaluation. In: High Performance Computing 2001, Seattle (March 2001)
21. Cicotti, P., Baden, S.B.: Asynchronous programming with tarragon. In: Proc. 15th IEEE International Symposium on High Performance Distributed Computing, Paris, France (June 2006)
22. Husbands, P., Yelick, K.: Multithreading and one-sided communication in parallel lu factorization. In: SC 2007: Proceedings of the 2007 ACM/IEEE conference on Supercomputing, Reno, Nevada. ACM, New York (2007)
23. Phillips, J.C., Zheng, G., Kumar, S., Kalé, L.V.V.: NAMD: Biomolecular simulation on thousands of processors. In: Proceedings of SC 2002 (2002)
24. Huang, C., Lawlor, O., Kalé, L.: Adaptive mpi. In: Rauchwerger, L. (ed.) LCPC 2003. LNCS, vol. 2958. Springer, Heidelberg (2004)
25. Huang, C., Kale, L.: Charisma: orchestrating migratable parallel objects. In: HPDC 2007: Proceedings of the 16th international symposium on High performance distributed computing, pp. 75-84. ACM Press, New York (2007)
26. Warren, M.S., Salmon, J.K.: A parallel hashed oct-tree n-body algorithm. In: Supercomputing, pp. 12-21 (1993)
27. Quinlan, D., Miller, B., Philip, B., Schordan, M.: A c++ infrastructure for automatic introduction and translation of openmp directives. In: Proc. 16th Inte. Parallel and Distrib. Proc. Symp., pp. 105-114 (April 2002)