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 th...
We study a new design strategy for the implementation of Parallel Media Servers with a predictable b...
Interactions amongst different processes in concurrent software are governed by a protocol. The bloc...
This paper presents a new approach to window-constrained scheduling, suitable for multimedia and wea...
Abstract—We introduce variable-bandwidth servers (VBS) for scheduling and executing processes under ...
Today's consumer electronic devices feature multiple applications which have to share scarcely avail...
Abstract. In this paper we tackle the problem of providing Quality of Service guarantees to virtuali...
In this paper we tackle the problem of providing Quality of Service guarantees to virtualized applic...
This paper describes the scheduling framework for a new operating system called "Quest". The three m...
This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guarante...
This dissertation presents techniques to achieve predictable execution of coarse-grained software co...
A dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers...
In this paper we deal with a scheduling algorithm that creates several virtual links on one physical...
We propose and develop a novel virtual time reference system as a unifying scheduling framework to p...
In this paper the problem of providing network response guarantees to multiple Virtual Machines (VMs...
We study a new design strategy for the implementation of Parallel Media Servers with a predictable b...
Interactions amongst different processes in concurrent software are governed by a protocol. The bloc...
This paper presents a new approach to window-constrained scheduling, suitable for multimedia and wea...
Abstract—We introduce variable-bandwidth servers (VBS) for scheduling and executing processes under ...
Today's consumer electronic devices feature multiple applications which have to share scarcely avail...
Abstract. In this paper we tackle the problem of providing Quality of Service guarantees to virtuali...
In this paper we tackle the problem of providing Quality of Service guarantees to virtualized applic...
This paper describes the scheduling framework for a new operating system called "Quest". The three m...
This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guarante...
This dissertation presents techniques to achieve predictable execution of coarse-grained software co...
A dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers...
In this paper we deal with a scheduling algorithm that creates several virtual links on one physical...
We propose and develop a novel virtual time reference system as a unifying scheduling framework to p...
In this paper the problem of providing network response guarantees to multiple Virtual Machines (VMs...
We study a new design strategy for the implementation of Parallel Media Servers with a predictable b...
Interactions amongst different processes in concurrent software are governed by a protocol. The bloc...
This paper presents a new approach to window-constrained scheduling, suitable for multimedia and wea...