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

Guang Ming Wu*, Chia-Tso Chao, Yao Wen Chang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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.

Original languageEnglish
Pages (from-to)245-265
Number of pages21
JournalIntegration, the VLSI Journal
Issue number2
StatePublished - Dec 2004


  • Layout
  • Partitioning
  • Physical_design


Dive into the research topics of 'A clustering- And probability-based approach for time-multiplexed FPGA partitioning'. Together they form a unique fingerprint.

Cite this