loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
20th IEEE International Conference on Distributed Computing Systems (ICDCS'00)
Highly Concurrent Shared Storage
Taipei, Taiwan
April 10-April 13
ISBN: 0-7695-0601-1
Khalil Amiri, Carnegie Mellon University
Garth A. Gibson, Carnegie Mellon University
Richard Golding, Hewlett-Packard Laboratories
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.
Citation:
Khalil Amiri, Garth A. Gibson, Richard Golding, "Highly Concurrent Shared Storage," icdcs, pp.298, 20th IEEE International Conference on Distributed Computing Systems (ICDCS'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.