Journal of the ACM (JACM)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Scheduling for quality of service guarantees via service curves
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
pClock: an arrival curve based approach for QoS guarantees in shared storage systems
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Workload decomposition for QoS in hosted storage services
Proceedings of the 3rd workshop on Middleware for service oriented computing
Graduated QoS by Decomposing Bursts: Don't Let the Tail Wag Your Server
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Everest: scaling down peak loads through I/O off-loading
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
mClock: handling throughput variability for hypervisor IO scheduling
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
QoS in Packet Networks
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
pCloud: an adaptive i/o resource allocation algorithm with revenue consideration over public clouds
GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
| Hi-index | 0.00 |
The increasing popularity of storage and server consolidation introduces new challenges for resource management. In this paper we propose a Nested QoS service model that offers multiple response time guarantees for a workload based on its burstiness. The client workload is filtered into classes based on the Service Level Objective (SLO) and scheduled to provide requests in each class a stipulated response time guarantee. The Nested QoS model provides an intuitive, enforceable, and verifiable SLO between provider and client. The server capacity in the nested model is reduced significantly over a traditional SLO while the performance is only marginally affected.