A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
The HP AutoRAID hierarchical storage system
ACM Transactions on Computer Systems (TOCS) - Special issue on operating system principles
Petal: distributed virtual disks
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Implementing cooperative prefetching and caching in a globally-managed memory system
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Locality-aware request distribution in cluster-based network servers
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Cluster I/O with River: making the fast case common
Proceedings of the sixth workshop on I/O in parallel and distributed systems
A performance study of three high availability data replication strategies
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
Freeblock Scheduling Outside of Disk Firmware
FAST '02 Proceedings of the Conference on File and Storage Technologies
Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines
Proceedings of the Sixth International Conference on Data Engineering
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Highly Concurrent Shared Storage
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Design and Implementation of Semi-preemptible IO
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
FAB: enterprise storage systems on a shoestring
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Multi-level RAID for very large disk arrays
ACM SIGMETRICS Performance Evaluation Review - Design, implementation, and performance of storage systems
CRUSH: controlled, scalable, decentralized placement of replicated data
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Ceph: a scalable, high-performance distributed file system
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
RobuSTore: a distributed storage architecture with robust and high performance
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
RADOS: a scalable, reliable storage service for petabyte-scale storage clusters
PDSW '07 Proceedings of the 2nd international workshop on Petascale data storage: held in conjunction with Supercomputing '07
Kinesis: A new approach to replica placement in distributed storage systems
ACM Transactions on Storage (TOS)
On evaluating decentralized parallel I/O scheduling strategies for parallel file systems
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Extensible block-level storage virtualization in cluster-based systems
Journal of Parallel and Distributed Computing
Communications of the ACM
ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
| Hi-index | 0.02 |
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.