论文信息 - Multiprocessor Scheduling with Few Preemptions

Multiprocessor Scheduling with Few Preemptions

Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the goal of meeting deadlines. Processors are identical and have the same speed. Tasks can be preempted and they can migrate between processors. We propose an algorithm with a utilization bound of 66% and with few preemptions. It can trade a higher utilization bound for more preemptions and in doing so it has a utilization bound of 100%

Björn Andersson | Eduardo Tovar | Björn Andersson | E. Tovar

[1] R. K. Shyamasundar,et al. Multiprocessor scheduling of periodic tasks in a hard real-time environment , 1992, Proceedings Sixth International Parallel Processing Symposium.

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

[3] James H. Anderson,et al. Mixed Pfair/ERfair scheduling of asynchronous periodic tasks , 2001, Proceedings 13th Euromicro Conference on Real-Time Systems.

[4] Joseph Y.-T. Leung,et al. On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[5] Theodore P. Baker. Comparison of Empirical Success Rates of Global vs. Partitioned Fixed-Priority and EDF Scheduling for Hard Real Time TR-050601 , 2005 .

[6] James W. Layland,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[7] Dong-Ik Oh,et al. Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment , 1998, Real-Time Systems.

[8] Sanjoy K. Baruah,et al. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 1990, Real-Time Systems.

[9] Sudarshan K. Dhall,et al. On a Real-Time Scheduling Problem , 1978, Oper. Res..

[10] Rami G. Melhem,et al. Multiple-resource periodic scheduling problem: how much fairness is necessary? , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.