Temporal logic replication for dynamically reconfigurable FPGA partitioning

Authors:
Wai-Kei Mak;Evangeline F. Y. Young
Affiliations:
University of South Florida, Tampa, FL;The Chinese University of Hong Kong, Shatin, N.T., Hong Kong
Venue:
Proceedings of the 2002 international symposium on Physical design
Year:
2002

Citing 13
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Efficient network flow based min-cut balanced partitioning

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
A unified cost model for min-cut partitioning with replication applied to optimization of large heterogeneous FPGA partitions

EURO-DAC '94 Proceedings of the conference on European design automation
New algorithms for min-cut replication in partitioned circuits

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Cut problems and their application to divide-and-conquer

Approximation algorithms for NP-hard problems
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
Scheduling designs into a time-multiplexed FPGA

FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays
Partitioning sequential circuits on dynamically reconfiguable FPGAs

FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays
Network flow based circuit partitioning for time-multiplexed FPGAs

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
A clustering- and probability-based approach for time-multiplexed FPGA partitioning

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
A time-multiplexed FPGA

FCCM '97 Proceedings of the 5th IEEE Symposium on FPGA-Based Custom Computing Machines
Generic ILP-based approaches for time-multiplexed FPGA partitioning

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Min-cut replication in partitioned networks

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

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

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose the idea of temporal logic replication in dynamically reconfigurable field-programmable gate array partitioning to reduce communication cost. Temporal logic replication has never been explored before. We define the min-area min-cut replication problem given a k-stage temporal partition satisfying all temporal constraints and devise an optimal algorithm to solve this problem. We have also devised a flow-based replication heuristic in case there is a tight area bound that limits the amount of replication. In addition, we will present a correct network flow model for partitioning sequential circuits temporally.