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

Authors:
Guang-Ming Wu;Mango Chia-Tso Chao;Yao-Wen Chang
Affiliations:
Department of Information Management, Nan-Hua University, 32 Chung keng, Dalin, Chiyal, Taiwan;Computer and Information Science, National Chiao Tung University, Hsinchu 30010, Taiwan;Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan
Venue:
Integration, the VLSI Journal
Year:
2004

Citing 11
Cited 0

Introduction to algorithms

Introduction to algorithms
Buffer minimization and time-multiplexed I/O on dynamically reconfigurable FPGAs

FPGA '97 Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays
Large scale circuit partitioning with loose/stable net removal and signal flow based clustering

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Partitioning using second-order information and stochastic-gain functions

ISPD '98 Proceedings of the 1998 international symposium on Physical design
Network flow based circuit partitioning for time-multiplexed FPGAs

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Partitioning Sequential Circuits on Dynamically Reconfigurable FPGAs

IEEE Transactions on Computers
A graph theoretic optimal algorithm for schedule compression in time-multiplexed FPGA partitioning

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Temporal logic replication for dynamically reconfigurable FPGA partitioning

Proceedings of the 2002 international symposium on Physical design
A time-multiplexed FPGA

FCCM '97 Proceedings of the 5th IEEE Symposium on FPGA-Based Custom Computing Machines
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
Performance-Oriented Fully Routable Dynamic Architecture for a Field

Performance-Oriented Fully Routable Dynamic Architecture for a Field

Quantified Score

Hi-index	0.01

Visualization

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.