查詢結果分析
相關文獻
頁籤選單縮合
題 名 | Finding Space-Optimal Linear Array for Uniform Dependence Algorithms with Arbitrary Convex Index Sets |
---|---|
作 者 | 柯振揚; 蔡中川; | 書刊名 | Journal of Information Science and Engineering |
卷 期 | 14:4 1998.12[民87.12] |
頁 次 | 頁743-763 |
專 輯 | Special Section on Parallel Processing |
分類號 | 312.1 |
關鍵詞 | Uniform dependence algorithms; Linear schedule; Allocation vector; Norm space optimal; |
語 文 | 英文(English) |
英文摘要 | 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 becasue 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. |
本系統中英文摘要資訊取自各篇刊載內容。