Interposed request routing for scalable network storage
ACM Transactions on Computer Systems (TOCS)
Active disk paxos with infinitely many processes
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Distributed Computing with Load-Managed Active Storage
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Atomic writes for data integrity and consistency in shared storage devices for clusters
Future Generation Computer Systems - Special issue: Advanced services for clusters and internet computing
D-SPTF: decentralized request distribution in brick-based storage systems
ASPLOS XI Proceedings of the 11th international conference on Architectural support for programming languages and operating systems
Multi-level RAID for very large disk arrays
ACM SIGMETRICS Performance Evaluation Review - Design, implementation, and performance of storage systems
Active disk Paxos with infinitely many processes
Distributed Computing - Special issue: PODC 02
Light-weight leases for storage-centric coordination
International Journal of Parallel Programming
FAB: enterprise storage systems on a shoestring
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Interposed request routing for scalable network storage
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Dynamic function placement for data-intensive cluster computing
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
Theoretical Computer Science
Extensible block-level storage virtualization in cluster-based systems
Journal of Parallel and Distributed Computing
Walking toward moving goalposts: agile management for evolving systems
HotACI'06 Proceedings of the First international conference on Hot topics in autonomic computing
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
iSAN: an intelligent storage area network architecture
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
An on-line reorganization framework for SAN file systems
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Hierarchical RAID: Design, performance, reliability, and recovery
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Switched system-area networks enable thousands of storage devices to be shared and directly accessed by end hosts, promising databases and file systems highly scalable, reliable storage. In such systems, hosts perform access tasks (read and write) and management tasks (storage migration and reconstruction of data on failed devices.) Each task translates into multiple phases of low-level device I/Os, so that concurrent host tasks accessing shared devices can corrupt redundancy codes and cause hosts to read inconsistent data. Concurrency control protocols that scale to large system sizes are required in order to coordinate on-line storage management and access tasks.In this paper, we identify the tasks that storage controllers must perform, and propose an approach which allows these tasks to be composed from basic operations-called base storage transactions (BSTs)-such that correctness requires only the serializability of the BSTs and not of the parent tasks. We present highly scalable distributed protocols, which exploit storage technology trends and BST properties to achieve serializability while coming within a few percent of ideal performance.