An Algorithm for Scheduling Jobs in Hypercube System

Cited 8 time in webofscience Cited 0 time in scopus
  • Hit : 139
  • Download : 0
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.
Publisher
IEEE Computer Soc
Issue Date
1998-01
Language
English
Article Type
Article
Citation

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, v.9, no.9, pp.856 - 860

ISSN
1045-9219
URI
http://hdl.handle.net/10203/69235
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 8 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0