Abstract
A Mixed-Criticality System (MCS) features the integration of multiple subsystems that are subject to different levels of safety certification on a shared hardware platform. In cost-sensitive application domains such as automotive E/E systems, it is important to reduce application memory footprint, since such a reduction may enable the adoption of a cheaper microprocessor in the family. Preemption Threshold Scheduling (PTS) is a well-known technique for reducing system stack usage. We consider partitioned multiprocessor scheduling, with Preemption Threshold Adaptive Mixed-Criticality (PT-AMC) as the task scheduling algorithm on each processor and address the optimization problem of finding a feasible task-to-processor mapping with minimum total system stack usage on a resource-constrained multi-processor. We present the Extended Maximal Preemption Threshold Assignment Algorithm (EMPTAA), with dual purposes of improving the taskset’s schedulability if it is not already schedulable, and minimizing system stack usage of the schedulable taskset. We present efficient heuristic algorithms for finding sub-optimal yet high-quality solutions, including Maximum Utilization Difference based Partitioning (MUDP) and MUDP with Backtrack Mapping (MUDP-BM), as well as a Branch-and-Bound (BnB) algorithm for finding the optimal solution. Performance evaluation with synthetic task sets demonstrates the effectiveness and efficiency of the proposed algorithms.
- [1] . 2011. Scheduling real-time mixed-criticality jobs. IEEE Trans. Comput. 61, 8 (2011), 1140–1152.Google Scholar
Digital Library
- [2] . 2012. The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems. In 24th Euromicro Conference on Real-time Systems. IEEE, 145–154.Google Scholar
Digital Library
- [3] . 2014. Mixed-criticality scheduling on multiprocessors. Real-time Syst. 50, 1 (2014), 142–177.Google Scholar
Digital Library
- [4] . 2011. Response-time analysis for mixed criticality systems. In IEEE 32nd Real-time Systems Symposium. IEEE, 34–43.Google Scholar
- [5] . 2017. A survey of research into mixed criticality systems. ACM Comput. Surv. 50, 6 (2017), 1–37.Google Scholar
Digital Library
- [6] . 2019. A review of recent techniques in mixed-criticality systems. J. Circ., Syst. Comput. 28, 7 (2019), 1930007.Google Scholar
Cross Ref
- [7] . 2005. Solution space for fixed-priority with preemption threshold. In 11th IEEE Real Time and Embedded Technology and Applications Symposium. IEEE, 385–394.Google Scholar
Digital Library
- [8] . 2016. Partitioned multiprocessor fixed-priority scheduling of sporadic real-time tasks. In 28th Euromicro Conference on Real-time Systems (ECRTS). IEEE, 251–261.Google Scholar
Cross Ref
- [9] . 2011. Resource augmentation bounds for approximate demand bound functions. In IEEE 32nd Real-time Systems Symposium. IEEE, 272–281.Google Scholar
- [10] . 2017. Approximation and online algorithms for multidimensional bin packing: A survey. Comput. Sci. Rev. 24 (2017), 63–79.Google Scholar
Cross Ref
- [11] . 2011. A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv. 43, 4 (2011), 1–44.Google Scholar
Digital Library
- [12] . 2008. Efficient exact schedulability tests for fixed priority real-time systems. IEEE Trans. Comput. 57, 9 (2008), 1261–1276.Google Scholar
Digital Library
- [13] . 2013. Demand-based scheduling of mixed-criticality sporadic tasks on one processor. In IEEE 34th Real-time Systems Symposium. IEEE, 78–87.Google Scholar
- [14] . 2014. Bounding and shaping the demand of generalized mixed-criticality sporadic task systems. Real-time syst. 50, 1 (2014), 48–86.Google Scholar
Digital Library
- [15] . 2006. The partitioned scheduling of sporadic tasks according to static-priorities. In 18th Euromicro Conference on Real-time Systems (ECRTS’06). IEEE.Google Scholar
Digital Library
- [16] . 2013. Extending Mixed Criticality Scheduling. Ph.D. Dissertation. University of York.Google Scholar
- [17] . 2007. Preemption threshold scheduling: Stack optimality, enhancements and analysis. In 13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS’07). IEEE, 147–157.Google Scholar
Digital Library
- [18] . 2020. Generating utilization vectors for the systematic evaluation of schedulability tests. In IEEE Real-time Systems Symposium (RTSS). 76–88.Google Scholar
- [19] . 2014. Partitioned mixed-criticality scheduling on multiprocessor platforms. In Design, Automation and Test in Europe Conference and Exhibition (DATE). 1–6.Google Scholar
Cross Ref
- [20] . 2014. Optimal speedup bound for 2-level mixed-criticality arbitrary deadline systems. In Real-Time Scheduling Open Problems Seminar RTSOPS). 15–16.Google Scholar
- [21] . 2018. Multicore mixed-criticality systems: Partitioned scheduling and utilization bound. IEEE Trans. Comput.-Aid. Des. Integ. Circ. Syst. 37, 1 (2018), 21–34.Google Scholar
Cross Ref
- [22] . 2021. Bridging the pragmatic gaps for mixed-criticality systems in the automotive industry. IEEE Trans. Comput.-aid. Des. Integ. Circ. Syst. (2021).Google Scholar
Cross Ref
- [23] . 2011. On partitioned scheduling of fixed-priority mixed-criticality task sets. In IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications. 1051–1059.Google Scholar
Digital Library
- [24] . 1989. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Real-time Systems Symposium, Vol. 89. 166–171.Google Scholar
- [25] . 2017. Utilization difference based partitioned scheduling of mixed-criticality systems. In Design, Automation and Test in Europe Conference and Exhibition (DATE). 238–243.Google Scholar
Cross Ref
- [26] . 2000. Scalable real-time system design using preemption thresholds. In 21st IEEE Real-time Systems Symposium. IEEE, 25–34.Google Scholar
- [27] . 2007. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In 28th IEEE International Real-time Systems Symposium (RTSS’07). IEEE, 239–243.Google Scholar
- [28] . 2016. Minimizing stack memory for hard real-time applications on multicore platforms with partitioned fixed-priority or EDF scheduling. ACM Trans. Des. Automat. Electron. Syst. 21, 3 (2016), 46.Google Scholar
Digital Library
- [29] . 2016. Global fixed priority scheduling with preemption threshold: Schedulability analysis and stack size minimization. IEEE Trans. Parallel Distrib. Syst. 27, 11 (2016), 3242–3255.Google Scholar
Digital Library
- [30] . 1999. Scheduling fixed-priority tasks with preemption threshold. In 6th International Conference on Real-time Computing Systems and Applications (RTCSA’99). IEEE, 328–335.Google Scholar
- [31] . 2014. Minimizing stack and communication memory usage in real-time embedded applications. ACM Trans. Embed. Comput. Syst. 13, 5 (2014), 149.Google Scholar
- [32] . 2019. A semi-partition algorithm for mixed-criticality tasks in multiprocessor platform. In IEEE 10th International Conference on Software Engineering and Service Science (ICSESS). IEEE, 694–697.Google Scholar
Cross Ref
- [33] . 2019. Partition and scheduling of the mixed-criticality tasks based on probability. IEEE Access 7 (2019), 87837–87848.Google Scholar
Cross Ref
- [34] . 2014. On the analysis of EDF-VD scheduled mixed-criticality real-time systems. In 9th IEEE International Symposium on Industrial Embedded Systems (SIES’14). IEEE, 179–188.Google Scholar
- [35] . 2016. HLC-PCP: A resource synchronization protocol for certifiable mixed criticality scheduling. J. Syst. Archit. 66 (2016), 84–99.Google Scholar
Digital Library
- [36] . 2013. Integration of resource synchronization and preemption-thresholds into EDF-based mixed-criticality scheduling algorithm. In IEEE 19th International Conference on Embedded and Real-time Computing Systems and Applications. IEEE, 227–236.Google Scholar
- [37] . 2013. PT-AMC: Integrating preemption thresholds into mixed-criticality scheduling. In Design, Automation and Test in Europe Conference and Exhibition (DATE). 141–146.Google Scholar
Cross Ref
- [38] . 2015. Resource synchronization and preemption thresholds within mixed-criticality scheduling. ACM Trans. Embed. Comput. Syst. 14, 4 (2015), 81:1–81:25.Google Scholar
Digital Library
- [39] . 2017. Design optimization for AUTOSAR models with preemption thresholds and mixed-criticality scheduling. J. Syst. Archit. 72 (2017), 61–68.Google Scholar
Digital Library
- [40] . 2018. Schedulability analysis and stack size minimization with preemption thresholds and mixed-criticality scheduling. J. Syst. Archit. 83 (2018), 57–74.Google Scholar
Index Terms
Minimizing Stack Memory for Partitioned Mixed-criticality Scheduling on Multiprocessor Platforms
Recommendations
Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption
Special Issue on Embedded Platforms for Crypto and Regular PapersThis article introduces schedulability analysis for Global Fixed Priority Scheduling with Deferred Preemption (gFPDS) for homogeneous multiprocessor systems. gFPDS is a superset of Global Fixed Priority Preemptive Scheduling (gFPPS) and Global Fixed ...
The Partitioned Scheduling of Sporadic Real-Time Tasks on Multiprocessor Platforms
ICPPW '05: Proceedings of the 2005 International Conference on Parallel Processing WorkshopsIn the sporadic task model, a task is characterized by three parameters an execution requirement, a relative deadline, and a period parameter and has the interpretation that it generates an infinite sequence of jobs, such that (i) the arrival-times of ...
Minimizing Stack Memory for Hard Real-Time Applications on Multicore Platforms with Partitioned Fixed-Priority or EDF Scheduling
Special Section on New Physical Design Techniques for the Next Generation Integration Technology and Regular PapersMulticore processors are increasingly adopted in resource-constrained real-time embedded applications. In the development of such applications, efficient use of RAM memory is as important as the effective scheduling of software tasks. Preemption ...






Comments