A minimum communication cost algorithm for dynamically reconfigurable computing system

Authors:
Yung-Chuan Jiang;Yen-Tai Lai
Affiliations:
National Cheng Kung University, Tainan, Taiwan;National Cheng Kung University, Tainan, Taiwan
Venue:
CSS '07 Proceedings of the Fifth IASTED International Conference on Circuits, Signals and Systems
Year:
2007

Citing 12
Cited 0

Efficient network flow based min-cut balanced partitioning

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Network flow based circuit partitioning for time-multiplexed FPGAs

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Temporal Partitioning and Scheduling Data Flow Graphs for Reconfigurable Computers

IEEE Transactions on Computers
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 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
A decade of reconfigurable computing: a visionary retrospective

Proceedings of the conference on Design, automation and test in Europe
A D&T Special Report on ACM/SIGDA Design Automation Benchmarks: Catalyst or Anathema?

IEEE Design & Test
A time-multiplexed FPGA

FCCM '97 Proceedings of the 5th IEEE Symposium on FPGA-Based Custom Computing Machines
Performance-Oriented Fully Routable Dynamic Architecture for a Field

Performance-Oriented Fully Routable Dynamic Architecture for a Field
Network-flow-based multiway partitioning with area and pin constraints

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Generic ILP-based approaches for time-multiplexed FPGA partitioning

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Temporal logic replication for dynamically reconfigurable FPGA partitioning

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In reconfigurable computing systems, dynamically reconfigurable FPGA are evolving rapidly, due to their flexibility and high performance. The communication cost is one of important factors in dynamically reconfigurable FPGA. This paper proposes a scheduling technique based on network flow partitioning for the dynamically reconfigurable FPGA to reduce communication cost. We use a scheduling technique in which gate can not be replicated to minimize the communication cost. By constructing a graph the scheduling technique is converted to minimize communication cost. This algorithm was tested on a set of benchmark examples. The experimental results demonstrate effectiveness of this proposed algorithm.