Non-clairvoyant scheduling for weight flow time

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 229
  • Download : 0
A non-clairvoyant scheduler makes decisions having no knowledge of jobs. It does not know when the jobs will arrive in the future, that is. it is online, and how long the jobs will be executed after they arrive. For non-clairvoyant scheduling, we first study the problem to minimize the total stretch. And we also consider the case in which the weights of jobs are known when they arrive, while their lengths are still unknown. In this case, we find a schedule to minimize the total weighted flow time. The weighted versions of well-known algorithms, Round Robin and Balance, are investigated. (C) 2003 Published by Elsevier Science B.V.
Publisher
Elsevier Science Bv
Issue Date
2003-07
Language
English
Article Type
Article
Citation

INFORMATION PROCESSING LETTERS, v.87, no.1, pp.31 - 37

ISSN
0020-0190
URI
http://hdl.handle.net/10203/78501
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 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0