Limited Preemption of the 3-Phase Task Model using Preemption Thresholds
Thilanka Thilakasiri, Matthias Becker

TL;DR
This paper introduces a method using preemption thresholds in 3-phase task models to reduce memory usage and improve schedulability on multi-core platforms, balancing preemption and non-preemption benefits.
Contribution
It proposes a novel analysis framework for worst-case response time and memory requirements under preemption thresholds in 3-phase tasks, and applies existing threshold assignment algorithms to this model.
Findings
Memory usage reduced by 2.5 times with preemption thresholds
Schedulability ratios increased by 13 times compared to non-preemptive scheduling
Effective moderation of preemptions improves resource utilization
Abstract
Phased execution models are a well-known solution to tackle the unpredictability of today's complex COTS multi-core platforms. The semantics of these models dedicate phases for a task's execution and shared memory accesses. Memory phases are solely dedicated to load all necessary instructions and data to private local memory, and to write back the results of the computation. During execution phases, only the private local memory is accessed. While non-preemptive execution phases utilize the local memory well, schedulability is reduced due to blocking. On the other hand, fully preemptive execution phases allow for better schedulability, but require local memory to be large enough to hold all tasks involved in preemption simultaneously. Limited preemption is a promising approach that provides moderation between non-preemptive and fully preemptive scheduling. In this paper, we propose…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
