A survey of hard real-time scheduling for multiprocessor systems

  title={A survey of hard real-time scheduling for multiprocessor systems},
  author={Robert I. Davis and Alan Burns},
  journal={ACM Comput. Surv.},
This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. [] Key Method It provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes. A detailed review is provided covering partitioned, global, and hybrid scheduling algorithms, approaches to resource sharing, and the latest results from empirical investigations. The survey identifies open issues…

Figures and Tables from this paper

A Survey on Scheduling Approaches for Hard Real-Time Systems

This paper surveyed the basic hard RTS scheduling algorithms that guarantee the on-time completion of the tasks and contains the different heuristic and partitioned approaches for some specific factors of real-time systems such as energy consumption, dependability, performance, scheduling feasibility and utilization of memory resource.

Multiprocessor Scheduling with Cache Related Preemption Delays

  • R. B. KeskarU. Deshpande
  • Computer Science
    2015 Fifth International Conference on Communication Systems and Network Technologies
  • 2015
This paper proposes task partitioning methods that consider CRPD costs while allocating tasks to processors, to achieve a schedulable system and presents a novel technique to calculate utilization of each task considering the CRPD cost.

Survey of Real Time Scheduling Algorithms

This work talks about static and dynamic scheduling algorithms for real time task which are priority driven and divided into three classes fixed priority, dynamic priority and hybrid priority and shows that Instantaneous utilization factor scheduling Algorithm gives better result in uniprocessor scheduling algorithms and Modified Instantaneous utilizing factor scheduling algorithm gives better context switching, response time and CPU utilization.

DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

A unifying theory is developed with the DP-Fair scheduling policy to address the problem of scheduling sporadic task sets with arbitrary deadlines and how it overcomes problems faced by greedy scheduling algorithms is examined.

Template schedule construction for global real-time scheduling on unrelated multiprocessor platforms

This work proposes and proves correct a novel and efficient algorithm to build the template schedule and shows by using a counter-example that this second step is incomplete.

Fixed-Priority Multiprocessor Scheduling: Critical Instant, Response Time and Utilization Bound

  • Nan GuanW. Yi
  • Computer Science
    2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum
  • 2012
This work study several fundamental problems in multiprocessor scheduling, namely the critical instant, bounded responsiveness, and utilization bound, which are a constantly increasing trend of deploying real-time systems on multi-core platforms.

Theory and Practice of EDF Scheduling in Distributed Real-Time Systems

This paper proposes a set of experiments to contrast the theoretical results on scheduling deadline assignment in a distributed real-time application against those obtained through its real execution.

DARTS: DynAmic Real-time Task Scheduling

DARTS algorithm is proposed, which is based on dynamic utilization and assigns higher priority to a task with the highest utilization with regard to its laxity, and it is demonstrated that not only does DARTS algorithm have better utilization than existing global EDF schedulability tests, but it also has significantly well outputs in total utilization less than 90 percent.

Release enforcement in resource-oriented partitioned scheduling for multiprocessor systems

A release enforcement technique is used to shape the interference from the higher-priority jobs to be sporadic, analyze the schedulability, and provide strategies for partitioning both the critical and the non-critical sections of tasks onto processors individually.

A multiprocessor real-time scheduling simulation tool

RealtssMP is introduced, a tool to perform scheduling analysis and simulation of multiprocessor real-time scheduling algorithms and has shown to be helpful in the evaluation of the performance of existing and new scheduling algorithms.



New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems

New schedulability conditions are presented for homogeneous multiprocessor systems where individual processors execute the rate-monotonic scheduling algorithm and it is shown that the processors can be almost fully utilized.

Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms

A general method to derive schedulability conditions for multiprocessor real-time systems will be presented and the analysis will be applied to two typical scheduling algorithms: earliest deadline first (EDF) and fixed priority (FP).

A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling

We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and i¾?> 0, correctly decides either that

EDF and RM Multiprocessor Scheduling Algorithms : Survey and Performance Evaluation

A survey of the best-known realtime scheduling techniques executing on multiple processors, using the Rate Monotonic and Earliest Deadline First scheduling policies, is conducted.

Static-priority scheduling on multiprocessors

It is proven that this scheduling algorithm is a simple extension of the uniprocessor rate-monotonic scheduling algorithm and successfully schedules any periodic task system with a worst-case utilization no more than a third the capacity of the multiprocesser platform.

A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling

We devise an approximate feasibility test for multiprocessor real-time scheduling in the sporadic task model. We give an algorithm that, given a task system and ε>0, correctly decides either that the

Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor

This paper compares EDZL, a hybrid of EDF and LLF, with other deadline-based scheduling algorithms such as EDF, EDF-US[m(2m-1)], and fpEDF, and shows it schedules all task sets schedulable by EDF.

Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors

A new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors.

Comparison of global and partitioning schemes for scheduling rate monotonic tasks on a multiprocessor

The authors study GRMS, a global scheduling scheme for rate monotonic tasks on a multiprocessor, and outlines some situations where one scheme is preferable over the other.

Semi-partitioned Fixed-Priority Scheduling on Multiprocessors

  • S. KatoN. Yamasaki
  • Computer Science
    2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium
  • 2009
The algorithm is designed so that a task is qualified to migrate, only if it cannot be assigned to any individual processors, in such a way that it is never returned to the same processor within the same period, once it is migrated from one processor to another processor.