论文信息 - Preemptive Scheduling of Periodic Tasks on Multiprocessor: Dynamic Algorithms and Their Performance

Preemptive Scheduling of Periodic Tasks on Multiprocessor: Dynamic Algorithms and Their Performance

In this paper, the problem of preemptively scheduling a set of periodic tasks on a multiprocessor is considered. Three dynamic algorithms are proposed, and their performance is studied. These algorithms are Rate-Monotonic-NextFit-WC (RMNF-WC), Rate-Monotonic-First-Fit-WC (RMFF-WC), and RateMonotonic-Best-Fit-WC (RMBF-WC), and their worst-case performance is shown to be tightly bounded by 2.88, 2.33, and 2.33, respectively. The major contributions of this papers are (1) These algorithms are the few truly dynamic algorithms for scheduling periodic tasks on a multiprocessor system, and they are the few algorithms, the worst-case performance of which is investigated. (2) The worst-case performance bound is shown to be tight. (3) The worst-case performance bound of RMFF-WC is as good as that of its static counterpart  RMFF studied by Dhall and Liu. (4) A new scheduling heuristic  RMBF-WC is proposed and its worst-case performance investigated.

Yingfeng Oh | Sang Son | S. Son | Y. Oh

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

[2] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .

[3] Edward G. Coffman,et al. Computer and job-shop scheduling theory , 1976 .

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

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

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

[7] Omri Serlin,et al. Scheduling of time critical processes , 1899, AFIPS '72 (Spring).

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

[9] David S. Johnson,et al. Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

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

[11] John P. Lehoczky,et al. The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.