Analysis of striping techniques in robotic storage libraries
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10519173,p. 225-238
- https://doi.org/10.1109/mass.1995.528232
Abstract
In recent years advances in computational speed have been the main focus of research and development in high performance computing. In comparison, the improvement in I/O performance has been modest. Faster processing speeds have created a need for faster I/O as well as for the storage and retrieval of vast amounts of data. The technology needed to develop these mass storage systems exists today. Robotic storage libraries are vital components of such systems. However, they normally exhibit high latency and long transmission times. We analyze the performance of robotic storage libraries and study striping as a technique for improving response time. Although striping has been extensively studied in the content of disk arrays, the architectural differences between robotic storage libraries and arrays of disks suggest that a separate study of striping techniques in such libraries would be beneficial.Keywords
This publication has 10 references indexed in Scilit:
- Striped tape arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- High-performance data transfers using network-attached peripherals at the National Storage LaboratoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Extracting spatio-temporal patterns from geoscience datasetsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Maximizing performance in a striped disk arrayPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Staggered striping in multimedia information systemsPublished by Association for Computing Machinery (ACM) ,1994
- Striping in large tape librariesPublished by Association for Computing Machinery (ACM) ,1993
- The high performance storage systemPublished by Association for Computing Machinery (ACM) ,1993
- A case for redundant arrays of inexpensive disks (RAID)Published by Association for Computing Machinery (ACM) ,1988
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- A Proof for the Queuing Formula: L = λWOperations Research, 1961