论文信息 - Scheduling periodic tasks on uniform multiprocessors

Scheduling periodic tasks on uniform multiprocessors

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 j executing on a processor P for t time units completes (P/sub j/.c/spl times/t) units of execution. The scheduling of systems of periodic tasks on uniform multiprocessor systems is considered.

Sanjoy K. Baruah | Sanjoy Baruah

[1] Chung Laung Liu,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[2] Sudarshan K. Dhall,et al. An On Line Algorithm for Real-Time Tasks Allocation , 1986, IEEE Real-Time Systems Symposium.

[3] Sanjoy K. Baruah,et al. Parallel switching in connection-oriented networks , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[4] Mark Moir,et al. Pfair scheduling of fixed and migrating periodic tasks on multiple resources , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[5] Sanjoy K. Baruah,et al. Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.

[6] Teofilo F. Gonzalez,et al. Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.

[7] James H. Anderson,et al. Efficient object sharing in quantum-based real-time systems , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[8] W. A. Horn. Some simple scheduling algorithms , 1974 .

[9] Eugene L. Lawler,et al. Preemptive scheduling of uniform machines subject to release dates : (preprint) , 1979 .

[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .