The Community for Technology Leaders
Parallel Computing in Electrical Engineering, 2004. International Conference on (2006)
Bialystok, Poland
Sept. 13, 2006 to Sept. 17, 2006
ISBN: 0-7695-2554-7
pp: 153-160
Hritam Dutta , University of Erlangen-Nuremberg, Germany
Frank Hannig , University of Erlangen-Nuremberg, Germany
J?urgen Teich , University of Erlangen-Nuremberg, Germany
ABSTRACT
Processor arrays are used as accelerators for plenty of data flow-dominant applications. The explosive growth in research and development of massively parallel processor array architectures has lead to demand for mapping tools to realize the full potential of these architectures. Such architectures are characterized by hierarchies of parallelism and memory structures, i.e. processor array apart from different levels of cache arrays have a number of processing elements (PE) where each PE can further contain sub-word parallelism. In order to handle large scale problems, balance local memory requirements with I/O-bandwidth, and use different hierarchies of parallelism and memory, one needs a sophisticated transformation called hierarchical partitioning. In this paper, we introduce for the first time a detailed methodology encompassing hierarchical partitioning.
INDEX TERMS
null
CITATION
Hritam Dutta, Frank Hannig, J?urgen Teich, "Hierarchical Partitioning for Piecewise Linear Algorithms", Parallel Computing in Electrical Engineering, 2004. International Conference on, vol. 00, no. , pp. 153-160, 2006, doi:10.1109/PARELEC.2006.43
94 ms
(Ver 3.3 (11022016))