An approach to checking link conflicts in the mapping of uniform dependence algorithms into lower dimensional processor arrays
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
737 | en_US |
dc.citation.issue |
7 | en_US |
dc.citation.spage |
732 | en_US |
dc.citation.volume |
48 | en_US |
dc.citation.woscount |
0 | |
dc.contributor.author |
Ke, JY | en_US |
dc.contributor.author |
Tsay, JC | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:46:26Z | |
dc.date.available |
2014-12-08T15:46:26Z | |
dc.date.issued |
1999-07-01 | en_US |
dc.description.abstract |
In this paper, we propose an enumeration method to check link conflicts in the mapping of n-dimensional uniform dependence algorithms with arbitrary convex index sets into k-dimensianal processor arrays. Previous methods on checking the link conflicts had to examine either the whole index set or the I/O spaces whose size are O(N-2n) or O(Nn-1), respectively, where hr is the problem size of the n-dimensional uniform dependence algorithm. In our approach, checking the link conflicts is done by enumerating integer solutions of a mixed integer linear program. In order to enumerate integer solutions efficiently, a representation of the integer solutions is devised so that the size of the space enumerated is O((2N)(n-k)). Thus, our approach to checking link conflicts has better performance than previous methods, especially for larger k. For the special case k = n - 2, we show that link conflicts can he checked by solving two linear programs in one variable. | en_US |
dc.identifier.doi |
10.1109/12.780880 | en_US |
dc.identifier.issn |
0018-9340 | en_US |
dc.identifier.journal |
IEEE TRANSACTIONS ON COMPUTERS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/12.780880 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/31261 | |
dc.identifier.wosnumber |
WOS:000081670400006 | |
dc.language.iso |
en_US | en_US |
dc.subject |
uniform dependence algorithms | en_US |
dc.subject |
lower dimensional arrays | en_US |
dc.subject |
space-time mapping | en_US |
dc.subject |
link conflict | en_US |
dc.subject |
mixed integer linear programming | en_US |
dc.subject |
Hermite normal form | en_US |
dc.subject |
Smith normal form | en_US |
dc.title |
An approach to checking link conflicts in the mapping of uniform dependence algorithms into lower dimensional processor arrays | en_US |
dc.type |
Article | en_US |
檔案
- 000081670400006.pdf (253.7 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Ke, J., & Tsay, J. (1999). An approach to checking link conflicts in the mapping of uniform dependence algorithms into lower dimensional processor arrays. IEEE TRANSACTIONS ON COMPUTERS, 48(7), 732–737. https://doi.org/10.1109/12.780880
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31261