Name
Abstract | ||
|---|---|---|
The paper addresses the problem of providing performance QoS guarantees in a clustered storage system. Multiple related storage objects are grouped into logical containers called buckets, which are distributed over the servers based on the placement policies of the storage system. QoS is provided at the level of buckets. The service credited to a bucket is the aggregate of the IOs received by its objects at all the servers. The service depends on individual time-varying demands and congestion at the servers. We present a token-based, coarse-grained approach to providing IO reservations and limits to buckets. We propose pShift, a novel token allocation algorithm that works in conjunction with token-sensitive scheduling at each server to control the aggregate IOs received by each bucket on multiple servers. pShift determines the optimal token distribution based on the estimated bucket demands and server IOPS capacities. Compared to existing approaches, pShift has far smaller overhead, and can be accelerated using parallelization and approximation. Our experimental results show that pShift provides accurate QoS among the buckets with different access patterns, and handles runtime demand changes well. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/MSST.2019.00-19 | 2019 35th Symposium on Mass Storage Systems and Technologies (MSST) |
Keywords | Field | DocType |
distributed storage,coarse-grained QoS,reservations,limits,token based scheduling | Scheduling (computing),IOPS,Computer science,Server,Distributed data store,Quality of service,Computer network,Dynamic priority scheduling,Security token,Scalability | Conference |
ISSN | ISBN | Citations |
2160-195X | 978-1-7281-3921-0 | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuhan Peng | 1 | 2 | 1.44 |
| Qingyue Liu | 2 | 0 | 1.35 |
| Peter J. Varman | 3 | 700 | 83.23 |