D-SPTF: decentralized request distribution in brick-based storage systems

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. Categories and Subject Descriptors H.3.4 [Information Storage and Retrieval]: Systems and Software—distributed systems, Performance evaluation General Terms Management, Performance Keywords Storage systems, Brick Based Storage, Distributed ...

• Type: Conference
• Year: 2004
• Where: ASPLOS
• Authors: Christopher R. Lumb, Richard A. Golding
• Keywords: Aggregate Cache Capacity, ASPLOS 2004, Keywords Storage Systems, Popular Decentralized Approaches, Programming Languages