Clustering- and probability-based approach for time-multiplexed FPGA partitioning

Chia-Tso Chao*, Guang Ming Wu, Iris Hui Ru Jiang, Yao Wen Chang

*Corresponding author for this work

研究成果: Conference article同行評審

17 引文 斯高帕斯(Scopus)


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.

頁(從 - 到)364-368
期刊IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers
出版狀態Published - 1 十二月 1999
事件Proceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design (ICCAD-99) - San Jose, CA, USA
持續時間: 7 十一月 199911 十一月 1999

指紋 深入研究「Clustering- and probability-based approach for time-multiplexed FPGA partitioning」主題。共同形成了獨特的指紋。