LIPIcs.ECRTS.2017.19.pdf
- Filesize: 0.64 MB
- 22 pages
Document
Improving the Quality-of-Service for Scheduling Mixed-Criticality Systems on Multiprocessors
Author
-
Part of:
Volume:
29th Euromicro Conference on Real-Time Systems (ECRTS 2017)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Euromicro Conference on Real-Time Systems (ECRTS) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2017-06-23
Cite AsGet BibTex
Risat Mahmud Pathan. Improving the Quality-of-Service for Scheduling Mixed-Criticality Systems on Multiprocessors. In 29th Euromicro Conference on Real-Time Systems (ECRTS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 76, pp. 19:1-19:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.ECRTS.2017.19
https://doi.org/10.4230/LIPIcs.ECRTS.2017.19
Abstract
The traditional Vestal's model of Mixed-Criticality (MC) systems was recently extended to Imprecise Mixed-Critical task model (IMC) to guarantee some minimum level of (degraded) service to the low-critical tasks even after the system switches to the high-critical behavior. This paper extends the IMC task model by associating specific Quality-of-Service (QoS) values with the low-critical tasks and proposes a fluid-based scheduling algorithm, called MCFQ, for such task model. The MCFQ algorithm allows some low-critical tasks to provide full service even during the high-critical behavior so that the QoS of the overall system is increased. To the best of our knowledge MCFQ is the first algorithm for IMC task sets considering multiprocessor platform and QoS values.
By extending the recently proposed MC-Fluid and MCF fluid-based multiprocessor scheduling algorithms for IMC task model, empirical results show that MCFQ algorithm can significantly improve the QoS of the system in comparison to that of both MC-Fluid and MCF. In addition, the schedulability performance of MCFQ is very close to the optimal MC-Fluid algorithm. Finally, we prove that the MCFQ algorithm has a speedup bound of 4/3, which is optimal for IMC tasks.
Keywords
- Mixed-Criticality Systems
- Real-Time Systems
- Multiprocessor Scheduling
- Quality of Service
- Imprecise Computation
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- S. Baruah, V. Bonifaci, G. DAngelo, H. Li, A. Marchetti-Spaccamela, S. Van Der Ster, and L. Stougie. The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems. In Proc. of ECRTS, 2012. URL: http://dx.doi.org/10.1109/ECRTS.2012.42.
- S. Baruah, A. Burns, and Z. Guo. Scheduling mixed-criticality systems to guarantee some service under all non-erroneous behaviors. In Proc. of ECRTS, 2016. URL: http://dx.doi.org/10.1109/ECRTS.2016.12.
- S. Baruah, A. Eswaran, and Z. Guo. MC-Fluid: Simplified and Optimally Quantified. In Proc. of RTSS, 2015. URL: http://dx.doi.org/10.1109/RTSS.2015.38.
- S. Baruah, Haohan Li, and L. Stougie. Towards the Design of Certifiable Mixed-criticality Systems. In Proc. of RTAS, 2010. URL: http://dx.doi.org/10.1109/RTAS.2010.10.
- S. Baruah and S. Vestal. Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications. In Proc. of ECRTS, 2008. URL: http://dx.doi.org/10.1109/ECRTS.2008.26.
- Sanjoy Baruah, Alan Burns, and Robert Davis. Response-time analysis for mixed criticality systems. In Proc. of RTSS, 2011. URL: http://dx.doi.org/10.1109/RTSS.2011.12.
- A. Burns and S. Baruah. Towards a more practical model for mixed criticality systems. In Proc. of WMC, RTSS, 2013. URL: http://www-users.cs.york.ac.uk/~robdavis/wmc2013/paper3.pdf.
- A. Burns and R. Davis. Mixed-criticality systems: A review. In (available online), Eighth Edition, July, 2016. URL: http://www-users.cs.york.ac.uk/~burns/review.pdf.
- Oliver Gettings, Sophie Quinton, and Robert I. Davis. Mixed criticality systems with weakly-hard constraints. In Proc. of RTNS, 2015. URL: http://dx.doi.org/10.1145/2834848.2834850.
- Nan Guan, Pontus Ekberg, Martin Stigge, and Wang Yi. Effective and Efficient Scheduling of Certifiable Mixed-Criticality Sporadic Task Systems. In Proc. of RTSS, 2011. URL: http://dx.doi.org/10.1109/RTSS.2011.10.
- Mathieu Jan, Lilia Zaourar, and Maurice Pitel. Maximizing the execution rate of low-criticality tasks in mixed criticality systems. In Proc. of WMC, RTSS, 2013. URL: http://www-users.cs.york.ac.uk/~robdavis/wmc2013/paper6.pdf.
- J. Lee, K. M. Phan, X. Gu, J. Lee, A. Easwaran, I. Shin, and I. Lee. MC-Fluid: Fluid Model-Based Mixed-Criticality Scheduling on Multiprocessors. In Proc. of RTSS, 2014. URL: http://dx.doi.org/10.1109/RTSS.2014.32.
- Haohan Li and Sanjoy Baruah. Global mixed-criticality scheduling on multiprocessors. In Proc of ECRTS, 2012. URL: http://dx.doi.org/10.1109/ECRTS.2012.41.
- Di Liu, Jelena Spasic, Gang Chen, Nan Guan, Songran Liu, Todor Stefanov, and Wang Yi. EDF-VD Scheduling of Mixed-Criticality Systems with Degraded Quality Guarantees. In Proc. of RTSS, 2016. URL: http://dx.doi.org/10.1109/RTSS.2016.013.
- Jane W. S. Liu, Kwei-Jay Lin, Wei-Kuan Shih, Albert Chuang-shi Yu, Jen-Yao Chung, and Wei Zhao. Algorithms for scheduling imprecise computations. Computer, 24(5):58-68, May 1991. URL: http://dx.doi.org/10.1007/978-1-4615-3956-8_8.
- J. W. Liu, W.-K. Shih, K.-J. Lin, R. Bettati, and J.-Y. Chung. Imprecise computations. Proceedings of the IEEE, 82(1):83-94, 1994. URL: http://dx.doi.org/10.1109/5.259428.
- Risat Mahmud Pathan. Fault-tolerant and real-time scheduling for mixed-criticality systems. Real-Time Systems, 50(4):509-547, 2014. URL: http://dx.doi.org/10.1007/s11241-014-9202-z.
- F. Santy, L. George, P. Thierry, and J. Goossens. Relaxing Mixed-Criticality Scheduling Strictness for Task Sets Scheduled with FP. In Proc. of ECRTS, 2012. URL: http://dx.doi.org/10.1109/ECRTS.2012.39.
- H. Su, N. Guan, and D. Zhu. Service guarantee exploration for mixed-criticality systems. In Proc. of RTCSA, 2014. URL: http://dx.doi.org/10.1109/RTCSA.2014.6910499.
- H. Su and D. Zhu. An elastic mixed-criticality task model and its scheduling algorithm. In Proc. of DATE, 2013. URL: http://dx.doi.org/10.7873/DATE.2013.043.
- S. Vestal. Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance. In Proc. of RTSS, pages 239-243, 2007. URL: http://dx.doi.org/10.1109/RTSS.2007.47.