An intra-task DVS algorithm exploiting path probabilities for real-time systems

Authors:
G. Sudha Anil Kumar;G. Manimaran
Affiliations:
Real Time Computing & Networking Laboratory, Dept. of Electrical and Computer Engineering, Iowa State University, Ames, IA;Real Time Computing & Networking Laboratory, Dept. of Electrical and Computer Engineering, Iowa State University, Ames, IA
Venue:
ACM SIGBED Review - Special issue: IEEE RTAS 2005 work-in-progress
Year:
2005

Citing 8
Cited 1

Static scheduling of conditional branches in parallel programs

Journal of Parallel and Distributed Computing
Run-time voltage hopping for low-power real-time systems

Proceedings of the 37th Annual Design Automation Conference
A profile-based energy-efficient intra-task voltage scheduling algorithm for real-time applications

ISLPED '01 Proceedings of the 2001 international symposium on Low power electronics and design
Real-time dynamic voltage scaling for low-power embedded operating systems

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Using Paths to Measure, Explain, and Enhance Program Behavior

Computer
Intra-Task Voltage Scheduling for Low-Energy, Hard Real-Time Applications

IEEE Design & Test
Energy efficient CMOS microprocessor design

HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Profile-based optimal intra-task voltage scheduling for hard real-time applications

Proceedings of the 41st annual Design Automation Conference

An intra-task DVS algorithm exploiting program path locality for real-time embedded systems

HiPC'05 Proceedings of the 12th international conference on High Performance Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a novel intra-task Dynamic Voltage Scheduling (DVS) algorithm based on the knowledge of frequently executed paths in the control flow graph for real time systems. The basic idea is to construct a common path composing all the frequently executed paths (hot-paths) and perform DVS scheduling based on this common path, rather than the most probable path. We compare the performance of the proposed algorithm with an existing algorithm. The preliminary results show that the proposed algorithm performs better than the existing algorithm.