skip to main content
research-article

Weakly Hard Schedulability Analysis for Fixed Priority Scheduling of Periodic Real-Time Tasks

Published:27 September 2017Publication History
Skip Abstract Section

Abstract

The hard deadline model is very popular in real-time research, but is representative or applicable to a small number of systems. Many applications, including control systems, are capable of tolerating occasional deadline misses, but are seriously compromised by a repeating pattern of late terminations. The weakly hard real-time model tries to capture these requirements by analyzing the conditions that guarantee that a maximum number of deadlines can be possibly missed in any set of consecutive activations. We provide a new weakly hard schedulability analysis method that applies to constrained-deadline periodic real-time systems scheduled with fixed priority and without knowledge of the task activation offsets. The analysis is based on a Mixed Integer Linear Programming (MILP) problem formulation; it is very general and can be adapted to include the consideration of resource sharing and activation jitter. A set of experiments conducted on an automotive engine control application and randomly generated tasksets show the applicability and accuracy of the proposed technique.

References

  1. Zaid Al-bayati, Youcheng Sun, Haibo Zeng, Marco Di Natale, Qi Zhu, and Brett Meyer. 2015. Task placement and selection of data consistency mechanisms for real-time multicore applications. In 21st IEEE Real-Time and Embedded Technology and Applications Symposium. 172--181.Google ScholarGoogle Scholar
  2. Amir Aminifar, Petru Eles, Zebo Peng, and Anton Cervin. 2013. Control-quality driven design of cyber-physical systems with robustness guarantees. In Proceedings of the Conference on Design, Automation and Test in Europe. EDA Consortium, 1093--1098. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Amir Aminifar, Soheil Samii, Petru Eles, Zebo Peng, and Anton Cervin. 2012. Designing high-quality embedded control systems with guaranteed stability. In Real-Time Systems Symposium (RTSS), 2012 IEEE 33rd. 283--292. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Karl-Erik Årzén, Anton Cervin, Johan Eker, and Lui Sha. 2000. An introduction to control and scheduling co-design. In Decision and Control, 2000. Proceedings of the 39th IEEE Conference on, Vol. 5. 4865--4870.Google ScholarGoogle ScholarCross RefCross Ref
  5. Sanjoy Baruah and Alan Burns. 2006. Sustainable scheduling analysis. In 27th IEEE International Real-Time Systems Symposium (RTSS). 159--168. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Guillem Bernat, Alan Burns, and Albert Liamosi. 2001. Weakly hard real-time systems. Computers, IEEE Transactions on 50, 4 (2001), 308--321. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Enrico Bini, Marco Di Natale, and Giorgio Buttazzo. 2008. Sensitivity analysis for fixed-priority real-time systems. Real-Time Systems 39, 1--3 (2008), 5--30. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Alessandro Biondi, Marco Di Natale, Youcheng Sun, and Stefania Botta. 2016. Moving from Single-core to Multicore: Initial Findings on a Fuel Injection Case Study. Technical Report. SAE Technical Paper.Google ScholarGoogle Scholar
  9. Reinder J. Bril, Johan J. Lukkien, and Rudolf H. Mak. 2013. Best-case response times and jitter analysis of real-time tasks with arbitrary deadlines. In Proceedings of the 21st International Conference on Real-Time Networks and Systems. ACM, 193--202. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Tobias Bund and Frank Slomka. 2014. Controller/platform co-design of networked control systems based on density functions. In Proceedings of the 4th ACM SIGBED International Workshop on Design, Modeling, and Evaluation of Cyber-Physical Systems. 11--14. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Tobias Bund and Frank Slomka. 2015. Worst-case performance validation of safety-critical control systems with dropped samples. In Proceedings of the 23rd International Conference on Real Time and Networks Systems. 319--326. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Giorgio Buttazzo. 2011. Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications. Vol. 24. Springer Science 8 Business Media. Google ScholarGoogle Scholar
  13. Robert I. Davis, Ken W. Tindell, and Alan Burns. 1993. Scheduling slack time in fixed priority pre-emptive systems. In Real-Time Systems Symposium. Proceedings. IEEE, 222--231.Google ScholarGoogle Scholar
  14. José Luis Díaz, Daniel F. García, Kanghee Kim, Chang-Gun Lee, L. Lo Bello, José María López, Sang Lyul Min, and Orazio Mirabella. 2002. Stochastic analysis of periodic real-time systems. In Real-Time Systems Symposium. RTSS. 23rd IEEE. IEEE, 289--300. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Paul Emberson, Roger Stafford, and Robert I. Davis. 2010. Techniques for the synthesis of multiprocessor tasksets. In Proceedings 1st International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS). 6--11.Google ScholarGoogle Scholar
  16. Goran Frehse, Arne Hamann, Sophie Quinton, and Matthias Woehrle. 2014. Formal analysis of timing effects on closed-loop properties of control software. In Real-Time Systems Symposium (RTSS), 2014 IEEE. 53--62.Google ScholarGoogle ScholarCross RefCross Ref
  17. Dip Goswami, Reinhard Schneider, and Samarjit Chakraborty. 2011. Co-design of cyber-physical systems via controllers with flexible delay constraints. In Proceedings of the 16th Asia and South Pacific Design Automation Conference. IEEE Press, 225--230. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Zain A. H. Hammadeh, Sophie Quinton, and Rolf Ernst. 2014. Extending typical worst-case analysis using response-time dependencies to bound deadline misses. In Proceedings of the 14th International Conference on Embedded Software. ACM, 10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Jung-Eun Kim, Tarek F. Abdelzaher, and Lui Sha. 2015. Budgeted generalized rate monotonic analysis for the partitioned, yet globally scheduled uniprocessor model. In 21st IEEE Real-Time and Embedded Technology and Applications Symposium, Seattle, WA, USA, April 13-16, 2015. 221--231.Google ScholarGoogle ScholarCross RefCross Ref
  20. Pranaw Kumar and Lothar Thiele. 2012. Quantifying the effect of rare timing events with settling-time and overshoot. In Real-Time Systems Symposium (RTSS), 2012 IEEE 33rd. 149--160. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. John P. Lehoczky. 1990. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In RTSS, Vol. 90. 201--209.Google ScholarGoogle Scholar
  22. Joseph Y.-T. Leung and Jennifer Whitehead. 1982. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2, 4 (1982), 237--250.Google ScholarGoogle Scholar
  23. Chung Laung Liu and James W Layland. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM (JACM) 20, 1 (1973), 46--61. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. M. M Hamdaoui and P. Ramanathan. 1995. A dynamic priority assignment technique for streams with (m, k)-firm deadlines. In IEEE Transactions on Computers. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Sophie Quinton, Matthias Hanke, and Rolf Ernst. 2012. Formal analysis of sporadic overload in real-time systems. In Proceedings of the Conference on Design, Automation and Test in Europe. EDA Consortium, 515--520. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Parameswaran Ramanathan. 1999. Overload management in real-time control applications using (m, k)-firm guarantee. IEEE Transactions on Parallel and Distributed Systems 10, 6 (1999), 549--559. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Ola Redell and Martin Sanfridson. 2002. Exact best-case response time analysis of fixed priority scheduled tasks. In Real-Time Systems, 2002. Proceedings. 14th Euromicro Conference on. IEEE, 165--172. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Lui Sha, Tarek Abdelzaher, Karl-Erik Årzén, Anton Cervin, Theodore Baker, Alan Burns, Giorgio Buttazzo, Marco Caccamo, John Lehoczky, and Aloysius K. Mok. 2004. Real time scheduling theory: A historical perspective. Real-time Systems 28, 2--3 (2004), 101--155. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Lui Sha, Ragunathan Rajkumar, and John P. Lehoczky. 1990. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers 39, 9 (1990), 1175--1185. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Damoon Soudbakhsh, Linh T. X. Phan, Anuradha M. Annaswamy, and Oleg Sokolsky. 2016. Co-design of arbitrated network control systems with overrun strategies. IEEE Transactions on Control of Network Systems (2016).Google ScholarGoogle Scholar
  31. Damoon Soudbakhsh, Linh T. X. Phan, Oleg Sokolsky, Insup Lee, and Anuradha Annaswamy. 2013. Co-design of control and platform with dropped signals. In Cyber-Physical Systems (ICCPS), 2013 ACM/IEEE International Conference on. 129--140. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Alexander Wieder and Björn B. Brandenburg. 2013. Efficient partitioning of sporadic real-time tasks with shared resources and spin locks. In Industrial Embedded Systems (SIES), 2013 8th IEEE International Symposium on. 49--58.Google ScholarGoogle Scholar
  33. Wenbo Xu, Zain AH Hammadeh, Alexander Kroller, Rolf Ernst, and Sophie Quinton. 2015. Improved deadline miss models for real-time systems using typical worst-case analysis. In Real-Time Systems (ECRTS), 2015 27th Euromicro Conference on. IEEE, 247--256. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Yang Xu, Karl-Erik Årzén, Enrico Bini, and Anton Cervin. 2014. Response time driven design of control systems. IFAC Proceedings Volumes 47, 3 (2014), 6098--6104.Google ScholarGoogle ScholarCross RefCross Ref
  35. Yang Xu, Karl-Erik Årzén, Anton Cervin, Enrico Bini, and Bogdan Tanasa. 2015. Exploiting job response-time information in the co-design of real-time control systems. In Embedded and Real-Time Computing Systems and Applications (RTCSA), 2015 IEEE 21st International Conference on. 247--256. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Weakly Hard Schedulability Analysis for Fixed Priority Scheduling of Periodic Real-Time Tasks

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!