Title :
Algebraic transformations in regular array design
Author :
Plaks, Toomas P.
fDate :
6/23/1905 12:00:00 AM
Abstract :
Efficient parallelizing and mapping of algorithms onto regular arrays requires algebraic transformations. The paper considers the Iso-plane method for a class of algebraic transformations on the polytope model of algorithm. This method uses the partitioning of the ranges of loop indices in order to increase the dimensionality of the problem representation and a specific reordering of computations. As a result, the higher dimensional arrays with improved time complexity are produced
Keywords :
computational complexity; parallel algorithms; parallel programming; vectors; Iso-plane method; algebraic transformations; algorithm parallelization; higher dimensional arrays; loop indices; parallelizing algorithms; polytope model; problem representation; regular array design; time complexity; Equations; Graphics; Hardware; Iterative algorithms; Partitioning algorithms; Pipelines; Solid modeling;
Conference_Titel :
Computer Software and Applications Conference, 2001. COMPSAC 2001. 25th Annual International
Conference_Location :
Chicago, IL
Print_ISBN :
0-7695-1372-7
DOI :
10.1109/CMPSAC.2001.960647
