Title
Programmable temporal isolation through variable-bandwidth servers
Abstract
We introduce variable-bandwidth servers (VBS) for scheduling and executing processes under programmable temporal isolation. A VBS is an extension of a constant-bandwidth server where throughput and latency of process execution can not only be controlled to remain constant across different competing workloads but also to vary in time as long as the resulting bandwidth stays below a given bandwidth cap. We have designed and implemented a VBS-based EDF-style constant-time scheduling algorithm, a constant-time admission test, and four alternative queue management plugins which influence the scheduling algorithm's overall temporal and spatial complexity. Experiments confirm the theoretical bounds in a number of microbenchmarks and demonstrate that the scheduler can effectively manage in constant time any number of processes up to available memory while maintaining response times of individual processes within a bounded range. We have also developed a small-footprint, bare-metal virtual machine that uses VBS for temporal isolation of multiple, concurrently running processes executing real code.
Year
DOI
Venue
2009
10.1109/SIES.2009.5196213
Lausanne
Keywords
Field
DocType
computational complexity,network servers,queueing theory,scheduling,VBS-based EDF-style constant-time scheduling,constant bandwidth server,constant-time admission test,process execution,programmable temporal isolation,queue management plugins,scheduling algorithm,spatial complexity,temporal complexity,variable bandwidth server
Scheduling (computing),Temporal isolation,Computer science,Server,Real-time computing,Bandwidth (signal processing),Queueing theory,Bandwidth cap,Queue management system,Throughput,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-4244-4110-5
8
0.51
References 
Authors
24
5
Name
Order
Citations
PageRank
Silviu S. Craciunas113111.80
christoph m kirsch252649.50
Hannes Payer320416.35
Harald Röck4604.96
Ana Sokolova525418.88