This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Safe Stochastic Analysis with Relaxed Limitations on the Periodic Task Model
May 2009 (vol. 58 no. 5)
pp. 634-647
ASCII Text
x 
 
Kanghee Kim, Chang-Gun Lee, "A Safe Stochastic Analysis with Relaxed Limitations on the Periodic Task Model," IEEE Transactions on Computers, vol. 58, no. 5, pp. 634-647, May, 2009.
 
 
BibTex
x
 
@article{ 10.1109/TC.2008.208,
author = {Kanghee Kim and Chang-Gun Lee},
title = {A Safe Stochastic Analysis with Relaxed Limitations on the Periodic Task Model},
journal ={IEEE Transactions on Computers},
volume = {58},
number = {5},
issn = {0018-9340},
year = {2009},
pages = {634-647},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2008.208},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - A Safe Stochastic Analysis with Relaxed Limitations on the Periodic Task Model
IS - 5
SN - 0018-9340
SP634
EP647
EPD - 634-647
A1 - Kanghee Kim,
A1 - Chang-Gun Lee,
PY - 2009
KW - Real-time and embedded systems
KW - scheduling
KW - stochastic analysis
KW - worst case analysis
KW - periodic task model.
VL - 58
JA - IEEE Transactions on Computers
ER -
 
Kanghee Kim, Samsung Electronics Co. Ltd., Suwon
Chang-Gun Lee, Seoul National University, Seoul
This paper proposes a safe stochastic analysis for fixed-priority scheduling, which is applicable to a broader spectrum of periodic tasks than the ones analyzable by any of the existing techniques. The proposed analysis can find a safe upper-bound of deadline miss probability for periodic tasks with 1) arbitrary execution time distributions, 2) varying interrelease times with the period as the minimum, and 3) the maximum utilization factor U^{max} that can be greater than 1. One challenge for this is that the release times of tasks are not known a priori because we are not limiting the interrelease times of each task to a constant, i.e., the period. In such a situation, the relative phases of task instances at run time can be arbitrary. Thus, we need to consider all possible phase combinations among jobs to find the worst case deadline miss probability, which is not tractable. To handle this difficulty, we first derive the worst case phase combination for harmonic task sets. Then, we present a safe way to transform a nonharmonic task set to a harmonic task set such that the deadline miss probabilities obtained with the worst case phase combination for the transformed harmonic task set are guaranteed to be worse than those for the original nonharmonic task set with all possible phase combinations. Therefore, the worst case deadline miss probabilities of the transformed harmonic tasks can be used as safe upper-bounds of deadline miss probabilities of the original nonharmonic tasks. Through experiments, we show that the safe upper-bound computed by the proposed analysis is tight enough for practical uses.

[1] L. Abeni and G. Buttazzo, “Stochastic Analysis of a Reservation Based System,” Proc. Ninth Int'l Workshop Parallel and Distributed Real-Time Systems (WPDRTS '01), Apr. 2001.
[2] G. Bernat, A. Colin, and S. Petters, “WCET Analysis of Probabilistic Hard Real-Time Systems,” Proc. 23rd IEEE Real-Time Systems Symp. (RTSS '02), Dec. 2002.
[3] A. Burchard, J. Liebeherr, Y. Oh, and S.H. Son, “New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems,” IEEE Trans. Computers, vol. 44, no. 12, pp. 1429-1442, Dec. 1996.
[4] A. Cervin, “Integrated Control and Real-Time Scheduling,” PhD thesis, Lund Inst. of Tech nology, 2003.
[5] J.L. Díaz, J.M. López, M. García, A.M. Campos, K. Kim, and L. LoBello, “Pessimism in the Stochastic Analysis of Real-Time Systems: Concept and Applications,” Proc. 25th IEEE Real-Time Systems Symp. (RTSS '04), Dec. 2004.
[6] M.K. Gardner, “Probabilistic Analysis and Scheduling of Critical Soft Real-Time Systems,” PhD thesis, School of Computer Science, Univ. of Illi nois, 1999.
[7] C.-C. Han and H.-Y. Tyan, “A Better Polynomial-Time Schedulability Test for Real-Time Fixed-Priority Scheduling Algorithms,” Proc. 18th IEEE Real-Time Systems Symp. (RTSS '97), Dec. 1997.
[8] K. Kim, J.L. Díaz, L. LoBello, J.M. López, C.-G. Lee, and S.L. Min, “An Exact Stochastic Analysis of Priority-Driven Periodic Real-Time Systems and Its Approximations,” IEEE Trans. Computers, vol. 54, no. 11, pp. 1460-1466, Nov. 2005.
[9] J.F.C. Kingman, “Inequalities in the Theory of Queues,” J. Royal Statistical Soc., Series B, vol. 32, pp. 102-110, 1970.
[10] C.-G. Lee, L. Sha, and A. Peddi, “Enhanced Utilization Bounds for QoS Management,” IEEE Trans. Computers, vol. 53, no. 2, pp. 187-200, Feb. 2004.
[11] J.P. Lehoczky, “Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,” Proc. 11th IEEE Real-Time Systems Symp. (RTSS '90), pp. 201-209, Dec. 1990.
[12] J.P. Lehoczky, “Real-Time Queueing Theory,” Proc. 17th IEEE Real-Time Systems Symp. (RTSS '96), pp. 186-195, Dec. 1996.
[13] J.P. Lehoczky, “Real-Time Queueing Network Theory,” Proc. 18th IEEE Real-Time Systems Symp. (RTSS '97), pp. 58-67, Dec. 1997.
[14] J.P. Lehoczky, L. Sha, and Y. Ding, “The Rate-Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior,” Proc. 10th IEEE Real-Time Systems Symp. (RTSS '89), Dec. 1989.
[15] A. Leulseged and N. Nissanke, “Probabilistic Analysis of Multi-Processor Scheduling of Tasks with Uncertain Parameter,” Proc. Ninth Int'l Conf. Real-Time and Embedded Computing Systems and Applications (RTCSA '03), Feb. 2003.
[16] J. Leung and J. Whitehead, “On the Complexity of Fixed Priority Scheduling of Periodic Real-Time Tasks,” Performance Evaluation, vol. 2, no. 4, pp. 237-250, 1982.
[17] L. Liu and J. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 46-61, 1973.
[18] S. Manolache, P. Eles, and Z. Peng, “Memory and Time-Efficient Schedulability Analysis of Task Sets with Stochastic Execution Times,” Proc. 13th Euromicro Conf. Real-Time Systems (ECRTS '01), pp. 19-26, June 2001.
[19] M.-Y. Nam, C.-G. Lee, K. Kim, and M. Caccamo, “Time-Parameterized Sensing Task Model for Real-Time Tracking,” Proc. 26th IEEE Real-Time Systems Symp. (RTSS '05), pp. 245-255, Dec. 2005.
[20] K.M. Obenland, POSIX in Real-Time, http://www.xtrj.org/collectionposix_rtos.htm , 2001.
[21] A. Terrasa and G. Bernat, “Extracting Temporal Properties from Real-Time Systems by Automatic Tracing Analysis,” Proc. Ninth Int'l Conf. Real-Time and Embedded Computing Systems and Applications (RTCSA '03), Feb. 2003.
[22] T.-S. Tia, Z. Deng, M. Shankar, M. Storch, J. Sun, L.-C. Wu, and J.-S. Liu, “Probabilistic Performance Guarantee for Real-Time Tasks with Varying Computation Times,” Proc. Real-Time Technology and Applications Symp. (RTAS '95), pp. 164-173, May 1995.
[23] W. Yuan and K. Nahrstedt, “Energy-Efficient Soft Real-Time CPU Scheduling for Mobile Multimedia Systems,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), pp. 149-163, Oct. 2003.

Index Terms:
Real-time and embedded systems, scheduling, stochastic analysis, worst case analysis, periodic task model.
Citation:
Kanghee Kim, Chang-Gun Lee, "A Safe Stochastic Analysis with Relaxed Limitations on the Periodic Task Model," IEEE Transactions on Computers, vol. 58, no. 5, pp. 634-647, May 2009, doi:10.1109/TC.2008.208
Usage of this product signifies your acceptance of the Terms of Use.