Generic ILP-based approaches for time-multiplexed FPGA partitioning

doi:10.1109/43.952745

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

請使用永久網址來引用或連結此文件: http://nhuir.nhu.edu.tw/handle/987654321/25078

題名:	Generic ILP-based approaches for time-multiplexed FPGA partitioning
作者:	吳光閔;Wu, Guang-Ming;Lin, Jai-Ming;Chang, Yao-Wen
貢獻者:	資訊管理學系
關鍵詞:	Field programmable gate arrays;Circuits;Logic arrays;Chaos;Logic devices;Computer architecture;Programmable logic arrays;Flip-flops;Clustering methods;Runtime
日期:	2001-10
上傳時間:	2017-07-18 15:47:37 (UTC+8)
摘要:	Due to the precedence constraints among vertices, the partitioning problem for time-multiplexed field-programmable gate arrays (TMFPGAs) is different from the traditional one. In this paper, we first derive logic formulations for the precedence-constrained partitioning problems and then transform the formulations into integer linear programs (ILPs). The ILPs can handle the precedence constraints and minimize cut sizes simultaneously. To enhance performance, we also propose a clustering method to reduce the problem size. Experimental results based on the Xilinx TMFPGA architecture show that our approach outperforms the list-scheduling (List), the network-flow-based (FBB-m) (Liu and Wong, 1998), and the probability-based (PAT) (Chao, 1999) methods by respective average improvements of 46.6%, 32.3% and 21.5% in cut sizes. Our approach is practical and scales well to larger problems; the empirical runtime grows close to linearly in the circuit size. More importantly, our approach is very flexible and can readily extend to the partitioning problems with various objectives and constraints, which makes the ILP formulations superior alternatives to the TMFPGA partitioning problems.
關聯:	IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems vol. 20, no. 10 pp.1266-1274
顯示於類別:	[資訊管理學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	471	檢視/開啟

在NHUIR中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....