Analysis on quantum-based fixed priority scheduling of real-time tasks
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Resource holding times: computation and optimization
Real-Time Systems
Energy reduction techniques for systems with non-DVS components
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Reducing stack with intra-task threshold priorities in real-time systems
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
PT-AMC: integrating preemption thresholds into mixed-criticality scheduling
Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.01 |
Using preemption threshold scheduling (PTS) in a multi-threaded real-time embedded system reduces system preemptions and hence reduces run-time overhead while still ensuring real-time constraints are met. However, PTS offers other valuable benefits. In this paper we investigate the use of PTS for hard real-time system with limited RAM. Our primary contribution is to prove the optimality of PTS among all preemption-limiting methods for minimizing a system's total stack memory requirements. We then discuss characteristics of PTS and show how to reduce average worst-case response times. We also introduce a unified framework for using PTS with existing fixed-priority (e.g. rateor deadline-monotonic), or dynamic-priority scheduling algorithms (e.g. earliest-deadline first). We evaluate the performance of PTS and our improvements using synthetic workloads and a real-time workload. We show PTS is extremely effective at reducing stack memory requirements. Our enhancements to PTS improve worst-case response-times as well.