An Operation and Interconnection Sharing Algorithm for Reconfiguration Overhead Reduction Using Static Partial Reconfiguration

Abstract

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.Index Terms-Reconfiguration overhead management, sharing algorithm, static partial reconfiguration.

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

“…Data path reuse, including operation and interconnection reuse, is the crucial part of RA and has drawn significant attention. Two temporally partitioned tasks are modeled as two partites with the same operations linked with edges, where the maximum operation reuse can be explored via bipartite matching [18]. Considering interconnection reuse further reduces the reconfiguration overhead.…”

“…Considering interconnection reuse further reduces the reconfiguration overhead. Exploration algorithms of interconnection reuse include finding the isomorphism of sub-graphs [18] and extracting the cliques of compatibility graphs [19].…”