Schedulability Analysis of Non-Preemptive Strictly Periodic Tasks in Multi-Core Real-Time Systems
Non-preemptive tasks with strict periods are usually adopted in practical real-time systems where missing deadlines may lead to catastrophic situations. Their schedulability analysis plays a crucial role in guiding the design and development of such real-time systems. In this paper, we study the schedulability analysis problem of partitioned non-preemptive scheduling for strictly periodic tasks on multiprocessors. We propose a set of schedulability conditions, which determines whether a new task can be scheduled on a processor without changing the offsets of the existing tasks and identifies all valid start time offsets for the new task if it is schedulable. Based on these conditions, we present a task assignment algorithm, which is not optimal, but provides an upper bound on the number of cores required by a periodic task set. We illustrate this algorithm with a practical example and conduct stimulation experiments with randomly generated task sets to evaluate the performance of our approach from several aspects.
Locate the Document
Chen, J., Du, C., Xie, F., & Yang, Z. (2016). Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems. Real-Time Systems, 52(3), 239-271.