Active pebbles: Parallel programming for data-driven applications

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2011, Pages 235-244

  Willcock, Jeremiah James ^a   Hoefler, Torsten ^b   Edmonds, Nicholas Gerard ^a   Lumsdaine, Andrew ^a  

^a INDIANA UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

active messages; irregular applications; programming models

Indexed keywords

ACTIVE MESSAGE; ACTIVE ROUTING; APPLICATION AREA; COMMUNICATION OPTIMIZATION; COMMUNICATION PATTERN; DATA-DRIVEN APPLICATIONS; DIVERSE APPLICATIONS; EMERGING APPLICATIONS; EXECUTION MODEL; IRREGULAR APPLICATIONS; NONLOCAL; PROGRAMMABILITY; PROGRAMMING MODELS; SCALABLE SOLUTION; SEPARATE ALGORITHM; TERMINATION DETECTION;

ALGORITHMS; ELECTRIC NETWORK ANALYSIS; FLOCCULATION; OPTIMIZATION; PARALLEL PROGRAMMING;

COMPUTER SYSTEMS PROGRAMMING;

EID: 79959600862     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1995896.1995934     Document Type: Conference Paper

References (32)

1. A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. Scheiman. LogGP: Incorporating long messages into the LogP model. J. of Par. and Dist. Comp., 44(1):71-79, 1995. (Pubitemid 127340829)
2. D. Bader and K. Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In Intl. Conference on Parallel Processing, pages 523-530, August 2006.
3. D. A. Bader, D. R. Helman, and J. JáJá. Practical parallel algorithms for personalized communication and integer sorting. Journal of Experimental Algorithmics, 1, 1996.
4. J. W. Berry, B. Hendrickson, S. Kahan, and P. Konecny. Software and algorithms for graph queries on multithreaded architectures. In Intl. Parallel and Distributed Processing Symposium, Mar. 2007.
5. J. Bruck, C.-T. Ho, S. Kipnis, and D. Weathersby. Efficient algorithms for all-to-all communications in multi-port message-passing systems. In Symposium on Parallel Algorithms and Architectures, pages 298-309, 1994.
6. D. Callahan, B. L. Chamberlain, and H. P. Zima. The Cascade High Productivity Language. In Intl. Workshop on High-Level Parallel Programming Models and Supportive Environments, pages 52-60, April 2004.
7. P. Charles, C. Grothoff, V. A. Saraswat, et al. X10: An object-oriented approach to non-uniform cluster computing. In Obj. Oriented Prog., Sys., Lang., and Apps., 2005.
8. E. W. Dijkstra and C. S. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11(1):1-4, 1980.
9. P. Erdo{combining double acute accent}s and A. Rényi. On random graphs. Publ. Math. Debrecen, 6:290-297, 1959.
10. G. Gao, T. Sterling, R. Stevens, M. Hereld, and W. Zhu. ParalleX: A study of a new parallel computation model. In IPDPS, pages 1-6, 2007.
11. R. Garg and Y. Sabharwal. Software routing and aggregation of messages to optimize the performance of HPCC RandomAccess benchmark. In Supercomputing, pages 109-, 2006.
12. M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. SIGARCH Comput. Archit. News, 21(2):289-300, 1993.
13. M. P. Herlihy. Impossibility and universality results for wait-free synchronization. In Principles of Distributed Computing, pages 276-290, 1988.
14. T. Hey, S. Tansley, and K. Tolle, editors. The Fourth Paradigm: Data-Intensive Scientific Discovery. Microsoft Research, 2009.
15. T. Hoefler, A. Lumsdaine, and W. Rehm. Implementation and performance analysis of non-blocking collective operations for MPI. In Supercomputing, Nov. 2007.
16. T. Hoefler, C. Siebert, and A. Lumsdaine. Scalable communication protocols for dynamic sparse data exchange. In Principles and Practice of Parallel Programming, pages 159-168, Jan. 2010.
17. L. V. Kalé and S. Krishnan. CHARM++: A portable concurrent object oriented system based on C++. SIGPLAN Notices, 28(10):91-108, 1993.
18. A. Lumsdaine, D. Gregor, B. Hendrickson, and J. Berry. Challenges in parallel graph processing. Parallel Processing Letters, 17(1):5-20, 2007.
19. P. R. Luszczek, D. H. Bailey, J. J. Dongarra, et al. The HPC Challenge (HPCC) benchmark suite. In Supercomputing, pages 213-, 2006.
20. F. Mattern. Algorithms for distributed termination detection. Distributed Computing, 2(3):161-175, 1987.
21. MPI Forum. MPI: A Message-Passing Interface Standard. Version 2.2, Sept. 2009.
22. R. W. Numrich and J. Reid. Co-array Fortran for parallel programming. SIGPLAN Fortran Forum, 17(2):1-31, 1998.
23. S. Plimpton, R. Brightwell, C. Vaughan, and K. Underwood. A simple synchronous distributed-memory algorithm for the HPCC RandomAccess benchmark. In Intl. Conf. on Cluster Comp., pages 1-7, 2006.
24. A. L. Rosenberg and L. S. Heath. Graph Separators, with Applications. Kluwer Academic Publishers, Norwell, MA, USA, 2001.
25. N. Shavit and D. Touitou. Software transactional memory. In Principles of Dist. Computing, pages 204-213, 1995.
26. A. B. Sinha, L. V. Kalé, and B. Ramkumar. A dynamic and adaptive quiescence detection algorithm. Technical Report 93-11, Parallel Programming Laboratory, UIUC, 1993.
27. UPC Consortium. UPC Language Specifications, v1.2. Technical report, Lawrence Berkeley National Laboratory, 2005. LBNL-59208.
28. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.
29. T. von Eicken, D. E. Culler, S. C. Goldstein, and K. E. Schauser. Active Messages: A mechanism for integrated communication and computation. In Intl. Symposium on Computer Architecture, pages 256-266, 1992.
30. J. Willcock, T. Hoefler, N. Edmonds, and A. Lumsdaine. Active Pebbles: A programming model for highly parallel fine-grained data-driven computations. In Principles and Practice of Parallel Programming, Feb. 2011. Poster.
31. J. J. Willcock, T. Hoefler, N. G. Edmonds, and A. Lumsdaine. AM++: A generalized active message framework. In Par. Arch. and Comp. Tech., 2010.
32. A. Yoo, E. Chow, K. Henderson, et al. A scalable distributed parallel breadth-first search algorithm on BlueGene/L. In Supercomputing, pages 25-. IEEE, 2005.