Practical On-line DVS Scheduling for Fixed-Priority Real-Time Systems

Authors:
Bren Mochocki;Xiaobo Sharon Hu;Gang Quan
Affiliations:
University of Notre Dame, IN;University of Notre Dame, IN;University of South Carolina, Columbia
Venue:
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
Year:
2005

Citing 0
Cited 10

Workload-ahead-driven online energy minimization techniques for battery-powered embedded systems with time-constraints

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Transition-overhead-aware voltage scheduling for fixed-priority real-time systems

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Energy efficient DVS schedule for fixed-priority real-time systems

ACM Transactions on Embedded Computing Systems (TECS) - Special Section LCTES'05
Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules

ISLPED '07 Proceedings of the 2007 international symposium on Low power electronics and design
System-wide energy minimization for real-time tasks: Lower bound and approximation

ACM Transactions on Embedded Computing Systems (TECS)
Bounding energy consumption in large-scale MPI programs

Proceedings of the 2007 ACM/IEEE conference on Supercomputing
A Dynamic Voltage Scaling Algorithm for Dynamic Workloads

Journal of Signal Processing Systems
Adagio: making DVS practical for complex HPC applications

Proceedings of the 23rd international conference on Supercomputing
Staying-alive path planning with energy optimization for mobile robots

Expert Systems with Applications: An International Journal
Exploring hardware overprovisioning in power-constrained, high performance computing

Proceedings of the 27th international ACM conference on International conference on supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an on-line Dynamic Voltage Scaling (DVS) algorithm for preemptive fixed-priority real-time systems called low power Limited Demand Analysis with Transition overhead (lpLDAT). It is the first algorithm in its class to explicitly account for transition overhead, and can reduce the energy consumption by as much as 40% when compared to previous methods.