Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
On-Line Scheduling of Real-Time Tasks
IEEE Transactions on Computers
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An optimal multiprocessor real-time scheduling algorithm
Journal of Parallel and Distributed Computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Optimal Deadline Assignment for Scheduling Soft Aperiodic Tasks in Hard Real-Time Environments
IEEE Transactions on Computers
The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks
RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
A Modified Least-Laxity-First Scheduling Algorithm for Real-Time Tasks
RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
The Case for Fair Multiprocessor Scheduling
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
An Analysis of EDF Schedulability on a Multiprocessor
IEEE Transactions on Parallel and Distributed Systems
Improving Soft Real-Time Performance through Better Slack Reclaiming
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Multiprocessor Scheduling with Few Preemptions
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
FFT program generation for shared memory: SMP and multicore
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Diverse Soft Real-Time Processing in an Integrated System
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Multiprocessor fixed-priority scheduling with restricted interprocessor migrations
Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Real-Time Scheduling with Task Splitting on Multiprocessors
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
New Abstraction for Optimal Real-Time Scheduling on Multiprocessors
RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Sporadic Multiprocessor Scheduling with Few Preemptions
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Work-Conserving Optimal Real-Time Scheduling on Multiprocessors
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Portioned EDF-based scheduling on multiprocessors
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Optimal Dynamic-Priority Real-Time Scheduling Algorithms for Uniform Multiprocessors
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Coordinated Task Scheduling, Allocation and Synchronization on Multiprocessors
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
A global optimal scheduling algorithm for multiprocessor low-power platforms
Proceedings of the 20th International Conference on Real-Time and Network Systems
| Hi-index | 0.00 |
We consider the problem of optimal real-time scheduling of periodic and sporadic tasks on identical multiprocessors. A number of recent papers have used the notions of fluid scheduling and deadline partitioning to guarantee optimality and improve performance. This article develops a unifying theory with the DP-Fair scheduling policy and examines how it overcomes problems faced by greedy scheduling algorithms. In addition, we present DP-Wrap, a simple DP-Fair scheduling algorithm which serves as a least common ancestor to other recent algorithms. The DP-Fair scheduling policy is extended to address the problem of scheduling sporadic task sets with arbitrary deadlines.