Journal of Computing Science and Engineering

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

DOI QR Code

Sustainability in Real-time Scheduling

  • Published : 2008.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

A scheduling policy or a schedulability test is defined to be sustainable if any task system determined to be schedulable remains so if it behaves "better" than mandated by its system specifications. We provide a formal definition of sustainability, and subject the concept to systematic analysis in the context of the uniprocessor scheduling of periodic and sporadic task systems. We argue that it is, in general, preferable engineering practice to use sustainable tests if possible, and classify common uniprocessor schedulability tests according to whether they are sustainable or not.

Keywords

References

  1. ABENI, L. AND BUTTAZZO, G. 1998. Integrating multimedia applications in hard realtime systems. In Proceedings of the Real-Time Systems Symposium. IEEE Computer Society Press, Madrid, Spain, 3-13. December.
  2. BAKER, T. P. 1991. Stack-based scheduling of real-time processes. Real-Time Systems: The International Journal of Time-Critical Computing 3.
  3. BARUAH, S., MOK, A., AND ROSIER, L. 1990. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the 11th Real-Time Systems Symposium. IEEE Computer Society Press, Orlando, Florida, 182-190.
  4. BARUAH, S. 2006. Resource sharing in EDF-scheduled systems: A closer look. In Proceedings of the IEEE Real-time Systems Symposium. IEEE Computer Society Press, Rio de Janeiro, 379-387. December.
  5. BARUAH, S. AND BURNS, A. 2006. Sustainable scheduling analysis. In Proceedings of the IEEE Realtime Systems Symposium. IEEE Computer Society Press, Rio de Janeiro, 159-168.
  6. BERNAT, G. AND BURNS, A. 1997. Combining (n;m)-hard deadlines and dual priority scheduling. In Proceedings of the IEEE Real-Time Systems Symposium, 46-57.
  7. BERNAT, G. AND BURNS, A. 1999. New results on xed priority aperiodic servers. In Proceedings of the IEEE Real-Time Systems Symposium, 68-78.
  8. BERNAT, G. AND BURNS, A. 2002. Multiple servers and capacity sharing for implementing exible scheduling. Real- Time Systems 22, 49-75. https://doi.org/10.1023/A:1013481420080
  9. BRIL, R. J., LUKKIEN, J. J., AND VERHAEGH, W. F. J. 2007. Worst-case response time analysis of realtime tasks under xed-priority scheduling with deferred preemption revisited. In Proceedings of the 19th Euromicro Conference on Real-Time Systems (ECRTS 07). IEEE Computer Society, 269-279.
  10. BURNS, A. 1994. Preemptive priority based scheduling: An appropriate engineering approach. Advances in Real-Time Systems, 225-248. editor: Son, S. H., Prentice-Hall.
  11. BUTTAZZO, G. 2006. Achieving scalability in real-time systems. IEEE Computer, 54-59. May.
  12. DAVIS, R. AND BURNS, A. 2005. Hierarchical xed priority preemptive scheduling. In IEEE Real-Time Systems Symposium, 389-398.
  13. DAVIS, R. AND BURNS, A. 2007. Robust priority assignment for xed priority real-time systems. In IEEE Real-Time Systems Symposium.
  14. DERTOUZOS, M. 1974. Control robotics: the procedural control of physical processors. In Proceedings of the IFIP Congress, 807-813.
  15. FERSMAN, E., KRCAL, P., PETTERSSON, P., AND YI, W. 2007. Task automata: Schedulability, decidability and undecidability. International Journal of Information and Computation 205, 8, 1149-1172. August. https://doi.org/10.1016/j.ic.2007.01.009
  16. GRAHAM, R. L. 1969. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 12, 2, 416-429.
  17. GUAN, N., GU, Z., DENG, Q., GAO, S., AND YU, G. 2007. Exact schedulability analysis for static priority global multi-processor scheduling using model-checking. In Software Technologies for Embedded and Ubiquitous Systems, LNCS 4761, 263-272.
  18. HA, R. AND LIU, J. W. S. 1994. Validating timing constraints in multiprocessor and distributed realtime systems. In Proceedings of the 14th IEEE International Conference on Distributed Computing Systems. IEEE Computer Society Press, Los Alamitos. June.
  19. JOSEPH, M. AND PANDYA, P. 1986. Finding response times in a real-time system. The Computer Journal 29, 5, 390-395. October. https://doi.org/10.1093/comjnl/29.5.390
  20. KRCAL, P. AND YI, W. 2004. Decidable and undecidable problems in scheduling analysis using timed automata. In Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004), LNCS 2988, 236-250. editors: Jenson, K. and Podelski, A., Springer-Verlag.
  21. KUO, T.-W. AND LI, C.-H. 1998. A xed priority driven open environment for real-time applications. In IEEE Real-Time Systems Symposium.
  22. KUO, T.-W. AND MOK, A. K. 1991. Load adjustment in adaptive real-time systems. In Proceedings of the IEEE Real-Time Systems Symposium, 160-171.
  23. LEHOCZKY, J., SHA, L., AND STRONIDER, J. 1987. Enhanced aperiodic responsiveness in hard realtime environments. In Proceedings of the Real-Time Systems Symposium. IEEE, San Jose, CA, 261-270. December.
  24. LEUNG, J. AND MERRILL, M. 1980. A note on the preemptive scheduling of periodic, real-time tasks. Information Processing Letters 11, 115-118. https://doi.org/10.1016/0020-0190(80)90123-4
  25. LEUNG, J. AND WHITEHEAD, J. 1982. On the complexity of xed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2, 237-250. https://doi.org/10.1016/0166-5316(82)90024-4
  26. LIPARI, G. AND BUTTAZZO, G. 2000. Schedulability analysis of periodic and aperiodic tasks with resource constraints. Journal Of Systems Architecture 46, 4, 327-338. https://doi.org/10.1016/S1383-7621(99)00009-0
  27. LIU, C. AND LAYLAND, J. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20, 1, 46-61. https://doi.org/10.1145/321738.321743
  28. MOK, A. K. 1983. Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology. Available as Technical Report No. MIT/LCS/TR-297.
  29. MOK, A. K. AND POON, W.-C. 2005. Non-preemptive robustness under reduced system load. In Proceedings of the IEEE Real-Time Systems Symposium, 200-209.
  30. PELLIZZONI, R. AND LIPARI, G. 2005. Feasibility analysis of real-time periodic tasks with offsets. Real-Time Systems: The International Journal of Time-Critical Computing 30, 1.2 (May), 105-128.
  31. RAJKUMAR, R. 1991. Synchronization In Real-Time Systems. A Priority Inheritance Approach. Kluwer Academic Publishers, Boston.
  32. DAVIS, R. I., BURNS, A., BRIL, R. J., AND LUKKIEN, J. J. 2007. Controller area network (CAN) schedulability analysis: Refuted, revisited and revised. Real-Time Systems 35, 3, 239-272. https://doi.org/10.1007/s11241-007-9012-7
  33. SHA, L., RAJKUMAR, R., AND LEHOCZKY, J. P. 1990. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers 39, 9, 1175-1185. https://doi.org/10.1109/12.57058
  34. SPRUNT, B., SHA, L., AND LEHOCZKY, J. P. 1989. Aperiodic task scheduling for hard real-time systems. Real-Time Systems 1, 27-69. https://doi.org/10.1007/BF02341920
  35. WELLINGS, A., RICHARDSON, M., BURNS, A., AUDSLEY, N., AND TINDELL, K. 1993. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal 8, 284-292. https://doi.org/10.1049/sej.1993.0034
  36. ZUHILY, A. AND BURNS, A. 2007. Optimal (d- j)-monotonic priority assignment. Information Processing Letters 103, 6, 247-250. https://doi.org/10.1016/j.ipl.2007.04.006

Cited by

  1. Demand-based schedulability analysis for real-time multi-core scheduling vol.89, 2014, https://doi.org/10.1016/j.jss.2013.09.029
  2. Zero-laxity based real-time multiprocessor scheduling vol.84, pp.12, 2011, https://doi.org/10.1016/j.jss.2011.07.002
  3. Joint Optimization of Wireless Network Energy Consumption and Control System Performance in Wireless Networked Control Systems vol.16, pp.4, 2017, https://doi.org/10.1109/TWC.2017.2661280
  4. Schedulability Analysis for Memory Bandwidth Regulated Multicore Real-Time Systems vol.65, pp.2, 2016, https://doi.org/10.1109/TC.2015.2425874
  5. Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling vol.66, pp.4, 2017, https://doi.org/10.1109/TC.2016.2614819
  6. Contention-free executions for real-time multiprocessor scheduling vol.13, pp.2s, 2014, https://doi.org/10.1145/2494530
  7. Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems 2016, https://doi.org/10.1109/TC.2016.2584064
  8. Laxity dynamics and LLF schedulability analysis on multiprocessor platforms vol.48, pp.6, 2012, https://doi.org/10.1007/s11241-012-9157-x
  9. Online and offline scheduling with cache-related preemption delays 2018, https://doi.org/10.1007/s11241-017-9275-6
  10. Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption vol.14, pp.3, 2015, https://doi.org/10.1145/2739954
  11. Global EDF-based scheduling with laxity-driven priority promotion vol.57, pp.5, 2011, https://doi.org/10.1016/j.sysarc.2011.01.002
  12. Transparent Synchronization Protocols for Compositional Real-Time Systems vol.8, pp.2, 2012, https://doi.org/10.1109/TII.2011.2172448
  13. Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems vol.85, pp.10, 2012, https://doi.org/10.1016/j.jss.2012.04.050
  14. Limited carry-in technique for real-time multi-core scheduling vol.59, pp.7, 2013, https://doi.org/10.1016/j.sysarc.2013.05.012
  15. Quantifying Notions of Extensibility in FlexRay Schedule Synthesis vol.19, pp.4, 2014, https://doi.org/10.1145/2647954
  16. Worst-Case Response Time Analysis of a Synchronous Dataflow Graph in a Multiprocessor System with Real-Time Tasks vol.22, pp.2, 2017, https://doi.org/10.1145/2997644