Download:
|
by Cynthia A. Phillips, Cli Stein, Eric Torng, Joel Wein
http://web.cps.msu.edu/~torng/Research/Pubs/extra-resources.ps
Add To MetaCart
Abstract:
We consider two fundamental problems in dynamic scheduling: scheduling to meet deadlines in a preemptive multiprocessor setting, and scheduling to provide good response time in a number of scheduling environments. When viewed from the perspective of traditional worst-case analysis, no good on-line algorithms exist for these problems, and for some variants no good oine algorithms exist unless P = NP. We study these problems using a relaxed notion of competitive analysis, introduced by Kalyanasundaram and Pruhs, in which the on-line algorithm is allowed more resources than the optimal oine algorithm to which it is compared. Using this approach, we establish that several well-known on-line algorithms, that have poor performance from an absolute worst-case perspective, are optimal for the problems in question when allowed moderately more resources. For the optimization of average ow time, these are the rst results of any sort, for any NP-hard version of the problem,
Citations
|
165
|
Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms
– Hall, Schulz, et al.
- 1997
|
|
150
|
Control robotics : the procedural control of physical processors
– Dertouzos
- 1974
|
|
122
|
Speed is as powerful as clairvoyance
– Pruhs, Kalyanasundaram
- 1995
|
|
122
|
Scheduling parallel machines online
– Shmoys, Wein, et al.
- 1995
|
|
102
|
Bounds for certain multiprocessor anomalies. Bell System Technical Journal 45
– Graham
- 2001
|
|
99
|
Multiprocessor On-Line Scheduling of Hard Real-Time Tasks
– Dertouzos, Mok
- 1989
|
|
87
|
Flow and stretch metrics for scheduling continuous job streams
– Bender, Chakrabarti, et al.
- 1998
|
|
74
|
Non-clairvoyant scheduling
– Motwani, Phillips, et al.
- 1994
|
|
67
|
Improved scheduling algorithms for minsum criteria
– Chakrabarti, Phillips, et al.
- 1996
|
|
55
|
Improved Approximation Algorithms for Scheduling with Release Dates
– GOEMANS
- 1997
|
|
51
|
Approximation schemes for minimizing average weighted completion time with release dates
– Afrati, Bampis, et al.
- 1999
|
|
51
|
Approximability and nonapproximability results for minimizing total flow time on a single machine
– Kellerer, Tautenhahn, et al.
- 1996
|
|
43
|
Scheduling jobs that arrive over time
– Phillips, Stein, et al.
- 1995
|
|
40
|
Scheduling in the dark
– Edmonds
- 1999
|
|
38
|
MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
– Koren, Shasha, et al.
- 1993
|
|
34
|
Single machine scheduling with release dates
– Goemans, Queyranne, et al.
- 1999
|
|
31
|
Optimal on-line algorithms for single-machine scheduling
– Hoogeveen, Vestjens
- 1996
|
|
28
|
A supermodular relaxation for scheduling with release dates
– Goemans
- 1996
|
|
22
|
Scheduling for overload in real-time systems
– Baruah, Harista
- 1997
|
|
20
|
Maximizing job completions online
– Kalyanasundaram, Pruhs
|
|
20
|
Preemptive scheduling of uniform machines subject to release dates
– Labetoulle, Lawler, et al.
- 1984
|
|
14
|
Approximating total time on parallel machines
– Leonardi, Raz
- 1997
|
|
9
|
Nearly on line scheduling of a uniform processor system with release times
– Sahni, Cho
- 1979
|
|
8
|
Eliminating migration in multi-processor scheduling
– Kalyanasundaram, Pruhs
- 1999
|
|
8
|
Trade-os between speed and processor in hard-deadline scheduling
– Lam, To
- 1999
|
|
2
|
Speed is more powerfull than clairvoyance
– Coulston, Berman
- 1999
|
|
1
|
Patience is a virtue: The eect of slace on competitiveness for admission control
– Goldwasser
- 1999
|
|
1
|
Bounds for naive multiple machine scheduling with release times and deadlines
– Gus
- 1984
|
