Preemption Control for Energy-Efficient Task Scheduling in Systems with a DVS Processor and Non-DVS Devices

Authors:
Chuan-Yue Yang;Jian-Jia Chen;Tei-Wei Kuo
Affiliations:
National Taiwan University, Taipei, Taiwan;National Taiwan University, Taipei, Taiwan;National Taiwan University, Taipei, Taiwan
Venue:
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2007

Citing 0
Cited 5

Energy reduction techniques for systems with non-DVS components

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Energy-Efficient Considerations on a Variable-Bitrate PCI-Express Device

Journal of Signal Processing Systems
Energy-efficiency on a variable-bitrate device

EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
Dynamic counters and the efficient and effective online power management of embedded real-time systems

CODES+ISSS '11 Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Speed scaling problems with memory/cache consideration

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In reality, peripheral devices often make a significant contribution to the power consumption of the entire system. An effective energy-efficient scheduling algorithm should consider not only the energy consumption of the processor but also the usages of devices. In this paper, we explore energyefficient scheduling of periodic real-time tasks in a system with a dynamic-voltage-scaling (DVS) processor and multiple non- DVS system devices. We consider systems that any device used by a task remains operating while the task is active. We propose scheduling algorithms in the management of task preemption to reduce the energy consumption of devices. Simulation results show that our proposed algorithms could not only reduce the number of task preemption significantly but also minimize the energy consumption, compared to earliest-deadlinefirst scheduling.