Name
Abstract | ||
|---|---|---|
Each processor in a uniform multiprocessor machine ischaracterized by a speed or computing capacity, with theinterpretation that a job executing on a processor with speeds for t time units completes (s X t) units of execution.Theon-line scheduling of hard-real-time systems, in which alljobs must complete by specified deadlines, on uniformmultiprocessor machines is considered.It is known that on-line algorithms tend to perform very poorly in schedulingsuch hard-real-time systems on multiprocessors; resource-augmentation techniques are presented here thatpermit on-line algorithms to perform better than may be expectedgiven the inherent limitations.Results derived here are appliedto the scheduling of periodic task systems on uniformmultiprocessor machines. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/REAL.2001.990609 | RTSS |
Keywords | Field | DocType |
theon-line scheduling,resource-augmentation technique,on-line algorithm,inherent limitation,uniform multiprocessors,on-line scheduling,thatpermit on-line algorithm,hard-real-time system,uniformmultiprocessor machine,periodic task system,schedulingsuch hard-real-time system,computing capacity | Fixed-priority pre-emptive scheduling,Multiprocessor scheduling,Fair-share scheduling,Computer science,Parallel computing,Two-level scheduling,Real-time computing,Least slack time scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-1420-0 | 71 | 5.44 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shelby Funk | 1 | 348 | 23.89 |
| Joel Goossens | 2 | 84 | 7.47 |
| Sanjoy K. Baruah | 3 | 4664 | 374.79 |