A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms

  title={A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms},
  author={John Carpenter and Shelby H. Funk and Philip Holman and Anand Srinivasan and James H. Anderson and Sanjoy Baruah},
  booktitle={Handbook of Scheduling},
Real-time multiprocessor systems are now commonplace. Designs range from single-chip architectures, with a modest number of processors, to large-scale signal-processing systems, such as synthetic-aperture radar systems. For uniprocessor systems, the problem of ensuring that deadline constraints are met has been widely studied: effective scheduling algorithms that take into account the many complexities that arise in real systems (e.g., synchronization costs, system overheads, etc.) are well… 
Efficient optimal multiprocessor scheduling algorithms for real-time systems
This dissertation shows that reducing the "fairness" in the schedule, advantageously impacts the number of preemptions and migrations, and proposes three new online scheduling algorithms, the first real-time scheduling algorithm which is not based on the notion of " fairness" and nevertheless remains optimal for the scheduling of sporadic (and dynamic) systems.
Soft real-time scheduling on multiprocessors
This dissertation shows that both preemptive and non-preemptive global earliest-deadline-first (EDF) scheduling can guarantee bounded tardiness to every recurrent real-time task system while requiring no restriction on the workload (except that it not exceed the available processing capacity).
PFGN: A Hybrid Multiprocessor Real-Time Scheduling Algorithm for Data Stream Management Systems
In many of recent applications data are received as infinite, continuous, rapid and time varying data streams. Real-time processing of queries over such streams is essential in most of the
Scheduling Algorithms for Real-Time Systems
An overview of some scheduling algorithms for real-time systems on both uniprocessor and multiprocesser systems and mention some that are optimal in each category is presented.
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.
Bounds For Scheduling In Non-Identical Uniform Multiprocessor Systems
The case when the individual processors constituting the multiprocessor need not be identical, that is, when tasks are partitioned among the processors, and interprocessor migration after a part of execution is completed is not allowed is explored.
The multiprocessor real-time scheduling of general task systems
Optimal online multiprocessor real-time scheduling algorithms for sporadic and more general task systems are impossible; however, efficient, online scheduling algorithms and associated feasibility and schedulability tests, with provably bounded deviation from any optimal test, exist.
A survey of hard real-time scheduling for multiprocessor systems
The survey outlines fundamental results about multiprocessor real-time scheduling that hold independent of the scheduling algorithms employed, and provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes.
Customized Multiprocessor Scheduling Algorithms for Real time Systems
A comparative study of different customized Multiprocessor scheduling algorithms which are for specific performance parameters and which maximizes the real time tasks that can be processed without violating timing constraints is presented.


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.
Assigning Real-Time Tasks to Homogeneous Multiprocessor Systems
New schedulability conditions are presented for homogeneous multiprocessor systems where individual processors execute the rate-monotonic scheduling algorithm and new task assignment strategies are proposed for scenarios where the task set is known a priori, and where the real-time task set can change dynamically.
On a Real-Time Scheduling Problem
This work studies the problem of scheduling periodic-time-critical tasks on multiprocessor computing systems and considers two heuristic algorithms that are easy to implement and yield a number of processors that is reasonably close to the minimum number.
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.
Scheduling algorithms for multiprogramming in a hard-real-time environment
The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an
Multiprocessor fixed-priority scheduling with restricted interprocessor migrations
A scheduling algorithm is presented that has a worst-case utilization bound comparable to the worst- case utilization bounds of partitioned scheduling algorithms, and of scheduling algorithms that retain the priority-assignment restriction but allow arbitrary interprocessor migration.
Allocating fixed-priority periodic tasks on multiprocessor systems
A new schedulability condition is developed for the Rate-Monotonic scheduling that allows for more efficient on-line allocation algorithms and Simulation studies show that the average-case performance of the newly proposed algorithms is significantly superior to those in the existing literature.
An efficient RMS admission control and its application to multiprocessor scheduling
  • Sylvain Lauzac, R. Melhem, D. Mossé
  • Computer Science
    Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing
  • 1998
A new and efficient admission control for rate-monotonic scheduling on a uniprocessor and its performance is proposed and modified to provide an admission control mechanism for multiprocesser systems.
Using exact feasibility tests for allocating real-time tasks in multiprocessor systems
The paper introduces improvements in partitioning schemes for multiprocessor real time systems which allow higher processor utilization and enhanced schedulability by using exact feasibility tests to
Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems
It is proved that no uniprocessor scheduling algorithm/allocation algorithm pair can provide a higher worst-case achievable utilization than that of EDF-FF.