loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Second International Workshop on Real-Time Computing Systems and Applications (RTCSA'95)
A soft aperiodic task scheduling algorithm in dynamic-priority systems
Tokyo, Japan
October 25-October 27
ISBN: 0-8186-7106-8
ASCII Text
x 
 
Sungyoung Lee, Hyungill Kim, Jongwon Lee, "A soft aperiodic task scheduling algorithm in dynamic-priority systems," Real-Time Computing Systems and Applications, International Workshop on, pp. 68, Second International Workshop on Real-Time Computing Systems and Applications (RTCSA'95), 1995.
 
 
BibTex
x
 
@article{ 10.1109/RTCSA.1995.528753,
author = {Sungyoung Lee and Hyungill Kim and Jongwon Lee},
title = {A soft aperiodic task scheduling algorithm in dynamic-priority systems},
journal ={Real-Time Computing Systems and Applications, International Workshop on},
volume = {0},
year = {1995},
isbn = {0-8186-7106-8},
pages = {68},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.1995.528753},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time Computing Systems and Applications, International Workshop on
TI - A soft aperiodic task scheduling algorithm in dynamic-priority systems
SN - 0-8186-7106-8
SP
EP
A1 - Sungyoung Lee,
A1 - Hyungill Kim,
A1 - Jongwon Lee,
PY - 1995
KW - computational complexity; processor scheduling; soft aperiodic task scheduling algorithm; dynamic-priority systems; joint scheduling; hard deadline periodic tasks; soft deadline aperiodic tasks; fixed-critical task indicating algorithm; deadlinewise preassignment table; computational complexity
VL - 0
JA - Real-Time Computing Systems and Applications, International Workshop on
ER -
 
Sungyoung Lee, Dept. of Comput. Eng., Kyung Hee Univ., Seoul, South Korea
Hyungill Kim, Dept. of Comput. Eng., Kyung Hee Univ., Seoul, South Korea
Jongwon Lee, Dept. of Comput. Eng., Kyung Hee Univ., Seoul, South Korea
In this paper, we present a joint scheduling of hard deadline periodic and soft deadline aperiodic tasks in dynamic-priority systems. The proposed algorithm has extended the fixed-critical task indicating (CTI) algorithm developed by the authors previously (1995). The dynamic-CTI algorithm is operated in such a way that dynamic-priority assignment strategy for a given periodic task set and the information on a deadlinewise preassignment table, called dynamic-CTI table, are mixed dynamically according to the aperiodic tasks' arrivals at runtime. The algorithm has a predictability and a less computational complexity in calculating the slacks since it uses the dynamic-CTI table. Our simulation study shows that the dynamic-CTI scheduling has better performance than the fixed-CTI algorithm which is even better than the slack stealing algorithms, especially under a heavy, transient overload.
Index Terms:
computational complexity; processor scheduling; soft aperiodic task scheduling algorithm; dynamic-priority systems; joint scheduling; hard deadline periodic tasks; soft deadline aperiodic tasks; fixed-critical task indicating algorithm; deadlinewise preassignment table; computational complexity
Citation:
Sungyoung Lee, Hyungill Kim, Jongwon Lee, "A soft aperiodic task scheduling algorithm in dynamic-priority systems," rtcsa, pp.68, Second International Workshop on Real-Time Computing Systems and Applications (RTCSA'95), 1995
Usage of this product signifies your acceptance of the Terms of Use.