DocumentCode
2186155
Title
Greedy reclamation of unused bandwidth in constant-bandwidth servers
Author
Lipari, Giuseppe ; Baruah, Sanjoy
Author_Institution
Scuola Normale Superiore, Pisa, Italy
fYear
2000
fDate
2000
Firstpage
193
Lastpage
200
Abstract
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
Keywords
clocks; multi-threading; network servers; real-time systems; scheduling; application scheduling; clock granularity; constant-bandwidth servers; context-switch costs; earliest deadline first scheduling; greedy bandwidth reclamation; inter-application isolation; preemptive scheduling; real-time systems; shared preemptable processor; slow dedicated processor; tradeoff; Application software; Bandwidth; Clocks; Concurrent computing; Contracts; Costs; Degradation; Processor scheduling; Scheduling algorithm; Yarn;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time Systems, 2000. Euromicro RTS 2000. 12th Euromicro Conference on
Conference_Location
Stockholm
ISSN
1068-3070
Print_ISBN
0-7695-0734-4
Type
conf
DOI
10.1109/EMRTS.2000.854007
Filename
854007
Link To Document