(0)
Overview: 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 research 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.
How to Build High Availability Shared Storage for Hyper-V
This whitepaper describes how to increase the application availability of Hyper-V virtual servers by configuring not only the clustering of the...
Data Protection Strategies Using Replication
This paper examines four data protection strategies and compares their merits for the most common business continuance scenarios.
|
