Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Energy-Aware Task Allocation for Rate Monotonic Scheduling Tarek A. AlEnawy and Hakan Aydin
 

Summary: 1
Energy-Aware Task Allocation for Rate Monotonic Scheduling
Tarek A. AlEnawy and Hakan Aydin
Computer Science Department
George Mason University
Fairfax, VA 22030
{thassan1,aydin}@cs.gmu.edu
Abstract
We consider the problem of energy minimization for
periodic preemptive hard real-time tasks that are scheduled on
an identical multiprocessor platform with dynamic voltage
scaling capability. We adopt partitioned scheduling and assume
that the tasks are assigned rate-monotonic priorities. We show
that the problem is NP-Hard in the strong sense on m 2
processors even when the feasibility is guaranteed a priori.
Because of the intractability of the problem, we propose an
integrated approach that consists of three different components:
RMS admission control test, the partitioning heuristic and the
speed assignment algorithm. We discuss possible options for
each component by considering state-of-the-art solutions. Then,

  

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

 

Collections: Computer Technologies and Information Sciences; Engineering