Task scheduling for context minimization in dynamically reconfigurable platforms

Authors:
Nei-Chiung Perng;Shih-Hao Hung
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan Univeristy, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Taiwan Univeristy, Taipei, Taiwan
Venue:
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Year:
2007

Citing 10
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
Reconfigurable computing: what, why, and implications for design automation

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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)
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

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.