Download:
|
by Chiu-yuen Koo, Tak-wah Lam, Tsuen-wan \johnny Ngan
http://www.cs.rice.edu/~twngan/doc/tocs37.ps
Add To MetaCart
Abstract:
This paper is concerned with the design of online scheduling algorithms that exploit extra resources. In particular, it studies how to make use of multiple processors to counteract the lack of future information in online deadline scheduling. Our results extend the previous work that are primarily based on using a faster processor to obtain a performance guarantee. The challenge arises from the fact that jobs are sequential in nature and cannot be executed on more than one processor at the same time. Thus, a faster processor can speed up a job while multiple unit-speed processors cannot. 1
Citations
|
429
|
Online computation and competitive analysis
– Borodin, El-Yaniv
- 1998
|
|
150
|
Control robotics : the procedural control of physical processors
– Dertouzos
- 1974
|
|
122
|
Speed is as powerful as clairvoyance
– Pruhs, Kalyanasundaram
- 1995
|
|
99
|
Multiprocessor On-Line Scheduling of Hard Real-Time Tasks
– Dertouzos, Mok
- 1989
|
|
92
|
D-Over: An Optimal On-Line Scheduling Algorithm for Overloaded Real-Time Systems
– Koren, Shasha
- 1992
|
|
91
|
Optimal timecritical scheduling via resource augmentation
– Phillips, Stein, et al.
- 1997
|
|
64
|
Deadline Scheduling for Real-time systems: EDF and Related Algorithms
– Stankovic, Spuri, et al.
- 1998
|
|
63
|
On-line scheduling in the presence of overload
– Baruah, Koren, et al.
- 1991
|
|
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
|
|
26
|
Speed is more powerful than clairvoyance
– Berman, Coulston
- 1999
|
|
26
|
On-line scheduling --- a survey
– Sgall
- 1998
|
|
20
|
Maximizing job completions online
– Kalyanasundaram, Pruhs
|
|
10
|
Overload Tolerance for Single-Processor Workloads
– Baruah
- 1998
|
|
10
|
Trade-offs between speed and processor in hard-deadline scheduling
– Lam, To
- 1999
|
|
9
|
Applying extra-resource analysis to load balancing
– Brehob, Torng, et al.
- 2000
|
|
9
|
On-line real-time preemptive scheduling of jobs with deadlines on multiple machines, Journal of Scheduling
– DasGupta, Palis
- 2001
|
|
8
|
Eliminating migration in multi-processor scheduling
– Kalyanasundaram, Pruhs
- 1999
|
|
8
|
Trade-os between speed and processor in hard-deadline scheduling
– Lam, To
- 1999
|
|
7
|
Preemptive scheduling in overloaded systems
– Chrobak, Epstein, et al.
- 2002
|
|
7
|
The power of migration in multiprocessor scheduling of real-time systems
– Koren, Dar, et al.
- 1998
|
|
7
|
Performance Guarantee for Online Deadline Scheduling in the Presence of Overload
– Lam, To
- 2001
|
|
4
|
On the competitiveness of on-line task real-time task scheduling
– Baruah, Koren, et al.
- 1992
|
|
4
|
On the speed requirement for optimal deadline scheduling in overloaded systems
– Lam, Ngan, et al.
- 2001
|
|
3
|
On-line scheduling a survery
– Sgall
- 1998
|
|
2
|
A uni analysis of hot video schedulers
– Chan, Lam, et al.
- 2002
|
