论文信息 - Improved 0/1-interchange scheduling

Improved 0/1-interchange scheduling

Consideration is given to the problem of nonpreemptively scheduling a set ofN independent tasks to a system ofM identical processors, with the objective to minimize the overall finish time. It is proved that the 0/1-INTERCHANGE scheduling heuristic can be modified, without increasing its time complexity fromO(N logM), so that its worst-case performance bound is reduced from 2 to 4/3 times optimal.

Michael A. Langston | M. A. Langston

[1] Michael Allen Langston,et al. Processor scheduling with improved heuristic algorithms , 1981 .

[2] Ellis Horowitz,et al. A linear time approximation algorithm for multiprocessor scheduling , 1979 .

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

[4] W. Issel,et al. Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,– , 1979 .

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

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .