Scheduling periodic tasks on uniform multiprocessors

Authors:
Sanjoy K. Baruah
Affiliations:
The University of North Carolina at Chapel Hill
Venue:
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Year:
2000

Citing 6
Cited 5

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient Object Sharing in Quantum-Based Real-Time Systems

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Parallel Switching in Connection-Oriented Networks

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium

Rate-Monotonic Scheduling on Uniform Multiprocessors

IEEE Transactions on Computers
Minimizing migrations in fair multiprocessor scheduling of persistent tasks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing migrations in fair multiprocessor scheduling of persistent tasks

Journal of Scheduling
Deadline Monotonic Scheduling on Uniform Multiprocessors

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Globally scheduled real-time multiprocessor systems with GPUs

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A uniform multiprocessor machine is comprised of an integer number of processors. Each processor P is characterized by a computing capacity P.c with the interpretation that a job executing on processor P for t time units completes (Pj.c×t) units of execution. The scheduling of systems of periodic tasks on uniform multiprocessor systems is considered.