Journal of information and communication convergence engineering

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Improved Schedulability Analysis of Real-Time Sporadic Tasks with EDF Preemptive Scheduling

  • Received : 2012.09.17
  • Accepted : 2012.10.29
  • Published : 2012.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper proposes an analysis method to check the schedulability of a set of sporadic tasks under earliest deadline first (EDF) scheduler. The sporadic task model consists of subtasks with precedence constraints, arbitrary arrival times and deadlines. In order to determine the schedulability, we present an approach to find exact worst case response time (WCRT) of subtatsks. With the technique presented in this paper, we exploit the precedence relations between subtasks in an accurate way while taking advantage of the deadline of different subtasks. Another nice feature of our approach is that it avoids calculation time overhead by exploiting the concept of deadline busy period. Experimental results show that this consideration leads to a significant improvement compared with existing work.

Keywords

References

  1. M. Spuri, "Analysis of deadline scheduled real-time systems," Institut National de Recherche en Informatique et en Automatique (INRIA), Le Chesnay, France, Report no. 2772, 2006.
  2. F. Zhang and A. Burns, "Schedulability analysis for real-time systems with EDF scheduling," IEEE Transactions on Computers, vol. 58, no. 9, pp. 1250-1258, 2009. https://doi.org/10.1109/TC.2009.58
  3. Y. Zhang, D. K. Krecker, C. Gill, C. Lu, and G. H. Thaker, "Practical schedulability analysis for generalized sporadic tasks in distributed real-time systems," in Proceedings of the Euromicro Conference on Real-Time Systems, Prague, Czech, pp. 223-232, 2008.
  4. H. X. Zhao, S. Midonnet, and L. George, "Worst case response time analysis of sporadic graph tasks with fixed priority scheduling on a uniprocessor," in Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, Hong Kong, China, pp. 23-29, 2005.
  5. H. X. Zhao, L. George, and S. Midonnet, "Worst case response time analysis of sporadic graph tasks with EDF scheduling on a uniprocessor," in Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, Sydney, Australia, pp. 271-278, 2006.
  6. M. G. Harbour, M. H. Klein, and J. P. Lehoczky, "Timing analysis for fixed-priority scheduling of hard real-time systems," IEEE Transactions on Software Engineering, vol. 20, no. 1, pp. 13-28, 1994. https://doi.org/10.1109/32.263752
  7. M. G. Harbour, M. H. Klein, and J. P. Lehoczky, "Fixed priority scheduling periodic tasks with varying execution priority," in Proceedings of the 12th Real-Time Systems Symposium, San Antonio: TX, pp. 116-128, 1991.
  8. J. C. Palencia and M. G. Harbour, "Offset-based response time analysis of distributed systems scheduled under EDF," in Proceedings of the 15th Euromicro Conference on Real-Time Systems, Porto, Portugal, pp. 3-12, 2002.
  9. C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard-real-time environment," Journal of the ACM, vol. 20, no. 1, pp. 46-61, 1973. https://doi.org/10.1145/321738.321743
  10. K. H. Kim and M. Naghibzadeh, "Prevention of task overruns in real-time non-preemptive multiprogramming systems," in Proceedings of the International Symposium on Computer Performance Modelling, Measurement and Evaluation, Toronto, Canada, pp. 267-276, 1980.
  11. L. Mangeruca, M. Baleani, A. Ferrari, and A. Sangiovanni- Vincentelli, "Uniprocessor scheduling under precedence constraints for embedded systems design," ACM Transactions on Embedded Computing Systems, vol. 7, no. 1, article no. 6, 2007.
  12. M. Spuri, "Holistic analysis for deadline scheduled real-time distributed systems," Institut National de Recherche en Informatique et en Automatique (INRIA), Le Chesnay, France, Report no. 2873, 1996.
  13. R. Pellizzoni and G. Lipari, "Improved schedulability analysis of real-time transactions with earliest deadline scheduling," in Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium, San Francisco: CA, pp. 66-75, 2005.
  14. J. C. Palencia and M. G. Harbour, "Exploiting precedence relations in the schedulability analysis of distributed real-time systems," in Proceedings of the 20th IEEE Real-Time Systems Symposium, Phoenix: AZ, pp. 328-339, 1999.
  15. J. C. Palencia and M. G. Harbour, "Schedulability analysis for tasks with static and dynamic offsets," in Proceedings of the 19th IEEE Real-Time Systems Symposium, Madrid, Spain, pp. 26-37, 1998.
  16. O. Redell, "Analysis of tree-shaped transactions in distributed real time systems," in Proceedings of the 16th Euromicro Conference on Real-Time Systems, Catania, Italy, pp. 239-248, 2004.
  17. K. Tindell, "Adding time-offsets to schedulability analysis," Department of Computer Science, University of York, England, 1994.