Feasibility problems for recurring tasks on one processor
MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Clock rate versus IPC: the end of the road for conventional microarchitectures
Proceedings of the 27th annual international symposium on Computer architecture
Optimal rate-based scheduling on multiprocessors
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Fast scheduling of periodic tasks on multiple resources
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Pfair scheduling: beyond periodic task systems
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Fairness in periodic real-time scheduling
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Parallel Switching in Connection-Oriented Networks
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
A Theory of Rate-Based Execution
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
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
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
Journal of Computer and System Sciences
IEEE Transactions on Computers
Efficient and flexible fair scheduling of real-time tasks on multiprocessors
Efficient and flexible fair scheduling of real-time tasks on multiprocessors
Fair scheduling of dynamic task systems on multiprocessors
Journal of Systems and Software - Special issue: Parallel and distributed real-time systems
Fine-Grained Task Reweighting on Multiprocessors
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
The Partitioned Multiprocessor Scheduling of Sporadic Task Systems
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Algorithms for Determining the Demand-Based Load of a Sporadic Task System
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
LITMUS^RT: A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Surplus fair scheduling: a proportional-share CPU scheduling algorithm for symmetric multiprocessors
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Soft real-time scheduling on multiprocessors
Soft real-time scheduling on multiprocessors
Integrating Hard/Soft Real-Time Tasks and Best-Effort Jobs on Multiprocessors
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Static-priority periodic scheduling on muitiprocessors
RTSS'10 Proceedings of the 21st IEEE conference on 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
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Improved conditions for bounded tardiness under EPDF Pfair multiprocessor scheduling
Journal of Computer and System Sciences
| Hi-index | 0.00 |
The earliest-pseudo-deadline-first (EPDF) Pfair scheduling algorithm is less expensive than some other known Pfair algorithms, but is not optimal for scheduling recurrent real-time tasks on more than two processors. In prior work, sufficient per-task weight (i.e., utilization) restrictions were established for ensuring that tasks either do not miss their deadlines or have bounded tardiness when scheduled under EPDF. Implicit in these restrictions is the assumption that the total system utilization may equal the total available processing capacity (i.e., the total number of processors). This paper considers an orthogonal issue, namely, determining a sufficient restriction on the total utilization of a task set for it to be schedulable (i.e., a schedulable utilization bound) under EPDF, assuming that there are no per-task weight restrictions. We prove that a task set with total utilization at most 3M+1/4 is correctly scheduled under EPDF on M processors, regardless of how large each task's weight is. At present, we do not know whether this value represents the worst-case for EPDF, but we do provide a counterexample that shows that it cannot be improved to exceed 86% of the total processing capacity. The schedulable utilization bound we derive is expressed in terms of the maximum weight of any task, and hence, if this value is known, may be used to schedule task sets with total utilization greater than 3M+1/4.