Abstract
Hierarchically Tiled Arrays (HTAs) are data structures that facilitate locality and parallelism of array intensive computations with block-recursive nature. The model underlying HTAs provides programmers with a global view of distributed data as well as a single-threaded view of the execution. In this paper we present htalib, a C++ implementation of HTAs. This library provides several novel constructs: (i) A map-reduce operator framework that facilitates the implementation of distributed operations with HTAs. (ii) Overlapped tiling in support of tiling in stencil codes, (iii) Data layering, facilitating the use of HTAs in adaptive mesh refinement applications. We describe the interface and design of htalib and our experience with the new programming constructs. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Bikshandi, G., Guo, J., Von Praun, C., Tanase, G., Fraguela, B. B., Garzarán, M. J., … Rauchwerger, L. (2007). Design and use of htalib - A library for hierarchically tiled arrays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4382 LNCS, pp. 17–32). Springer Verlag. https://doi.org/10.1007/978-3-540-72521-3_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
