Deadline-based scheduling of periodic task systems on multiprocessors
Information Processing Letters
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
Real-Time Systems
Static-Priority Scheduling on Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
IEEE Transactions on Computers
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
The partitioned dynamic-priority scheduling of sporadic task systems
Real-Time Systems
Tardiness bounds under global EDF scheduling on a multiprocessor
Real-Time Systems
Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Deadline Monotonic Scheduling on Uniform Multiprocessors
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Optimal virtual cluster-based multiprocessor scheduling
Real-Time Systems
Proceedings of the 2010 ACM Symposium on Applied Computing
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
Global deadline-monotonic scheduling of arbitrary-deadline sporadic task systems
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Global fixed-priority scheduling of arbitrary-deadline sporadic task systems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Tests for global EDF schedulability analysis
Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
What to make of multicore processors for reliable real-time systems?
Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
FPSL, FPCL and FPZL schedulability analysis
Real-Time Systems
Parallel scheduling for cyber-physical systems: analysis and case study on a self-driving car
Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems
| Hi-index | 0.00 |
In this paper, we address the problem of schedulability analysis of a set of real-time periodic (or sporadic) tasks on multiprocessor hardware platforms, under fixed priority global scheduling. In a multiprocessor system with M processors, a global scheduler consists of a single queue of ready tasks for all processors, and the scheduler selects the first M tasks to execute on the M processors. We allow preemption and migration of tasks between processors. This paper presents two different contributions. First, we derive a sufficient schedulability test for periodic and sporadic task system scheduled with fixed priority when priorities are assigned according to Deadline Monotonic. This test is efficient when dealing with heavy tasks (i.e. tasks with high utilization). Then, we develop an independent analysis for preperiod deadline systems. This leads to a new schedulability test with density and utilization bounds that are tighter than the existing ones.