Hierarchically tiled arrays for parallelism and locality

  • Authors:
  • Jia Guo;Ganesh Bikshandi;Daniel Hoeflinger;Gheorghe Almasi;Basilio Fraguela;María Jesús Garzará;David Padua;Christoph von Praun

  • Affiliations:
  • University of Illinois at Urbana-Champaign;University of Illinois at Urbana-Champaign;University of Illinois at Urbana-Champaign;IBM T.J. Watson Research Center, Yorktown Heights;Universidade da Coruña, Spain;University of Illinois at Urbana-Champaign;University of Illinois at Urbana-Champaign;IBM T.J. Watson Research Center, Yorktown Heights

  • Venue:
  • IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Parallel programming is facilitated by constructs which, unlike the widely used SPMD paradigm, provide programmers with a global view of the code and data structures. These constructs could be compiler directives containing information about data and task distribution, language extensions specifically designed for parallel computation, or classes that encapsulate parallelism. In this paper, we describe a class developed at Illinois and its MATLAB implementation. This class can be used to conveniently express both parallelism and locality. A C++ implementation is now underway. Its characteristics will be reported in a future paper. We have implemented most of the NAS benchmarks using our HTA MATLAB extensions and found during that HTAs enable the fast prototyping of parallel algorithms and produce programs that are easy to understand and maintain.