A Power-Aware, Best-Effort Real-Time Task Scheduling Algorithm

Authors:
Jinggang Wang;Binoy Ravindran;Tom Martin
Affiliations:
-;-;-
Venue:
WSTFES '03 Proceedings of the IEEE Workshop on Software Technologies for Future Embedded Systems
Year:
2003

Citing 0
Cited 7

Toward mobile phone Linux

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
CPU scheduling for statistically-assured real-time performance and improved energy efficiency

Proceedings of the 2nd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Energy-efficient, utility accrual scheduling under resource constraints for mobile embedded systems

Proceedings of the 4th ACM international conference on Embedded software
Energy-Efficient, Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model

Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Energy-efficient, utility accrual scheduling under resource constraints for mobile embedded systems

ACM Transactions on Embedded Computing Systems (TECS)
Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model with Energy Bounds

IEEE Transactions on Computers
An integrated environment for embedded hard real-time systems scheduling with timing and energy constraints

PATMOS'05 Proceedings of the 15th international conference on Integrated Circuit and System Design: power and Timing Modeling, Optimization and Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a power-aware, best-effort real-time task scheduling algorithm calledPA-BTA that optimizes real-time performance andpower consumption. The algorithm considers atimeliness model where task timing constraints aredescribed using Jensen's benefit functions and asystem-level power model. We propose a metric called "Energy and Real-Time PerformanceGrade" (ERG) to measure real-time performanceand power consumption in a unified way. Since thescheduling problem is NP-hard, PA-BTA heuristically computes schedules to maximize ERG, incurring a worst-case computational cost of O(n2).Our simulation results indicate that the algorithmperforms close to the optimal algorithm and betterthan other algorithms considered in the study.