Abstract
Irregular scientific applications are often difficult to parallelize due to elaborate dynamic data structures with complicated communication patterns. We describe flexible data orchestration abstractions that enable the programmer to express customized communication patterns arising in an important class of irregular computations—adaptive finite difference methods for partial differential equations. These abstractions are supported by KeLP, a c++ run-time library. KeLP enables the programmer to manage spatial data dependence patterns and express data motion handlers as first-class mutable objects. Using two finite difference applications, we show that KeLP's flexible communication model effectively manages elaborate data motion arising in semi-structured adaptive methods.
This research is supported in part by ONR contract N00014-93-1-0152 and by the DOE Computational Science Graduate Fellowship Program. Computer time on the Intel Paragon at the San Diego Supercomputer Center was provided by a UCSD School of Engineering block grant. Access to the IBM SP2 was provided by the Cornell Theory Center.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
High Performance Fortran Forum, “High performance fortran language specification,” Rice Univeristy, Houston, Texas, May 1993.
S. R. Kohn, A Parallel Software Infrastructure for Dynamic Block-Irregular Scientific Calculations. PhD thesis, University of California at San Diego, 1995.
R. Das, M. Uysal, J. Saltz, and Y.-S. Hwang, “Communication optimizations for irregular scientific computations on distributed memory architectures,” Journal of Parallel and Distributed Computing, vol. 22, no. 3, pp. 462–479, 1994.
G. Agrawal, A. Sussman, and J. Saltz, “An integrated runtime and compile-time approach for parallelizing structured and block structured applications,” IEEE Transactions on Parallel and Distributed Systems, to appear.
C. Chang, A. Sussman, and J. Saltz, “Support for distributed dynamic data structures in C++,” Tech. Rep. CS-TR-3266, University of Maryland, 1995.
M. Kaddoura and S. Ranka, “Runtime support for data parallel applications for adaptive and non-uniform computational environments.” Preliminary Version, February 1995.
S. R. Kohn and S. B. Baden, “Irregular coarse-grain data parallelism under LPARX,” J. Scientific Programming, vol. 5, no. 3, 1996.
E. J. Bylaska, S. R. Kohn, S. B. Baden, A. Edelman, R. Kawai, M. E. G. Ong, and J. H. Weare, “Scalable parallel numerical methods and software tools for material design,” in Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, (San Francisco, CA), February 1995.
Message-Passing Interface Standard, “MPI: A message-passing interface standard,” University of Tennessee, Knoxville, TN, June 1995.
G. M. Amdahl, “Validity of the single processor approach to achieving large scale computing capabilities,” in Proceedings of the AFIPS Spring Joint Computer Conference, (Atlantic City, NJ), pp. 483–485, April 1967.
C. Rendleman, V. B. J. Bell, B. Crutchfield, L. Howell, and M. Welcome, “Boxlib users guide and manual: A library for managing rectangular domains. edition 1.99,” tech. rep., Center for Computational Science and Engineering, Lawrence Livermore National Laboratory, 1995.
M. Parashar and J. C. Browne, “Dagh: A data-management infrastructure for parallel adaptive mesh refinement techniques,” tech. rep., Department of Computer Science, University of Texas at Austin, 1995.
A. Choudhary, R. Bordawekar, M. Harry, R. Krishnaiyer, R. Ponnusamy, T. Singh, and R. Thakur, “PASSION:parallel and scalable software for I/O,” Tech. Rep. SCCS-636, NPAC., September 1994.
R.Bennett, K. Bryant, A. Sussman, R. Das, and J. Saltz, “A framework for optimizing parallel I/O,” Tech. Rep. CS-TR-3417, University of Maryland: Department of Computer Science, January 1995.
S. S. Mukherjee, S. D. Sharman, M. D. Hill, J. R. Larus, A. Rogers, and J. Saltz, “Efficient support for irregular applications on distributed memory machines,” in PPoPP 95, 1995.
B. Falsafi, A. R. Lebeck, S. K. Reinhardt, I. Schoinas, M. D. Hill, J. R. Larus, A. Rogers, and D. A. Wood, “Application-specific protocols for user-level shared memory,” in Proceedings of Supercomputing '94, November 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fink, S.J., Baden, S.B., Kohn, S.R. (1996). Flexible communication mechanisms for dynamic structured applications. In: Ferreira, A., Rolim, J., Saad, Y., Yang, T. (eds) Parallel Algorithms for Irregularly Structured Problems. IRREGULAR 1996. Lecture Notes in Computer Science, vol 1117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030111
Download citation
DOI: https://doi.org/10.1007/BFb0030111
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61549-1
Online ISBN: 978-3-540-68808-2
eBook Packages: Springer Book Archive