Name
Abstract | ||
|---|---|---|
Distributed Shortest-Positioning Time First (D-SPTF) is a request distribution protocol for decentralized systems of storage servers. D-SPTF exploits high-speed interconnects to dynamically select which server, among those with a replica, should service each read request. In doing so, it simultaneously balances load, exploits the aggregate cache capacity, and reduces positioning times for cache misses. For network latencies expected in storage clusters (e.g., 10--200μs), D-SPTF performs as well as would a hypothetical centralized system with the same collection of CPU, cache, and disk resources. Compared to popular decentralized approaches, D-SPTF achieves up to 65% higher throughput and adapts more cleanly to heterogenous server capabilities.
|
Year | DOI | Venue |
|---|---|---|
2004 | 10.1145/1037949.1024399 | D-sptf: decentralized request distribution in brick-based storage systems |
Keywords | Field | DocType |
brick-based storage system,request distribution protocol,decentralized request distribution,decentralized request distribution protocol,heterogenous server capability,storage systems,disk scheduling,storage cluster,central control,decentralized systems,request distribution,aggregate cache capacity,request scheduling decision,popular decentralized approach,brick based storage,time first,decentralized system,load balancing,hash-based request distribution,read request,disk resource,distributed systems,storage server,good cache performance,cache performance,storage system,computer storage devices | Replica,Decentralised system,I/O scheduling,Computer data storage,Computer science,Cache,Server,Real-time computing,Exploit,Throughput | Conference |
Volume | Issue | ISSN |
38 | 5 | 0163-5980 |
ISBN | Citations | PageRank |
0-542-46570-1 | 14 | 3.16 |
References | Authors | |
12 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christopher R. Lumb | 1 | 328 | 21.27 |
| richard a golding | 2 | 14 | 3.16 |