d-clock: distributed QoS in heterogeneous resource environments
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A nine year study of file system and storage benchmarking
ACM Transactions on Storage (TOS)
Towards distributed storage resource management using flow control
ACM SIGOPS Operating Systems Review
Traveling to Rome: a retrospective on the journey
ACM SIGOPS Operating Systems Review
Dynamic resource allocation for database servers running on virtual storage
FAST '09 Proccedings of the 7th conference on File and storage technologies
PARDA: proportional allocation of resources for distributed storage access
FAST '09 Proccedings of the 7th conference on File and storage technologies
Dynamic storage cache allocation in multi-server architectures
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Automated control for elastic storage
Proceedings of the 7th international conference on Autonomic computing
Adaptive multi-level cache allocation in distributed storage architectures
Proceedings of the 24th ACM International Conference on Supercomputing
Horizon: efficient deadline-driven disk I/O management for distributed storage systems
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
mClock: handling throughput variability for hypervisor IO scheduling
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
Differentiated storage services
ACM SIGOPS Operating Systems Review
Maestro: quality-of-service in large disk arrays
Proceedings of the 8th ACM international conference on Autonomic computing
Italian for beginners: the next steps for SLO-based management
HotStorage'11 Proceedings of the 3rd USENIX conference on Hot topics in storage and file systems
Differentiated storage services
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Server-side I/O coordination for parallel file systems
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Virtual I/O caching: dynamic storage cache management for concurrent workloads
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Demand based hierarchical QoS using storage resource pools
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Gdev: first-class GPU resource management in the operating system
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Dynamic global resource allocation in shared data centers and clouds
CASCON '12 Proceedings of the 2012 Conference of the Center for Advanced Studies on Collaborative Research
Responding rapidly to service level violations using virtual appliances
ACM SIGOPS Operating Systems Review
VGRIS: virtualized GPU resource isolation and scheduling in cloud gaming
Proceedings of the 22nd international symposium on High-performance parallel and distributed computing
IBIS: interposed big-data I/O scheduler
Proceedings of the 22nd international symposium on High-performance parallel and distributed computing
Fuzzy adaptive control for heterogeneous tasks in high-performance storage systems
Proceedings of the 6th International Systems and Storage Conference
Balancing fairness and efficiency in tiered storage systems with bottleneck-aware allocation
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
| Hi-index | 0.00 |
Fully distributed storage systems have gained popularity in the past few years because of their ability to use cheap commodity hardware and their high scalability. While there are a number of algorithms for providing differentiated quality of service to clients of a centralized storage system, the problem has not been solved for distributed storage systems. Providing performance guarantees in distributed storage systems is more complex because clients may have different data layouts and access their data through different coordinators (access nodes), yet the performance guarantees required are global. This paper presents a distributed scheduling framework. It is an adaptation of fair queuing algorithms for distributed servers. Specifically, upon scheduling each request, it enforces an extra delay (possibly zero) that corresponds to the amount of service the client gets on other servers. Different performance goals, e.g., per storage node proportional sharing, total service proportional sharing or mixed, can be met by different delay functions. The delay functions can be calculated at coordinators locally so excess communication is avoided. The analysis and experimental results show that the framework can enforce performance goals under different data layouts and workloads.