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

NHUIR > College of Science and Technology > Department of Information Management > Periodical Articles > Item 987654321/25080

Please use this identifier to cite or link to this item: http://nhuir.nhu.edu.tw/handle/987654321/25080

Title:	A clustering- and probability-based approach for time-multiplexed FPGA partitioning
Authors:	吳光閔;Wu, Guang-Ming;Chao, Mango Chia-Tso;Chang, Yao-Wen
Contributors:	資訊管理學系
Keywords:	Layout;Physical_design;Partitioning
Date:	2004-12
Issue Date:	2017-07-18 15:47:49 (UTC+8)
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.
Relation:	Integration, the VLSI Journal vol. 38, no. 2 pp.245-265
Appears in Collections:	[Department of Information Management] Periodical Articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	380	View/Open