Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Energy-Constrained Scheduling for Weakly-Hard Real-Time Systems Tarek A. AlEnawy and Hakan Aydin
 

Summary: Energy-Constrained Scheduling for Weakly-Hard Real-Time Systems
Tarek A. AlEnawy and Hakan Aydin
Computer Science Department
George Mason University
Fairfax, VA 22030
{thassan1,aydin}@cs.gmu.edu
Abstract
In this paper, we explore performance optimization problems
for real-time systems that have to rely on a fixed energy budget
during an operation/mission. We adopt the weakly-hard real-
time scheduling paradigm to ensure a predictable performance
for all the tasks: Our aim is to minimize the number of dynamic
failures (in terms of (m,k)-firm deadline constraints) while
remaining within the energy budget. We prove that this problem
is NP-Hard in the strong sense even for an ideal DVS
architecture with continuous speed spectrum. We propose
techniques to statically compute the speed of the CPU in order
to meet the (m,k)-firm deadline constraints. We present on-line
speed adjustment algorithms to exploit the slack time of skipped
and completed jobs. Through extensive simulations, we show

  

Source: Aydin, Hakan - Department of Computer Science, George Mason University

 

Collections: Computer Technologies and Information Sciences; Engineering