Sciweavers

Share
FAST
2007

Proportional-Share Scheduling for Distributed Storage Systems

11 years 6 months ago
Proportional-Share Scheduling for Distributed Storage Systems
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 proportion...
Yin Wang, Arif Merchant
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where FAST
Authors Yin Wang, Arif Merchant
Comments (0)
books