Transition-aware task scheduling and configuration selection in reconfigurable embedded systems

Authors:
Hessam Kooti;Eli Bozorgzadeh
Affiliations:
Google Inc., Mountain View, CA;University of California, Irvine, CA
Venue:
ACM SIGBED Review - Special Issue on the 5th Workshop on Adaptive and Reconfigurable Embedded Systems
Year:
2013

Citing 7
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Overhead-Conscious Voltage Selection for Dynamic and Leakage Energy Reduction of Time-Constrained Systems

Proceedings of the conference on Design, automation and test in Europe - Volume 1
A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles

HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 3 - Volume 03
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
Transition-aware real-time task scheduling for reconfigurable embedded systems

Proceedings of the Conference on Design, Automation and Test in Europe
Energy minimization for real-time systems with non-convex and discrete operation modes

Proceedings of the Conference on Design, Automation and Test in Europe
Unified theory of real-time task scheduling and dynamic voltage/frequency scaling on MPSoCs

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel graph representation that captures the transition overhead due to runtime configuration of underlying hardware in reconfigurable embedded systems resulting from various configuration schemes such as FPGA-like reconfiguration or dynamic voltage/frequency scaling (DVFS). We propose an intuitive heuristic to solve combined configuration selection and task scheduling problem on this graph. In addition, when applied to DVFS, our algorithm provides simultaneous task ordering and configuration selection of the system which outperforms the state-of-the-art DVFS methods applied after task ordering.