Abstract
This paper introduces a new primitive data type, hierarchically tiled arrays (HTAs), which could be incorporated into conventional languages to facilitate parallel programming and programming for locality. It is argued that HTAs enable a natural representation for many algorithms with a high degree of locality. Also, the paper shows that, with HTAs, parallel computations and the associated communication operations can be expressed as array operations within single threaded programs. This, is then argued, facilitates reasoning about the resulting programs and stimulates the development of code that is highly readable and easy to modify. The new data type is illustrated using examples written in an extended version of MATLAB.
This work is supported in part by the Defense Advanced Research Project Agency under contract NBCH30390004. This work is not necessarily representative of the positions or policies of the Army or Government.
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
Abu-Sufah, W.A., Kuck, D.J., Lawrie, D.H.: On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations. IEEE Trans. on Computers 30(5), 341–356 (1981)
Anderson, E., et al.: LAPACK Users Guide. SIAM, Philadelphia (1992)
Carlson, W., et al.: Introduction to UPC and Language Specification. CCS-TR- 99-157, IDA Center for Computing Sciences (1999)
Chandra, R., et al.: Parallel Programming in OpenMP. Morgan Kaufmann, San Francisco (2000)
Gropp, W., Ewing, L., Skjellum, A.: Using MPI. The MIT Press, Cambridge (1999)
Gustavson, F.G.: Recursion Leads to Automatic Variable Blocking for Dense Linear-Algebra Algorithms. IBM J. Res. and Dev. 41(6), 737–755 (1997)
Hiranandani, S., Kennedy, K., Tseng, C.: Compiling Fortran D for MIMD Distributed–Memory Machines. CACM 35(8), 66–80 (1992)
Iverson, K.E.: A Programming Language. Wiley, Chichester (1962)
Koelbel, C., Mehrotra, P.: An Overview of High Performance Fortran. ACM SIGPLAN FORTRAN Forum 11(4) (December 1992)
McKellar, C., Coffman Jr., E.G.: Organizing Matrices and Matrix Operations for Paged Memory Systems. CACM 12(3), 153–165 (1969)
McKinley, K.S., Carr, S., Tseng, C.-W.: Improving Data Locality with Loop Transformations. ACM TOPLAS 18(4), 424–453 (1996)
Numrich, R.W., Reid, J.: Co-Array Fortran for Parallel Programming. ACM SIGPLAN FORTRAN Forum 17, 1–31 (1998)
Whaley, R.C., Petitet, A., Dongarra, J.: Automated Empirical Optimizations of Software and the ATLAS Project, September 19 (2000), Available as: http://www.netlib.org/lapack/lawns/lawn147.ps
Wolf, M.E., Lam, M.S.: A Data Locality Optimizing Algorithm. SIGPLAN Notices 26(6), 30–44 (1991); Proc. of the ACM SIGPLAN 1991 PLDI
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Almási, G., De Rose, L., Fraguela, B.B., Moreira, J., Padua, D. (2004). Programming for Locality and Parallelism with Hierarchically Tiled Arrays. In: Rauchwerger, L. (eds) Languages and Compilers for Parallel Computing. LCPC 2003. Lecture Notes in Computer Science, vol 2958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24644-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-24644-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21199-0
Online ISBN: 978-3-540-24644-2
eBook Packages: Springer Book Archive