Finding space-optimal linear array for uniform dependence algorithms with arbitrary convex index sets
檔案
- 000077995800004.pdf (125.5 KB, Adobe PDF)
日期
1998-12-01
類型
系所
期刊名稱
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING
卷期與頁次
第 14 卷第 4 期,頁 743–763
ISSN
1016-2364
語言
英文
摘要
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.
所屬典藏
期刊論文引用此條目
Ke, J., & Tsay, J. (1998). Finding space-optimal linear array for uniform dependence algorithms with arbitrary convex index sets. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 14(4), 743–763. https://ir.lib.nycu.edu.tw/handle/11536/31753
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31753