Temporal logic replication for dynamically reconfigurable FPGA partitioning

Authors:
Wai-Kei Mak;E. F.Y. Young
Affiliations:
Dept. of Comput. Sci. & Eng., Univ. of South Florida, Tampa, FL, USA;-
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 5

Temporal partitioning data flow graphs for dynamically reconfigurable computing

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A minimum communication cost algorithm for dynamically reconfigurable computing system

CSS '07 Proceedings of the Fifth IASTED International Conference on Circuits, Signals and Systems
Reducing reconfiguration time of reconfigurable computing systems in integrated temporal partitioning and physical design framework

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A Performance-Oriented Algorithm with Consideration on Communication Cost for Dynamically Reconfigurable FPGA Partitioning

ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Power minimization for dynamically reconfigurable FPGA partitioning

ACM Transactions on Embedded Computing Systems (TECS) - Special section on ESTIMedia'12, LCTES'11, rigorous embedded systems design, and multiprocessor system-on-chip for cyber-physical systems

Quantified Score

Hi-index	0.03

Visualization

Abstract

In this paper, we propose the idea of temporal logic replication in dynamically reconfigurable field-programmable gate array partitioning to reduce the communication cost. We show that this is a very effective means to reduce the communication cost by taking advantage of the slack logic capacity available. Given a K-stage temporal partition, the min-area min-cut replication problem is defined and we present an optimal algorithm to solve it. We also present a flow-based replication heuristic which is applicable when there is a tight area bound that limits the amount of possible replication. In addition, we show a correct network flow model for partitioning sequential circuits temporally and propose a new hierarchical flow-based performance-driven partitioner for computing initial partitions without replication.