Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

An Exact Stochastic Analysis Method for Priority-driven Real-time Systems

우선순위 스케줄링을 사용하는 실시간 시스템을 위한 정확한 확률적 분석 방법

  • 김강희 (서울대학교 전기컴퓨터공학부)
  • Published : 2004.04.01
Download PDF
⟨ Previous Next ⟩

Abstract

Recently, for real-time applications such as multimedia and signal processing, it becomes increasingly important to provide a probabilistic guarantee that each task in the application meets its deadline with a given probability. To provide the probabilistic guarantee, an analysis method is needed that can accurately predict the deadline miss probability for each task in a given system. This paper proposes a stochastic analysis method for real-time systems that use priority-driven scheduling, such as Rate Monotonic and Earliest Deadline First, in order to accurately compute the deadline miss probability of each task in the system. The proposed method accurately computes the response time distributions for tasks with arbitrary execution time distributions, and thus makes it possible to determine the deadline miss probability of individual tasks. In the paper. through experiments, we show that the proposed method is highly accurate and outperforms exisiting methods proposed in the literature.

최근 멀티미디어, 신호처리와 같은 실시간 응용들에 대해서 그 응용에 속한 태스크들이 일정한 확률로 마감시간을 만족하는 것을 보장하는, 소위 확률적 보장을 제공하는 것이 점점 더 중요해지고 있다. 확률적 보장을 제공하기 위해서는 주어진 시스템에서 각 태스크의 마감시간 위반확률(deadline miss probability)을 예측할 수 있는 분석 방법이 필요하다. 본 논문에서는 Rate Monotonic 또는 Earliest Deadline First와 같은 우선순위 스케줄링을 사용하는 시스템에서 각 태스크의 마감시간 위반확률을 정확하게 계산하는 분석 방법을 제안한다. 제안하는 분석 방법은 임의의 실행 시간 분포를 갖는 태스크들에 대해서 각각의 응답 시간 분포를 정확하게 계산함으로써 개별 태스크들의 마감시간 위반확률을 결정한다. 본 논문에서는 실험을 통해서 제안하는 분석 방법의 정확성을 검증하였고, 기존의 다른 분석 방법보다 우수함을 보였다.

Keywords

References

  1. L. Liu and J Layland, 'Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,' Journal of ACM, vol. 20, no. 1, pp. 46-61, 1973 https://doi.org/10.1145/321738.321743
  2. J. P. Lehoczky, L. Sha, and Y. Ding, 'The Rate-Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior,' in Proceedings of the 10th IEEE Real-Time Systems Symposium, pp. 166-171, Dec. 1989 https://doi.org/10.1109/REAL.1989.63567
  3. J. P. Lehoczky, 'Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,' in Proceedings of the 11th IEEE Real-Time Systems Symposium, pp. 201-209, Dec. 1990 https://doi.org/10.1109/REAL.1990.128748
  4. 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,' in Proceedings of the Real-Time Technology and Applications Symposium, Chicago, Illinois, pp. 164-173, May 1995 https://doi.org/10.1109/RTTAS.1995.516213
  5. M. K. Gardner and J. W. Liu, 'Analyzing Stochastic Fixed-Priority Real-Time Systems,' in Proceedings of the 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 44-58, Mar. 1999
  6. M. K. Gardner, 'Probabilistic Analysis and Scheduling of Critical Soft Real-Time Systems,' Ph.D. dissertation, School of Computer Science, University of Illinois, Urbana-Champaign, 1999
  7. J. P. Lehoczky, 'Real-Time Queueing Theory,' in Proceedings of the 17th IEEE Real-Time Systems Symposium, pp. 186-195, Dec. 1996 https://doi.org/10.1109/REAL.1996.563715
  8. J. P. Lehoczky, 'Real-Time Queueing Network Theory,' in Proceedings of the 18th IEEE Real-Time Systems Symposium, pp. 58-67, Dec. 1997 https://doi.org/10.1109/REAL.1997.641269
  9. S. Manolache, P. Eles, and Z. Peng, 'Memory and Time-Efficient Schedulability Analysis of Task Sets with Stochastic Execution Times,' in Proceedings of the 13th Euromicro Conference on Real-Time Systems, pp. 19-26, Jun. 2001 https://doi.org/10.1109/EMRTS.2001.933991
  10. L. Abeni and G. Buttazzo, 'Stochastic Analysis of a Reservation Based System,' in Proceedings of the 9th International Workshop on Parallel and Distributed Real-Time Systems, Apr. 2001
  11. A. K. Atlas and A. Bestavros, 'Statistical Rate Monotonic Scheduling,' in Proceedings of the 19th IEEE Real-Time Systems Symposium, pp, 123-132, Dec. 1998 https://doi.org/10.1109/REAL.1998.739737
  12. 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 https://doi.org/10.1016/0166-5316(82)90024-4
  13. A. Terrasa and G. Bernat, 'Extracting Temporal Properties from Real-Time Systems by Automatic Tracing Analysis,', in Proceedings of the 9th International Conference on Real-Time and Embedded Computing Systems and Applications, Feb. 2003
  14. J. W. S. Liu, Real-Time Systems, Prentice Hall, 2000
  15. L. Kleinrock, Queueing Systems Volume I; Theory, John Wiley and Sons, Inc., 1975
  16. J. L. Diaz, D. F. Garcia, K. Kim, C.-G. Lee, L. L. Bello, J. M. Lopez, S. L. Min, and O. Mirabella, 'Stochastic Analysis of Periodic Real-Time Systems,' in Proceedings of the 23rd Real-Time Systems Symposium, pp. 289-300. Dec. 2002 https://doi.org/10.1109/REAL.2002.1181583
  17. Intel, 'Intel Math Kernel Library: Reference Manual,' 2001, http://developers.intel.com/software/products/mkl