This Article 
 Bibliographic References 
 Add to: 
An Algorithm for Scheduling Jobs in Hypercube Systems
September 1998 (vol. 9 no. 9)
pp. 856-860

Abstract—In this paper, we consider the problem of nonpreemptively scheduling independent jobs so as to minimize overall finish time on an m-dimensional hypercube system. This problem is NP-hard. We propose a polynomial time approximation algorithm and prove that the absolute performance ratio of the algorithm does not exceed 1.875. This is the first algorithm achieving an absolute performance ratio less than two by a constant.

[1] G. Chen and T. Lai, "Scheduling Independent Jobs on Partitionable Hypercubes," J. Parallel and Distributed Computing, vol. 12, pp. 74-78, 1991.
[2] M.R. Garey and D.S. Johnson, Computers and Intractability.San Francisco: Freeman Publishing Co., 1979.
[3] Y. Zhu and M. Ahuja, "On Job Scheduling on a Hypercube," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 1, pp. 62-69, Jan. 1993.

Index Terms:
Hypercube systems, job scheduling, subcube allocation, approximation algorithm, absolute performance ratio.
Oh-Heum Kwon, Kyung-Yong Chwa, "An Algorithm for Scheduling Jobs in Hypercube Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 9, pp. 856-860, Sept. 1998, doi:10.1109/71.722219
Usage of this product signifies your acceptance of the Terms of Use.