Abstract
The array aliasing mechanism provided in the Connection Machine Fortran (CMF) language and run—time system provides a unique way of identifying the memory address spaces local to processors within the global address space of distributed memory architectures, while staying in the data parallel programming paradigm. We show how the array aliasing feature can be used effectively in optimizing communication and computation performance. The constructs we present occur frequently in many scientific and engineering applications, and include various forms of aggregation and array reshaping through array aliasing. The effectiveness of the optimization techniques is demonstrated on an implementation of Anderson’s hierarchical O(N) N—body method. We also suggest a way of implementing the array aliasing feature in HPF by extending the semantics of the RESHAPE intrinsic function of Fortran 90 to include possible aliasing relationship between the parameter and returning arrays.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. R. Anderson. An implementation of the fast multipole method without multi-poles. SIAM J. Sci. Stat. Comp., 13 (4): 923 - 947, July 1992.
J. H. Applegate, M. R. Douglas, Y. Gursel, P. Hunter, C. L. Seitz, and G. J. Sussman. A digital orrery. IEEE Trans. on Computers, C-34(9): 822 - 831, September 1985.
T. Bially. Space-filling curves: Their generation and their application to bandwidth reduction. IEEE Trans. Inform. Theory, IT-15: 658 - 664, November 1969.
A. R. Butz. Convergence with hilbert’s space filling curve. J. of Computer and System Sciences, 3: 128 - 146, May 1969.
H. Forum. High Performance Fortran; language specification, version 1.0. Scientific Programming, 2 (1–2): 1 - 170, 1993.
L. Greengard and W. D. Gropp. A parallel version of the fast multipole method. In Parallel Processing for Scientific Computing, pages 213–222. SIAM, 1989.
D. Hilbert. Über die stetige Abbildung einer Linie auf Flächenstück. Math. Annln, (38): 459 - 460, 1891.
S. L. Johnsson and C.-T. Ho. Spanning graphs for optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Computers,38(9):1249–1268, September 1989.
H. Samet. Design and Analysis of Spatial Data Structures. Addison—Wesley, 1990.
Thinking Machines Corp. CM Fortran Reference Manual, Version 2.1, 1993.
Thinking Machines Corp. CMSSL for CM Fortran, Version 3.1, 1993.
Thinking Machines Corp. CM Fortran Libraries Reference Manual, version 2.2,1994.
F. Zhao. An O(N) algorithm for three—dimensional N—body simulations. Technical Report AI Memo 995, MIT, Artificial Intelligence Laboratory, October 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Hu, Y.C., Johnsson, S.L. (1999). Data Parallel Performance Optimizations Using Array Aliasing. In: Heath, M.T., Ranade, A., Schreiber, R.S. (eds) Algorithms for Parallel Processing. The IMA Volumes in Mathematics and its Applications, vol 105. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1516-5_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1516-5_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7175-8
Online ISBN: 978-1-4612-1516-5
eBook Packages: Springer Book Archive