Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model with Energy Bounds

In this paper, we consider timeliness and energy optimization in battery-powered dynamic embedded real-time systems, which must remain functional during an operation/mission with a bounded energy budget. We consider application activities that are subject to time/utility function time constraints, s...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on computers Ročník 56; číslo 10; s. 1358 - 1371
Hlavní autori: Haisang Wu, Ravindran, B., Jensen, E.D.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.10.2007
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Arrivals
Batteries
Behavior
Dynamic scheduling
Dynamical systems
Dynamics
Energy efficiency
energy-efficient scheduling
Job listing service
Mathematical analysis
Mathematical models
Real time systems
Scheduling
Studies
Time factors
time/utility functions
Utilities
utility accrual scheduling
Voltage control
ISSN:0018-9340, 1557-9956
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we consider timeliness and energy optimization in battery-powered dynamic embedded real-time systems, which must remain functional during an operation/mission with a bounded energy budget. We consider application activities that are subject to time/utility function time constraints, statistical assurance requirements on timeliness behavior, and an energy budget which cannot be exceeded at runtime. To account for the inevitable variability in activity arrivals in dynamic systems, we describe arrival behaviors using the unimodal arbitrary arrival model (UAM) [15]. For such a model, we present a dynamic voltage scaling (DVS)-based CPU scheduling algorithm called the energy-bounded utility accrual algorithm (EBUA). Since the scheduling problem is intractable, EBUA allocates CPU cycles, scales clock frequency, and heuristically computes schedules using statistical estimates of cycle demands in polynomial time. We analytically establish EBUA's properties, including satisfaction of energy bounds, statistical assurances on individual activity timeliness behavior, optimal timeliness during underloads, and bounded time for mutually exclusively accessing shared non-CPU resources. Our simulation experiments validate our analytical results and illustrate the algorithm's effectiveness and superiority over past algorithms.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2007.1072