Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Scheduling of Offset Free Systems
Real-Time Systems
Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Proceedings of the conference on Design, automation and test in Europe
Predictability of Fixed-Job Priority schedulers on heterogeneous multiprocessor real-time systems
Information Processing Letters
Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Off-line (Optimal) multiprocessor scheduling of dependent periodic tasks
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Feasibility intervals for homogeneous multicores, asynchronous periodic tasks, and FJP schedulers
Proceedings of the 21st International conference on Real-Time Networks and Systems
Hi-index | 0.00 |
In this paper, we study the global scheduling of periodic task systems on unrelated multiprocessor platforms. We first show two general properties which are well known for uniprocessor platforms and which are also true for unrelated multiprocessor platforms: (i) under few and not so restrictive assumptions, we prove that feasible schedules of periodic task systems are periodic starting from some point in time with a period equal to the least common multiple of the task periods and (ii) for the specific case of synchronous periodic task systems, we prove that feasible schedules repeat from their origin. We then present our main result: we characterize, for task-level fixed-priority schedulers and for asynchronous constrained or arbitrary deadline periodic task models, upper bounds of the first time-instant where the schedule repeats. For task-level fixed-priority schedulers, based on the upper bounds and the predictability property, we provide exact schedulability tests for asynchronous constrained or arbitrary deadline periodic task sets. Finally, we provide an exact schedulability test as well for the job-level fixed-priority Earliest Deadline First (EDF) scheduler, for which such an upper bound is unknown.