|標題:||Finding space-optimal linear array for uniform dependence algorithms with arbitrary convex index sets|
Department of Computer Science
|關鍵字:||uniform dependence algorithms;linear schedule;allocation vector;norm;space optimal|
|摘要:||The mapping of an n-dimensional uniform dependence algorithm onto a linear processor array can be considered as a linear transformation problem. However, to find a linear space-optimal transformation is difficult because the conditions for checking a correct mapping and the space cost function do not have closed-form expressions, especially when the index set J of an n-dimensional algorithm is of an arbitrary bounded convex index set. In this paper, we propose an enumeration method to find a space-optimal PE allocation vector for mapping an n-dimensional uniform dependence algorithm with an arbitrary bounded convex index set onto a linear processor array, assuming that a linear schedule is given a priori.|
|期刊:||JOURNAL OF INFORMATION SCIENCE AND ENGINEERING|
|Appears in Collections:||Articles|
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.