A clustering- and probability-based approach for time-multiplexed FPGA partitioning
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
265 | en_US |
dc.citation.issue |
2 | en_US |
dc.citation.spage |
245 | en_US |
dc.citation.volume |
38 | en_US |
dc.citation.woscount |
0 | |
dc.contributor.author |
Wu, GM | en_US |
dc.contributor.author |
Chao, MCT | en_US |
dc.contributor.author |
Chang, YW | en_US |
dc.contributor.department |
交大名義發表 | zh_TW |
dc.contributor.department |
National Chiao Tung University | en_US |
dc.date.accessioned |
2014-12-08T15:37:16Z | |
dc.date.available |
2014-12-08T15:37:16Z | |
dc.date.issued |
2004-12-01 | en_US |
dc.description.abstract |
Improving logic density by time-sharing, time-multiplexed FPGAs (TMFPGAs) have become an important research topic for reconfigurable computing. Due to the precedence and capacity constraints in TMFPGAs, the clustering and partitioning problems for TMFPGAs are different from the traditional ones. In this paper, we propose a two-phase hierarchical approach to solve the partitioning problem for TMFPGAs. With the precedence and capacity considerations for both phases, the first phase clusters nodes to reduce the problem size, and the second phase applies a probability-based iterative-improvement approach to minimize cut cost. Experimental results based on the Xilinx TMFPGA architecture show that our algorithm significantly outperforms previous works. (C) 2004 Elsevier B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.vlsi.2004.06.003 | en_US |
dc.identifier.issn |
0167-9260 | en_US |
dc.identifier.journal |
INTEGRATION-THE VLSI JOURNAL | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.vlsi.2004.06.003 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/25615 | |
dc.identifier.wosnumber |
WOS:000225661300005 | |
dc.language.iso |
en_US | en_US |
dc.subject |
layout | en_US |
dc.subject |
physical_design | en_US |
dc.subject |
partitioning | en_US |
dc.title |
A clustering- and probability-based approach for time-multiplexed FPGA partitioning | en_US |
dc.type |
Article | en_US |
檔案
- 000225661300005.pdf (404.2 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Wu, G., Chao, M., & Chang, Y. (2004). A clustering- and probability-based approach for time-multiplexed FPGA partitioning. INTEGRATION-THE VLSI JOURNAL, 38(2), 245–265. https://doi.org/10.1016/j.vlsi.2004.06.003
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/25615