Online deadline scheduling on faster machines
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chwa, Kyung Yong | ko |
| dc.date.accessioned | 2013-03-03T14:20:09Z | - |
| dc.date.available | 2013-03-03T14:20:09Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 2003-01 | - |
| dc.identifier.citation | INFORMATION PROCESSING LETTERS, v.85, no.1, pp.31 - 37 | - |
| dc.identifier.issn | 0020-0190 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/79054 | - |
| dc.description.abstract | Online deadline scheduling is to determine which jobs are accepted or rejected, where jobs have the deadline by which they must finish their processing and they arrive in the online fashion. The slack of a job is the gap between its arrival time and the last time when it can first be scheduled to meet its deadline. The job instance is given such that the slack of each job is at least kappa times its processing time, where kappa is called patience. In this paper, online algorithms have faster machines than the adversary. We investigate the speed of machines on which the online algorithms can achieve the optimality and parametrize them by the patience. (C) 2002 Elsevier Science B.V All rights reserved. | - |
| dc.language | English | - |
| dc.publisher | Elsevier Science Bv | - |
| dc.title | Online deadline scheduling on faster machines | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000180370700006 | - |
| dc.identifier.scopusid | 2-s2.0-0037448293 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 85 | - |
| dc.citation.issue | 1 | - |
| dc.citation.beginningpage | 31 | - |
| dc.citation.endingpage | 37 | - |
| dc.citation.publicationname | INFORMATION PROCESSING LETTERS | - |
| dc.contributor.localauthor | Chwa, Kyung Yong | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | scheduling | - |
| dc.subject.keywordAuthor | online algorithms | - |
- 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 |  |
| ⊙ Cited 2 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.