An operation and interconnection sharing algorithm for reconfiguration overhead reduction using static partial reconfiguration

Authors:
Sungjoon Jung;Tag Gon Kim
Affiliations:
Electrical Engineering Department, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea;Electrical Engineering Department, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Year:
2008

Citing 10
Cited 1

MediaBench: a tool for evaluating and synthesizing multimedia and communicatons systems

MICRO 30 Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
MorphoSys: An Integrated Reconfigurable System for Data-Parallel and Computation-Intensive Applications

IEEE Transactions on Computers
Managing dynamic reconfiguration overhead in systems-on-a-chip design using reconfigurable datapaths and optimized interconnection networks

Proceedings of the conference on Design, automation and test in Europe
Datapath merging and interconnection sharing for reconfigurable architectures

Proceedings of the 15th international symposium on System Synthesis
The Garp Architecture and C Compiler

Computer
Loop Dissevering: A Technique for Temporally Partitioning Loops in Dynamically Reconfigurable Computing Platforms

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Configuration management techniques for reconfigurable computing

Configuration management techniques for reconfigurable computing
Spatial computation

Spatial computation
Configuration Sharing to Reduce Reconfiguration Overhead Using Static Partial Reconfiguration

IEICE - Transactions on Information and Systems

Reconfigurable Architecture for Deinterlacer based on Algorithm/Architecture Co-Design

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In most reconfigurable architectures, reconfiguration overhead is a great bottleneck for repetitive reconfigurations. In this paper, we introduce a resource sharing algorithm exploiting static partial reconfiguration to reduce reconfiguration overhead between consecutive configurations. The proposed algorithm allows parameterizing reconfiguration overhead for individual resources. We also present both conservative and aggressive pruning techniques to reduce computation time. Experiments have been conducted with generated graphs and real benchmarks using a synthesizable intermediate representation. The results report that the algorithm could share up to 6.82% more resources than a previous interconnection sharing technique, and that the algorithm could reuse 80.9% resources in the selected benchmarks.