Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Architecture and design of AlphaServer GS320
ACM SIGPLAN Notices
Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Optimal Reward-Based Scheduling of Periodic Real-Time Tasks
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Static-Priority Scheduling on Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
On-Line Scheduling on Uniform Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Rate-Monotonic Scheduling on Uniform Multiprocessors
IEEE Transactions on Computers
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
| Hi-index | 0.00 |
Each processor in a uniform multiprocessor ma-chine is characterized by a speed or computing capac-ity, with the interpretation that a job executing on aprocessor with speed s for t time units completes (s \times t)units of execution. The scheduling of systems of periodic tasks on uniform multiprocessor platforms usingthe rate-monotonic scheduling algorithm is considered here. A simple, sufficient test is presented fordetermining whether a given periodic task system willbe successfully scheduled by algorithm upon a particularuniform multiprocessor platform - this test generalizes earlier results concerning rate-monotonic scheduling upon identical multiprocessor platforms.