Task Scheduling for Context Minimization in Dynamically Reconfigurable Platforms

Authors:
Nei-Chiung Perng;Shih-Hao Hung;Chia-Heng Tu
Affiliations:
Genesyslogic, Inc., Shindian City, Taiwan;Department of Computer Science and Information Engineering, Graduate Institute of Networking and Multimedia, National Taiwan University, Taipei, Taiwan 106;Graduate Institute of Networking and Multimedia, National Taiwan University, Taipei, Taiwan 106
Venue:
Journal of Signal Processing Systems
Year:
2010

Citing 14
Cited 0

Configuration prefetch for single context reconfigurable coprocessors

FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays
TGFF: task graphs for free

Proceedings of the 6th international workshop on Hardware/software codesign
Reconfigurable computing: what, why, and implications for design automation

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Algorithms for VLSI Design Automation

Algorithms for VLSI Design Automation
Applying and Implementing the MPEG-4 Multimedia Standard

IEEE Micro
FPGA-Based System Design

FPGA-Based System Design
An optimal algorithm for minimizing run-time reconfiguration delay

ACM Transactions on Embedded Computing Systems (TECS)
Multitasking on reconfigurable architectures: microarchitecture support and dynamic scheduling

ACM Transactions on Embedded Computing Systems (TECS)
Modeling and optimizing run-time reconfiguration using evolutionary computation

ACM Transactions on Embedded Computing Systems (TECS)
An Execution Environment for Reconfigurable Computing

FCCM '05 Proceedings of the 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
A Reconfiguration Manager for Dynamically Reconfigurable Hardware

IEEE Design & Test
Temporal floorplanning using the T-tree formulation

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Scheduling Intervals for Reconfigurable Computing

FCCM '08 Proceedings of the 2008 16th International Symposium on Field-Programmable Custom Computing Machines
System-level power-performance tradeoffs for reconfigurable computing

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamically reconfigurable hardware provides useful means to reduce the time-to-prototype and even the time-to-market in product designs. It also offers a good alternative in reconfiguring hardware logics to optimize the system performance. This paper targets an essential issue in reconfigurable computing, i.e., the minimization of configuration contexts. We explore different constraints on the CONTEXT MINIMIZATION problem. When the resulting subproblems are polynomial-time solvable, optimal algorithms are presented. We also present a greedy algorithm for the CONTEXT MINIMIZATION problem, that is proved $\mathcal{NP}$ -complete. The capability of the proposed algorithm is evaluated by a series of experiments.