Compared to existing decentralized approaches, such as hash-based request distribution, D-SPTF achieves up to 65% higher throughput and adapts more cleanly to ...
Distributed Shortest-Positioning Time First (D-SPTF) is a request distribution protocol for decentralized systems of storage servers.
ABSTRACT. Distributed Shortest-Positioning Time First (D-SPTF) is a request distribution protocol for decentralized systems of storage servers.
Compared to popular decentralized approaches, D-SPTF achieves up to 65% higher throughput and adapts more cleanly to heterogenous server capabilities.
Dec 1, 2004 · Distributed Shortest-Positioning Time First (D-SPTF) is a request distribution protocol for decentralized systems of storage servers.
Title, D-SPTF: Decentralized Request Distribution in Brick-based Storage Systems ; Author, Christopher R. Lumb ; Contributor, Carnegie Mellon University.
NSF Award Search: Award # 0326453 - ITR: Self-* Storage Systems
www.nsf.gov › awardsearch › showAward
Golding "D-SPTF: Decentralized request distribution in brick-based storage systems" ACM International Conference on Architectural Support for Programming ...
D-SPTF: decentralized request distribution in brick-based storage systems · Christopher R. LumbRichard A. Golding. Computer Science, Engineering. ASPLOS XI.
D-SPTF: Decentralized request distribution in brick-based storage systems. In Proceedings of the 11th International. Conference on Architectural Support for ...
DSPTF: Decentralized request distribution in brick-based storage systems. Proc. ASPLOS, October 2004. (pdf), Deepak R. Kenchammana-Hosekote, Richard A ...