论文信息 - Bounds for LPT Schedules on Uniform Processors - 字舞流文

Bounds for LPT Schedules on Uniform Processors

We study the performance of LPT (largest processing time) schedules with respect to optimal schedules in a nonpreemptive multiprocessor environment. The processors are assumed to have different speeds and the tasks being scheduled are independent.

Oscar H. Ibarra | Teofilo F. Gonzalez | Sartaj Sahni | S. Sahni | O. Ibarra | T. Gonzalez

[1] Ellis Horowitz,et al. Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.

[2] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[3] Jane W.-S. Liu,et al. Bounds on Scheduling Algorithms for Heterogeneous Comnputing Systems , 1974, IFIP Congress.

[4] Edward G. Coffman,et al. An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[5] Edward G. Coffman,et al. Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[6] Peter J. Denning,et al. Operating Systems Theory , 1973 .

[7] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[8] Jane W.-S. Liu,et al. Optimal scheduling of independent tasks on heterogeneous computing systems , 1974, ACM '74.