Online Dynamic Voltage Scaling using Task Graph Mapping Analysis for Multiprocessors

Authors:
Pravanjan Choudhury;P. P. Chakrabarti;Rajeev Kumar
Affiliations:
Indian Institute of Technology Kharagpur, India;Indian Institute of Technology Kharagpur, India;Indian Institute of Technology Kharagpur, India
Venue:
VLSID '07 Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems
Year:
2007

Citing 0
Cited 2

A power-aware online scheduling algorithm for streaming applications in embedded MPSoC

PATMOS'10 Proceedings of the 20th international conference on Integrated circuit and system design: power and timing modeling, optimization and simulation
Energy optimization by exploiting execution slacks in streaming applications on multiprocessor systems

Proceedings of the 50th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a run-time slack distribution strategy for precedence constrained task graphs mapped on to a voltage scalable multi-processor platform. Online Dynamic Voltage Scaling techniques use the slack formed due to early finish of tasks and lower the supply voltage suitably so that energy reduction is achieved while meeting the worst-case deadline of the task graph. Given a task graph mapping on a multiprocessor, the proposed offline analysis phase calculates expected slack and expected computation ahead of each task. The online voltage scheduler uses these values and the current slack to decide the voltage and frequency of execution of the next scheduled task in order to minimize expected energy dissipation. Results show improvement in average energy saving with this methodology over most of the presently known online techniques.