By Topic

Online Dynamic Voltage Scaling using Task Graph Mapping Analysis for Multiprocessors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Pravanjan Choudhury ; Indian Institute of Technology Kharagpur, India ; P. P. Chakrabarti ; Rajeev Kumar

This paper presents a run-time slack distribution strategy for precedence constrained task graphs mapped on to a voltage scalable multiprocessor 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

Published in:

20th International Conference on VLSI Design held jointly with 6th International Conference on Embedded Systems (VLSID'07)

Date of Conference:

6-10 Jan. 2007