Paper Info
Title
Data Alignments for Modular Time-Space Mappings of BLAS-like Algorithms
Abstract
Modular time-space transformations have been recently proposed for algorithm mappings that cannot be described by affine functions. This paper extends affine data alignments to a new class of data alignments, called expanded modular data alignments (EMDAs), for algorithms that are mapped by modular time-space transformations. An EMDA is a set of modular data alignments (MDAs) which are described by affine functions modulo a constant vector. With an EMDA, multiple copies of a data array are mapped into target processors by different modular data alignments (MDAs) and therefore can be efficiently used with modular time-space transformations which may require several operations to access the same data at the same time. Conditions of EMDAs that guarantee local access of data entries are provided. These conditions cover initial data alignment, data movement during the computation, and the number of copies required to avoid unnecessary communications. These conditions can be used to derive the EMDA for a given modular mapping or to generate a modular mapping for a given EMDA so that communication due to data misalignment does not occur. Several examples are given to show that EMDAs are well suited for modular time-space mappings.
Year
DOI
Venue
1995
10.1109/ASAP.1995.522903
ASAP
Keywords
DocType
ISBN
data array,modular time-space transformation,modular time-space mappings,data alignments,data entry,different modular data alignment,data alignment,affine data alignment,blas-like algorithms,modular data alignment,data movement,data misalignment,modular mapping,space mapping
Conference
0-8186-7109-2
Citations 
PageRank 
References 
0
0.34
5
Authors
2
Name
Order
Citations
PageRank
Hyuk-Jae Lee133755.29
Jose A. B. Fortes244652.01