A clustering- and probability-based approach for time-multiplexed FPGA partitioning

南華大學機構典藏系統 > 科技學院 > 資訊管理學系 > 期刊論文 > Item 987654321/25080

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://nhuir.nhu.edu.tw/handle/987654321/25080

题名:	A clustering- and probability-based approach for time-multiplexed FPGA partitioning
作者:	吳光閔;Wu, Guang-Ming;Chao, Mango Chia-Tso;Chang, Yao-Wen
貢獻者:	資訊管理學系
关键词:	Layout;Physical_design;Partitioning
日期:	2004-12
上传时间:	2017-07-18 15:47:49 (UTC+8)
摘要:	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.
關聯:	Integration, the VLSI Journal vol. 38, no. 2 pp.245-265
显示于类别:	[資訊管理學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	377	检视/开启

在NHUIR中所有的数据项都受到原著作权保护.

TAIR相关文章