Title :
An algorithm for scheduling jobs in hypercube systems
Author :
Kwon, Oh-Heum ; Chwa, Kyung-yong
Author_Institution :
Dept. of Comput. Eng., Pukyong Nat. Univ., Pusan, South Korea
fDate :
9/1/1998 12:00:00 AM
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
Keywords :
hypercube networks; processor scheduling; NP-hard; hypercube system; nonpreemptive scheduling; performance ratio; polynomial time approximation; Approximation algorithms; Communication channels; Computer networks; Hypercubes; Optimized production technology; Polynomials; Processor scheduling; Scheduling algorithm; Virtual manufacturing;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
