Scalable communication protocols for dynamic sparse data exchange

ACM SIGPLAN Notices

Volumn 45, Issue 5, 2010, Pages 159-168

  Hoefler, Torsten ^a   Siebert, Christian ^b   Lumsdaine, Andrew ^a  

^a INDIANA UNIVERSITY   (United States)

^b NEC LABORATORIES EUROPE   (Germany)

Author keywords

Alltoall; Distributed termination; Irregular algorithms; Nonblocking collective operations; Sparse data exchange

Indexed keywords

ALLTOALL; DISTRIBUTED TERMINATION; IRREGULAR ALGORITHMS; NON-BLOCKING; SPARSE DATA;

ALGORITHMS; BLOCK CODES; PARALLEL ARCHITECTURES;

COMMUNICATION;

EID: 77957567653     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1837853.1693476     Document Type: Conference Paper

References (30)

1. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103-111, 1990.
2. T. Hoefler and J. L. Traeff. Sparse collective operations for MPI. In Proceedings of the 23rd IEEE International Parallel & Distributed Processing Symposium (IPDPS), HIPS Workshop, May 2009.
3. R. Das, Y. Hwang, M. Uysal, J. Saltz, and A. Sussman. Applying the chaos/parti library to irregular problems in computational chemistry and computational aerodynamics. In Mississippi State University, Starkville, MS, pages 45-56. IEEE Computer Society Press, 1993.
4. J. L. Träff. Implementing the mpi process topology mechanism. In Supercomputing '02: Proceedings of the 2002 ACM/IEEE conference on Supercomputing, pages 1-14, Los Alamitos, CA, USA, 2002. IEEE Computer Society Press.
5. A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. Scheiman. LogGP: Incorporating long messages into the LogP model. J. of Par. and Distr. Comp., 44(1):71-79, 1995.
6. K. M. Chandy and J. Misra. How processes learn. In Proceedings of the fourth annual ACM symposium on Principles of Distributed Computing, pages 204-214. ACM, 1985.
7. I. Cidon, I. Gopal, and S. Kutten. Optimal computation of global sensitive functions in fast networks. In Proceedings of the 4th International Workshop on Distributed Algorithms, pages 185-191, 1991.
8. R. M. Karp, A. Sahay, E. E. Santos, and K. E. Schauser. Optimal broadcast and summation in the LogP model. In Proc. of Symposium on Parallel Algorithms and Architectures, pages 142-153, 1993.
9. A. Bar-Noy and S. Kipnis. Designing broadcasting algorithms in the postal model for message-passing systems. Math. Syst. Theory, 27(5):431-452, 1994.
10. A. Bar-Noy, S. Kipnis, and B. Schieber. Optimal computation of census functions in the postal model. Discrete Appl. Math., 58(3):213-222, 1995.
11. G. Iannello. Efficient Algorithms for the Reduce-Scatter Operation in LogGP. IEEE Trans. Par. Distr. Syst., 8(9):970-982, 1997.
12. J. Bruck, C.-T. Ho, S. Kipnis, E. Upfal, and D. Weathersby. Efficient algorithms for all-to-all communications in multiport message-passing systems. Trans. on Par. and Distrib. Syst., 8(11):1143-1156, 1997.
13. T. Hoefler, P. Gottschling, and A. Lumsdaine. Leveraging nonblocking collective communication in high-performance applications. In Proc. of the 20th Annual Symp. on Parallelism in Algorithms and Architectures, pages 113-115. ACM, June 2008.
14. T. Hoefler and A. Lumsdaine. Overlapping Communication and Computation with High Level Communication Routines. In Proc. of the 8th IEEE Symp. on Cluster Computing and the Grid, pages 572-577, May 2008.
15. IBM Blue Gene Team. Overview of the Blue Gene/P project. IBM Journal of Research and Development, 52(1/2), January 2008.
16. T. Hoefler, A. Lumsdaine, and W. Rehm. Implementation and Performance Analysis of Non-Blocking Collective Operations for MPI. In Proc. of the 2007 Intl. Conf. on High Perf. Comp., Networking, Storage and Analysis, SC07. IEEE Computer Society/ACM, Nov. 2007.
17. D. Hengsen, R. Finkel, and U. Manber. Two algorithms for barrier synchronization. Int. J. Parallel Program., 17(1):1-17, 1988.
18. S. Kumar et al. The deep computing messaging Framework: Generalized scalable message passing on the BlueGene/P supercomputer. In ICS '08: Proceedings of the 22nd annual international conference on Supercomputing, pages 94-103, New York, NY, 2008.
19. C. Bell, D. Bonachea, Y. Cote, J. Duell, P. Hargrove, P. Husbands, C. Iancu, M. Welcome, and K. Yelick. An evaluation of current highperformance networks. In Proc. of the 17th Int. Symp. on Par. and Distr. Proc., page 28.1, 2003.
20. T. Hoefler, A. Lichei, and W. Rehm. low-overhead LogGP parameter assessment for modern interconnection networks. In Proc. of the 21st IEEE Intl. Par. & Distrib. Proc. Symp., March 2007.
21. M. Matsumoto and T. Nishimura. Mersenne twister: A 623- dimensionally equidistributed uniform pseudorandom number generator. In ACM Trans. on Modeling and Computer Simulations, pages 3-30, 1998.
22. A. Lumsdaine, D. Gregor, B. Hendrickson, and J. W. Berry. Challenges in parallel graph processing. Parallel Processing Letters, 17(1):5-20, 2007.
23. D. A. Bader and K. Madduri. Parallel algorithms for evaluating centrality indices in real-world networks. In Proc. of the 2006 Int. Conf. on Parallel Processing, pages 539-550, 2006.
24. D. Gregor and A. Lumsdaine. Lifting sequential graph algorithms for distributed-memory parallel computation. SIGPLAN Not., 40(10):423-437, 2005.
25. P. Erdǒs and A. Rényi. On random graphs. Publicationes Mathematicae (Debrecen), 6:290-297, 1959.
26. D. J. Watts and S. H. Strogatz. Collective dynamics of "small-world" networks. Nature, 393(6684):440-442, June 1998.
27. J. Barnes and P. Hut. A hierarchical O(N logN) force-calculation algorithm. Nature, 324(6096):446-449, December 1986.
28. U. Becciani, R. Ansalonib, V. Antonuccio-Delogua, G. Erbaccic, M. Gamberaa, and A. Pagliaro. A parallel tree code for large N-body simulation: Dynamic load balance and data distribution on a CRAY T3D system. Comp. Phys. Comm., 106:105-113, October 1997.
29. J. K. Salmon. Parallel NlogN N-body algorithms and applications to astrophysics. Compcon Spring, (91):73-78, March 1991.
30. T. A. Davis. University of Florida sparse matrix collection. Submitted to ACM Transactions on Mathematical Software, 1994.