Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1007/11532378_8guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Implementation of parallel numerical algorithms using hierarchically tiled arrays

Published: 22 September 2004 Publication History

Abstract

In this paper, we describe our experience in writing parallel numerical algorithms using Hierarchically Tiled Arrays (HTAs). HTAs are classes of objects that encapsulate parallelism. HTAs allow the construction of single-threaded parallel programs where a master process distributes tasks to be executed by a collection of servers holding the components (tiles) of the HTAs.
The tiled and recursive nature of HTAs facilitates the development of algorithms with a high degree of parallelism as well as locality. We have implemented HTAs as a MATLABTM toolbox, overloading conventional operators and array functions such that HTA operations appear to the programmer as extensions of MATLABTM. We have successfully used it to write some widely used parallel numerical programs. The resulting programs are easier to understand and maintain than their MPI counterparts.

References

[1]
Nas Parallel Benchmarks. Website. http://www.nas.nasa.gov/Software/NPB/.
[2]
High performance fortran forum. High Performance Fortran Specification Version 2.0, January 1997.
[3]
G. Almasi, L. De Rose, B.B. Fraguela, J. Moreira, and D. Padua. Programming for locality and parallelism with hierarchically tiled arrays. In Proc. of the 16th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2003, to be published in Lecture Notes in Computer Science, vol. 2958, College Station, Texas, Oct 2003. Springer-Verlag.
[4]
L.E. Cannon. A cellular computer to implement the Kalman Filter Algorithm. PhD thesis, Montana State University, 1969.
[5]
W. Carlson, J. Draper, D. Culler, K. Yelick, E. Brooks, and K. Warren. Introduction to upc and language specification. Technical Report CCS-TR-99-157, IDA Center for Computing Sciences, 1999.
[6]
B.L. Chamberlin, S.Choi, E.C. Lewis, C. Lin, L. Synder, and W.D. Weathersby. The case for high level parallel programming in ZPL. IEEE Computational Science and Engineering, 5(3):76-86, July-September 1998.
[7]
Al Geist, Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Manchek, and Vaidyalingam S. Sunderam. PVM: Parallel Virtual Machine: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press, Cambridge, MA, USA, 1994.
[8]
W. Gropp, E. Lusk, and A. Skjellum. Using MPI (2nd ed.): Portable Parallel Programming with the Message-Passing Interface. MIT Press, 1999.
[9]
S. Hiranandani, K. Kennedy, and C.-W. Tseng. Compiling fortran d for mimd distributed-memory machines. Commun. ACM, 35(8):66-80, 1992.
[10]
C. Koelbel and P. Mehrotra. An overview of high performance fortran. SIGPLAN Fortran Forum, 11(4):9-16, 1992.
[11]
R. W. Numrich and J. Reid. Co-array fortran for parallel programming. SIGPLAN Fortran Forum, 17(2):1-31, 1998.

Cited By

View all
  • (2022)TileSpGEMMProceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3503221.3508431(90-106)Online publication date: 2-Apr-2022
  • (2006)An approach to locality-conscious load balancing and transparent memory hierarchy management with a global- address-space parallel programming modelProceedings of the 20th international conference on Parallel and distributed processing10.5555/1898699.1898947(383-383)Online publication date: 25-Apr-2006
  1. Implementation of parallel numerical algorithms using hierarchically tiled arrays

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Guide Proceedings
    LCPC'04: Proceedings of the 17th international conference on Languages and Compilers for High Performance Computing
    September 2004
    484 pages
    ISBN:354028009X
    • Editors:
    • Rudolf Eigenmann,
    • Zhiyuan Li,
    • Samuel P. Midkiff

    Sponsors

    • International Business Machines Corporation: International Business Machines Corporation
    • National Science Foundation, USA

    Publisher

    Springer-Verlag

    Berlin, Heidelberg

    Publication History

    Published: 22 September 2004

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 02 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)TileSpGEMMProceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3503221.3508431(90-106)Online publication date: 2-Apr-2022
    • (2006)An approach to locality-conscious load balancing and transparent memory hierarchy management with a global- address-space parallel programming modelProceedings of the 20th international conference on Parallel and distributed processing10.5555/1898699.1898947(383-383)Online publication date: 25-Apr-2006

    View Options

    View options

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media