TY - GEN
T1 - Greedy reclamation of unused bandwidth in constant-bandwidth servers
AU - Lipari, G.
AU - Baruah, S.
PY - 2000
Y1 - 2000
N2 - A framework for scheduling a number of different applications on a single shared pre-emptable processor is proposed, such that each application seems to be executing on a slower dedicated processor. A tradeoff is identified and evaluated between how precise a notion of real time (as measured by the granularity of its clock) an application needs to have supported on the one hand, and the added context-switch costs imposed by our scheduling framework on the other.
AB - A framework for scheduling a number of different applications on a single shared pre-emptable processor is proposed, such that each application seems to be executing on a slower dedicated processor. A tradeoff is identified and evaluated between how precise a notion of real time (as measured by the granularity of its clock) an application needs to have supported on the one hand, and the added context-switch costs imposed by our scheduling framework on the other.
KW - Bandwidth reclamation
KW - Constant-bandwidth server
KW - Earliest deadline first
KW - Inter-application isolation
KW - Preemptive scheduling
UR - https://www.scopus.com/pages/publications/0000395452
U2 - 10.1109/EMRTS.2000.854007
DO - 10.1109/EMRTS.2000.854007
M3 - Conference contribution
AN - SCOPUS:0000395452
SN - 0769507344
SN - 9780769507347
T3 - Proceedings - Euromicro Conference on Real-Time Systems
SP - 193
EP - 200
BT - Proceedings - 12th Euromicro Conference on Real-Time Systems, ECRTS 2000
T2 - 12th Euromicro Conference on Real-Time Systems, ECRTS 2000
Y2 - 19 June 2000 through 21 June 2000
ER -