Energy-Efficient, Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model

We present an energy-efficient real-time scheduling algorithm called EUA*, for the unimodal arbitrary arrival model (or UAM). UAM embodies a "stronger" adversary than most arrival models. The algorithm considers application activities that are subject to time/utility function time constrai...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Design, Automation and Test in Europe S. 474 - 479
Hauptverfasser: Wu, Haisang, Ravindran, Binoy, Jensen, E. Douglas
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: Washington, DC, USA IEEE Computer Society 07.03.2005
IEEE
Schriftenreihe:ACM Conferences
Schlagworte:
Batteries
Central Processing Unit
Clocks
Computer systems organization > Embedded and cyber-physical systems
Computer systems organization > Real-time systems
Computing methodologies > Artificial intelligence > Search methodologies > Heuristic function construction
Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms
Control systems
Dynamic voltage scaling
Energy efficiency
Frequency estimation
General and reference > Cross-computing tools and techniques > Performance
Processor scheduling
Scheduling algorithm
Software and its engineering > Software organization and properties > Contextual software domains > Operating systems > Process management > Scheduling
Theory of computation > Design and analysis of algorithms
Time factors
ISBN:9780769522883, 0769522882
ISSN:1530-1591
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present an energy-efficient real-time scheduling algorithm called EUA*, for the unimodal arbitrary arrival model (or UAM). UAM embodies a "stronger" adversary than most arrival models. The algorithm considers application activities that are subject to time/utility function time constraints, UAM, and the multi-criteria scheduling objective of probabilistically satisfying utility lower bounds, and maximizing system-level energy efficiency. Since the scheduling problem is intractable, EUA* allocates CPU cycles, scales clock frequency, and heuristically computes schedules using statistical estimates of cycle demands, in polynomial-time. We establish that EUA* achieves optimal timeliness during under-loads, and identify the conditions under which timeliness assurances hold. Our simulation experiments illustrate EUA*'s superiority.
Bibliographie:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9780769522883
0769522882
ISSN:1530-1591
DOI:10.1109/DATE.2005.139