Document Open Access Logo

On the Pitfalls of Resource Augmentation Factors and Utilization Bounds in Real-Time Scheduling

Authors Jian-Jia Chen, Georg von der Brüggen, Wen-Hung Huang, Robert I. Davis

PDF
Thumbnail PDF

File

LIPIcs.ECRTS.2017.9.pdf
  • Filesize: 0.98 MB
  • 25 pages

Document Identifiers

Author Details

Jian-Jia Chen
Georg von der Brüggen
Wen-Hung Huang
Robert I. Davis

Cite As Get BibTex

Jian-Jia Chen, Georg von der Brüggen, Wen-Hung Huang, and Robert I. Davis. On the Pitfalls of Resource Augmentation Factors and Utilization Bounds in Real-Time Scheduling. In 29th Euromicro Conference on Real-Time Systems (ECRTS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 76, pp. 9:1-9:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/LIPIcs.ECRTS.2017.9

Abstract

In this paper, we take a careful look at speedup factors, utilization bounds, and capacity augmentation bounds. These three metrics have been widely adopted in real-time scheduling research as the de facto standard theoretical tools for assessing scheduling algorithms and schedulability tests. Despite that, it is not always clear how researchers and designers should interpret or use these metrics. In studying this area, we found a number of surprising results, and related to them, ways in which the metrics may be misinterpreted or misunderstood. In this paper, we provide a perspective on the use of these metrics, guiding  researchers on their meaning and interpretation, and helping to avoid pitfalls in their use. Finally, we propose and demonstrate the use of parametric augmentation functions as a means of providing nuanced information that may be more relevant in practical settings.

Subject Classification

Keywords
  • Real-time systems
  • speedup factors
  • utilization bounds
  • capacity augmentation bounds

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Tarek F. Abdelzaher, Vivek Sharma, and Chenyang Lu. A utilization bound for aperiodic tasks and priority driven scheduling. IEEE Trans. Computers, 53(3):334-350, 2004. URL: http://dx.doi.org/10.1109/TC.2004.1261839.
  2. Björn Andersson, Sanjoy K. Baruah, and Jan Jonsson. Static-priority scheduling on multiprocessors. In Real-Time Systems Symposium (RTSS), pages 193-202, 2001. URL: http://dx.doi.org/10.1109/REAL.2001.990610.
  3. Björn Andersson and Arvind Easwaran. Provably good multiprocessor scheduling with resource sharing. Real-Time Systems, 46(2):153-159, 2010. URL: http://dx.doi.org/10.1007/s11241-010-9105-6.
  4. Björn Andersson and Gurulingesh Raravi. Real-time scheduling with resource sharing on heterogeneous multiprocessors. Real-Time Systems, 50(2):270-314, 2014. URL: http://dx.doi.org/10.1007/s11241-013-9195-z.
  5. Björn Andersson and Eduardo Tovar. The utilization bound of non-preemptive rate-monotonic scheduling in controller area networks is 25%. In IEEE Fourth International Symposium on Industrial Embedded Systems - SIES, pages 11-18, 2009. URL: http://dx.doi.org/10.1109/SIES.2009.5196186.
  6. N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. J. Wellings. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, 8(5):284-292, 1993. URL: http://dx.doi.org/10.1049/sej.1993.0034.
  7. Neil C. Audsley. On priority assignment in fixed priority scheduling. Information Processing Letters, 79(1):39-44, May 2001. URL: http://dx.doi.org/10.1016/S0020-0190(00)00165-4.
  8. Sanjoy Baruah. The federated scheduling of constrained-deadline sporadic DAG task systems. In Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, DATE, pages 1323-1328, 2015. URL: http://dx.doi.org/10.7873/DATE.2015.0200.
  9. Sanjoy Baruah. Federated scheduling of sporadic DAG task systems. In IEEE International Parallel and Distributed Processing Symposium, IPDPS, pages 179-186, 2015. URL: http://dx.doi.org/10.1109/IPDPS.2015.33.
  10. Sanjoy Baruah. The federated scheduling of systems of conditional sporadic DAG tasks. In Proceedings of the 15th International Conference on Embedded Software (EMSOFT), 2015. URL: http://dx.doi.org/10.1109/EMSOFT.2015.7318254.
  11. Sanjoy Baruah. Schedulability analysis for a general model of mixed-criticality recurrent real-time tasks. In IEEE Real-Time Systems Symposium, RTSS, pages 25-34, 2016. URL: http://dx.doi.org/10.1109/RTSS.2016.012.
  12. Sanjoy Baruah. Schedulability analysis of mixed-criticality systems with multiple frequency specifications. In International Conference on Embedded Software, EMSOFT, pages 24:1-24:10, 2016. URL: http://dx.doi.org/10.1145/2968478.2968488.
  13. Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster, and Leen Stougie. The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems. In 24th Euromicro Conference on Real-Time Systems, ECRTS, pages 145-154, 2012. URL: http://dx.doi.org/10.1109/ECRTS.2012.42.
  14. Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster, and Leen Stougie. Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems. J. ACM, 62(2):14:1-14:33, 2015. URL: http://dx.doi.org/10.1145/2699435.
  15. Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, and Sebastian Stiller. Implementation of a speedup-optimal global EDF schedulability test. In 21st Euromicro Conference on Real-Time Systems, ECRTS, pages 259-268, 2009. URL: http://dx.doi.org/10.1109/ECRTS.2009.31.
  16. Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, and Sebastian Stiller. Improved multiprocessor global schedulability analysis. Real-Time Systems, 46(1):3-24, 2010. URL: http://dx.doi.org/10.1007/s11241-010-9096-3.
  17. Sanjoy K. Baruah and Nathan Fisher. The partitioned multiprocessor scheduling of sporadic task systems. In RTSS, pages 321-329, 2005. URL: http://dx.doi.org/10.1109/RTSS.2005.40.
  18. Sanjoy K. Baruah and Nathan Fisher. The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems. IEEE Trans. Computers, 55(7):918-923, 2006. URL: http://dx.doi.org/10.1109/TC.2006.113.
  19. Sanjoy K. Baruah and Nathan Wayne Fisher. The partitioned dynamic-priority scheduling of sporadic task systems. Real-Time Syst., 36(3):199-226, August 2007. URL: http://dx.doi.org/10.1007/s11241-007-9022-5.
  20. Marko Bertogna and Michele Cirinei. Response-time analysis for globally scheduled symmetric multiprocessor platforms. In Real-Time Systems Symposium (RTSS), pages 149-160, 2007. URL: http://dx.doi.org/10.1109/RTSS.2007.31.
  21. E. Bini, G. C. Buttazzo, and G. M. Buttazzo. A hyperbolic bound for the rate monotonic algorithm. In Real-Time Systems, 13th Euromicro Conference on, 2001., pages 59-66, 2001. URL: http://dx.doi.org/10.1109/EMRTS.2001.934000.
  22. Enrico Bini and Giorgio C. Buttazzo. Measuring the performance of schedulability tests. Real-Time Systems, 30(1-2):129-154, 2005. URL: http://dx.doi.org/10.1007/s11241-005-0507-9.
  23. Enrico Bini, Giorgio C. Buttazzo, and Giuseppe M Buttazzo. Rate monotonic analysis: the hyperbolic bound. Computers, IEEE Transactions on, 52(7):933-942, 2003. URL: http://dx.doi.org/10.1109/TC.2003.1214341.
  24. Enrico Bini, Thi Huyen Chau Nguyen, Pascal Richard, and Sanjoy K. Baruah. A response-time bound in fixed-priority scheduling with arbitrary deadlines. IEEE Trans. Computers, 58(2):279-286, 2009. URL: http://dx.doi.org/10.1109/TC.2008.167.
  25. Enrico Bini, Andrea Parri, and Giacomo Dossena. A quadratic-time response time upper bound with a tightness property. In IEEE Real-Time Systems Symposium (RTSS), pages 13-22, 2015. URL: http://dx.doi.org/10.1109/RTSS.2015.9.
  26. Almut Burchard, Jörg Liebeherr, Yingfeng Oh, and Sang Hyuk Son. New strategies for assigning real-time tasks to multiprocessor systems. IEEE Trans. Computers, 44(12):1429-1442, 1995. URL: http://dx.doi.org/10.1109/12.477248.
  27. Jian-Jia Chen. Computational complexity and speedup factors analyses for self-suspending tasks. In Real-Time Systems Symposium (RTSS), pages 327-338, 2016. URL: http://dx.doi.org/10.1109/RTSS.2016.039.
  28. Jian-Jia Chen. Federated scheduling admits no constant speedup factors for constrained-deadline dag task systems. Real-Time Systems, 52(6):833-838, November 2016. URL: http://dx.doi.org/10.1007/s11241-016-9255-2.
  29. Jian-Jia Chen. Partitioned multiprocessor fixed-priority scheduling of sporadic real-time tasks. In Euromicro Conference on Real-Time Systems (ECRTS), pages 251-261, 2016. URL: http://dx.doi.org/10.1109/ECRTS.2016.26.
  30. Jian-Jia Chen, Wen-Hung Huang, and Cong Liu. Evaluate and compare two utilization-based schedulability-test frameworks for real-time systems. CoRR, 2015. URL: https://arxiv.org/abs/1505.02155.
  31. Jian-Jia Chen, Wen-Hung Huang, and Cong Liu. k2U: A general framework from k-point effective schedulability analysis to utilization-based tests. In Real-Time Systems Symposium (RTSS), pages 107-118, 2015. URL: http://dx.doi.org/10.1109/RTSS.2015.18.
  32. Jian-Jia Chen, Wen-Hung Huang, and Cong Liu. k2Q: A quadratic-form response time and schedulability analysis framework for utilization-based analysis. In 2016 IEEE Real-Time Systems Symposium, RTSS, pages 351-362, 2016. URL: http://dx.doi.org/10.1109/RTSS.2016.041.
  33. Jian-Jia Chen and Cong Liu. Fixed-relative-deadline scheduling of hard real-time tasks with self-suspensions. In Real-Time Systems Symposium (RTSS), pages 149-160, 2014. URL: http://dx.doi.org/10.1109/RTSS.2014.31.
  34. R. I. Davis and A. Burns. Response time upper bounds for fixed priority real-time systems. In Real-Time Systems Symposium, 2008, pages 407-418, Nov 2008. URL: http://dx.doi.org/10.1109/RTSS.2008.18.
  35. R. I. Davis, A. Thekkilakattil, O. Gettings, R. Dobrin, and S. Punnekkat. Quantifying the exact sub-optimality of non-preemptive scheduling. In Real-Time Systems Symposium, 2015 IEEE, pages 96-106, Dec 2015. URL: http://dx.doi.org/10.1109/RTSS.2015.17.
  36. R. I. Davis. On the evaluation of schedulability tests for real-time scheduling algorithms. In WATERS, July 2016. URL: https://www-users.cs.york.ac.uk/~robdavis/papers/WATERS2016EvalSchedTests.pdf.
  37. R.I. Davis, T. Rothvoß, S.K. Baruah, and A. Burns. Quantifying the sub-optimality of uniprocessor fixed priority pre-emptive scheduling for sporadic tasksets with arbitrary deadlines. In Real-Time and Network Systems (RTNS), pages 23-31, 2009. URL: https://hal.inria.fr/inria-00441952.
  38. Robert I. Davis and Alan Burns. Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. Real-Time Systems, 47(1):1-40, 2011. URL: http://dx.doi.org/10.1007/s11241-010-9106-5.
  39. Robert I. Davis and Alan Burns. A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv., 43(4):35, 2011. URL: http://dx.doi.org/10.1145/1978802.1978814.
  40. Robert I. Davis, Alan Burns, Sanjoy Baruah, Thomas Rothvoß, Laurent George, and Oliver Gettings. Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms. Real-Time Systems, 51(5):566-601, 2015. URL: http://dx.doi.org/10.1007/s11241-015-9233-0.
  41. Robert I. Davis, Alan Burns, Reinder J. Bril, and Johan J. Lukkien. Controller area network (CAN) schedulability analysis: Refuted, revisited and revised. Real-Time Systems, 35(3):239-272, 2007. URL: http://dx.doi.org/10.1007/s11241-007-9012-7.
  42. Robert I. Davis, Liliana Cucu-Grosjean, Marko Bertogna, and Alan Burns. A review of priority assignment in real-time systems. Journal of systems architecture, 65:64-82, 2016. URL: http://dx.doi.org/10.1016/j.sysarc.2016.04.002.
  43. Robert I. Davis, Laurent George, and Pierre Courbin. Quantifying the sub-optimality of uniprocessor fixed priority non-pre-emptive scheduling. In International Conference on Real-Time and Network Systems (RTNS'10), 2010. URL: https://hal.inria.fr/inria-00536363/document.
  44. Robert I. Davis, Thomas Rothvoß, Sanjoy K. Baruah, and Alan Burns. Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling. Real-Time Systems, 43(3):211-258, 2009. URL: http://dx.doi.org/10.1007/s11241-009-9079-4.
  45. Michael L. Dertouzos. Control robotics: The procedural control of physical processes. In IFIP Congress'74, pages 807-813, 1974. Google Scholar
  46. M. R. Garey and D. S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman and Co., 1979. Google Scholar
  47. Laurent George, Nicolas Rivierre, and Marco Spuri. Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling. Research report, INRIA, 1996. URL: https://hal.inria.fr/inria-00073732.
  48. Nan Guan, Martin Stigge, Wang Yi, and Ge Yu. New response time bounds for fixed priority multiprocessor scheduling. In IEEE Real-Time Systems Symposium (RTSS), pages 387-397, 2009. URL: http://dx.doi.org/10.1109/RTSS.2009.11.
  49. Nan Guan, Martin Stigge, Wang Yi, and Ge Yu. Fixed-priority multiprocessor scheduling with Liu and Layland’s utilization bound. In IEEE Real-Time and Embedded Technology and Applications Symposium, pages 165-174, 2010. URL: http://dx.doi.org/10.1109/RTAS.2010.39.
  50. Ching-Chih Han and Hung-Ying Tyan. A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms. In Real-Time Systems Symposium (RTSS), pages 36-45, 1997. URL: http://dx.doi.org/10.1109/REAL.1997.641267.
  51. Wen-Hung Huang and Jian-Jia Chen. Techniques for schedulability analysis in mode change systems under fixed-priority scheduling. In Embedded and Real-Time Computing Systems and Applications (RTCSA), pages 176-186, 2015. URL: http://dx.doi.org/10.1109/RTCSA.2015.36.
  52. Wen-Hung Huang, Jian-Jia Chen, Husheng Zhou, and Cong Liu. PASS: Priority assignment of real-time tasks with dynamic suspending behavior under fixed-priority scheduling. In Proceedings of the 52nd Annual Design Automation Conference (DAC), pages 154:1-154:6, 2015. URL: http://dx.doi.org/10.1145/2744769.2744891.
  53. Wen-Hung Huang, Maolin Yang, and Jian-Jia Chen. Resource-oriented partitioned scheduling in multiprocessor systems: How to partition and how to share? In Real-Time Systems Symposium (RTSS), pages 111-122, 2016. URL: http://dx.doi.org/10.1109/RTSS.2016.020.
  54. Xu Jiang, Xiang Long, Nan Guan, and Han Wan. On the decomposition-based global EDF scheduling of parallel real-time tasks. In Real-Time Systems Symposium (RTSS), pages 237-246, 2016. URL: http://dx.doi.org/10.1109/RTSS.2016.031.
  55. M. Joseph and P. Pandya. Finding Response Times in a Real-Time System. The Computer Journal, 29(5):390-395, May 1986. URL: http://dx.doi.org/10.1093/comjnl/29.5.390.
  56. Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as clairvoyance. Journal of ACM, 47(4):617-643, July 2000. URL: http://dx.doi.org/10.1145/347476.347479.
  57. Andreas Karrenbauer and Thomas Rothvoß. A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks. In International Workshop on Approximation and Online Algorithms, pages 166-177. Springer Berlin Heidelberg, 2010. URL: http://dx.doi.org/10.1007/978-3-642-18318-8_15.
  58. Tei-Wei Kuo, Li-Pin Chang, Yu-Hua Liu, and Kwei-Jay Lin. Efficient online schedulability tests for real-time systems. IEEE Trans. Software Eng., 29(8):734-751, 2003. URL: http://dx.doi.org/10.1109/TSE.2003.1223647.
  59. Sylvain Lauzac, Rami G. Melhem, and Daniel Mossé. An efficient RMS admission control and its application to multiprocessor scheduling. In IPPS/SPDP, pages 511-518, 1998. URL: http://dx.doi.org/10.1109/IPPS.1998.669964.
  60. John P. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In proceedings Real-Time Systems Symposium (RTSS), pages 201-209, Dec 1990. URL: http://dx.doi.org/10.1109/REAL.1990.128748.
  61. John P. Lehoczky, Lui Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In IEEE Real-Time Systems Symposium'89, pages 166-171, 1989. URL: http://dx.doi.org/10.1109/REAL.1989.63567.
  62. Joseph Y.-T. Leung and Jennifer Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform. Eval., 2(4):237-250, 1982. URL: http://dx.doi.org/10.1016/0166-5316(82)90024-4.
  63. Jing Li, Kunal Agrawal, Chenyang Lu, and Christopher D. Gill. Analysis of global EDF for parallel tasks. In Euromicro Conference on Real-Time Systems (ECRTS), pages 3-13, 2013. URL: http://dx.doi.org/10.1109/ECRTS.2013.12.
  64. Jing Li, Jian-Jia Chen, Kunal Agrawal, Chenyang Lu, Christopher D. Gill, and Abusayeed Saifullah. Analysis of federated and global scheduling for parallel real-time tasks. In 26th Euromicro Conference on Real-Time Systems, ECRTS, pages 85-96, 2014. URL: http://dx.doi.org/10.1109/ECRTS.2014.23.
  65. C. L. Liu and James W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1):46-61, 1973. URL: http://dx.doi.org/10.1145/321738.321743.
  66. Di Liu, Jelena Spasic, Nan Guan, Gang Chen, Songran Liu, Todor Stefanov, and Wang Yi. EDF-VD scheduling of mixed-criticality systems with degraded quality guarantees. In IEEE Real-Time Systems Symposium, RTSS, pages 35-46, 2016. URL: http://dx.doi.org/10.1109/RTSS.2016.013.
  67. Wei Liu, Jian-Jia Chen, Anas Toma, Tei-Wei Kuo, and Qingxu Deng. Computation offloading by using timing unreliable components in real-time systems. In Design Automation Conference (DAC), pages 39:1-39:6, 2014. URL: http://dx.doi.org/10.1145/2593069.2593109.
  68. C. Phillips, C. Stein, E. Torng, and J. Wein. Optimal time-critical scheduling via resource augmentation. In ACM Symposium on Theory of Computing, pages 140-149, 1997. URL: http://dx.doi.org/10.1145/258533.258570.
  69. Georg von der Brüggen, Jian-Jia Chen, Robert I. Davis, and Wen-Hung Huang. Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling. Information Processing Letters (IPL), 2016. URL: http://dx.doi.org/10.1016/j.ipl.2016.08.001.
  70. Georg von der Bruggen, Jian-Jia Chen, and Wen-Hung Huang. Schedulability and optimization analysis for non-preemptive static priority scheduling based on task utilization and blocking factors. In Euromicro Conference on Real-Time Systems, ECRTS, pages 90-101, 2015. URL: http://dx.doi.org/10.1109/ECRTS.2015.16.
  71. Georg von der Brüggen, Wen-Hung Huang, Jian-Jia Chen, and Cong Liu. Uniprocessor scheduling strategies for self-suspending task systems. In International Conference on Real-Time Networks and Systems, RTNS'16, pages 119-128, 2016. URL: http://dx.doi.org/10.1145/2997465.2997497.
  72. Gang Yao, Giorgio Buttazzo, and Marko Bertogna. Feasibility analysis under fixed priority scheduling with fixed preemption points. In Embedded and Real-Time Computing Systems and Applications (RTCSA), pages 71-80, 2010. URL: http://dx.doi.org/10.1109/RTCSA.2010.40.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact