File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Dynamic Alteration Schemes of Real-Time Schedules for I/O Device Energy Efficiency

Author(s)
Seo, EuiseongKim, SangwonPark, SeonyeongLee, Joonwon
Issued Date
2010-12
DOI
10.1145/1880050.1880059
URI
https://scholarworks.unist.ac.kr/handle/201301/3232
Fulltext
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=78751529283
Citation
ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, v.10, no.2
Abstract
Many I/O devices provide multiple power states known as the dynamic power management (DPM) feature. However, activating from sleep state requires significant transition time and this obstructs utilizing DPM in nonpreemptive real-time systems. This article suggests nonpreemptive real-time task scheduling schemes maximizing the effectiveness of the I/O device DPM support. First, we introduce a runtime schedulability check algorithm for nonpreemptive real-time systems that can check whether a modification from a valid schedule is still valid. By using this, we suggest three heuristic algorithms. The first algorithm reorders the execution sequence of tasks according to the similarity of their required device sets. The second one gathers dispersed short idle periods into one long idle period to extend sleeping state of I/O devices and the last one inserts an idle period between two consecutively scheduled tasks to prepare the required devices of a task right before the starting time of the task. The suggested schemes were evaluated for both the real-world task sets and the hypothetical task sets with simulation and the results showed that the suggested algorithms produced better energy efficiency than the existing comparative algorithms.
Publisher
ASSOC COMPUTING MACHINERY
ISSN
1539-9087

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.