Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
暂无分享,去创建一个
The finishing time properties of several heuristic algorithms for scheduling <italic>n</italic> independent tasks on <italic>m</italic> nonidentical processors are studied. In particular, for <italic>m</italic> = 2 an <italic>n</italic> log <italic>n</italic> time-bounded algorithm is given which generates a schedule having a finishing time of at most (√5 + 1)/2 of the optimal finishing time. A simplified scheduling problem involving identical processors and restricted task sets is shown to be P-complete. However, the LPT algorithm applied to this problem yields schedules which are near optimal for large <italic>n</italic>.
[1] Sartaj Sahni,et al. Computationally Related Problems , 1974, SIAM J. Comput..
[2] Oscar H. Ibarra,et al. Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..
[3] Edward G. Coffman,et al. Scheduling independent tasks to reduce mean finishing time , 1974, CACM.
[4] Edward G. Coffman,et al. A generalized bound on LPT sequencing , 1976, SIGMETRICS '76.
[5] Ellis Horowitz,et al. Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.