An Algorithm for Scheduling Jobs in Hypercube Systems

Authors:
Oh-Heum Kwon;Kyung-Yong Chwa
Affiliations:
Pukyong National Univ., Republic of Korea;KAIST, Republic of Korea
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1998

Citing 3
Cited 3

Scheduling independent jobs on partitionable hypercubes

Journal of Parallel and Distributed Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On Job Scheduling on a Hypercube

IEEE Transactions on Parallel and Distributed Systems

Job preemption, fast subcube compaction, or waiting in hypercube systems? a selection methodology

Parallel Computing
Improving grid performance through processor allocation considering both speed heterogeneity and resource fragmentation

The Journal of Supercomputing
On the weak computability of a four dimensional orthogonal packing and time scheduling problem

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.