The Community for Technology Leaders
Green Image
Issue No. 05 - May (2009 vol. 58)
ISSN: 0018-9340
pp: 634-647
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.
Real-time and embedded systems, scheduling, stochastic analysis, worst case analysis, periodic task model.

C. Lee and K. Kim, "A Safe Stochastic Analysis with Relaxed Limitations on the Periodic Task Model," in IEEE Transactions on Computers, vol. 58, no. , pp. 634-647, 2008.
97 ms
(Ver 3.3 (11022016))