Shelby Funk, Joel Goossens, Sanjoy Baruah, "On-Line Scheduling on Uniform Multiprocessors," 2011 IEEE 32nd Real-Time Systems Symposium, pp. 183, 22nd IEEE Real-Time Systems Symposium (RTSS'01), 2001.

@article{ 10.1109/REAL.2001.990609,
author = {Shelby Funk and Joel Goossens and Sanjoy Baruah},
title = {On-Line Scheduling on Uniform Multiprocessors},
journal ={2011 IEEE 32nd Real-Time Systems Symposium},
volume = {0},
year = {2001},
isbn = {0-7695-1420-0},
pages = {183},
doi = {http://doi.ieeecomputersociety.org/10.1109/REAL.2001.990609},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}

TY - CONF
JO - 2011 IEEE 32nd Real-Time Systems Symposium
TI - On-Line Scheduling on Uniform Multiprocessors
SN - 0-7695-1420-0
SP
EP
A1 - Shelby Funk,
A1 - Joel Goossens,
A1 - Sanjoy Baruah,
PY - 2001
KW - Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity
KW - with the interpretation that a job executing on a processor with speed s for t time units completes (s X t) units of execution. The on-line scheduling of hard-real-time systems
KW - in which all jobs must complete by specified deadlines
KW - on uniform multiprocessor machines is considered. It is known that online algorithms tend to perform very poorly in scheduling such hard-real-time systems on multiprocessors; resource-augmentation techniques are presented here that permit on-line algorithms to perform better than may be expected given the inherent limitations. Results derived here are applied to the scheduling of periodic task systems on uniform multiprocessor machines.
VL - 0
JA - 2011 IEEE 32nd Real-Time Systems Symposium
ER -