File and Network Servers White Papers
Proportional Service Allocation in Distributed Storage Systems
Overview 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.
| Publisher | Hewlett-Packard (HP) | File Format | |
|---|---|---|---|
| Date Published | December 2006 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 2 out of 4 users found this white paper useful
White Paper RSS
Download
Register
