(Enter summary)
Abstract: We propose a new method of ensuring the redundant
storage of information on tertiary storage, especially tape
storage. Conventional methods for redundant data storage
on tape include mirroring (storing the data twice) and
Redundant Arrays of Inexpensive Tapes (RAIT). Mirroring
incurs high storage costs, while RAIT is inflexible because
special hardware is used and all tapes in a stripe must
be loaded to read a file. Our method, Tape Group Parity
Protection (TGPP), writes parity data... (Update)
Active bibliography (related documents): More All
0.5: An Analytical Performance Model of Robotic Storage Libraries - Johnson (1996)
(Correct)
0.5: Analytic Performance Models of Robotic Storage Libraries: Status.. - Johnson (1998)
(Correct)
0.2: JIT vs Offline Compilers: Limits and Benefits of Bytecode . . . - Muller, al. (1996)
(Correct)
Similar documents based on text: More All
0.5: Improved Adaptive Replacement Algorithm for Disk Caches.. - Hahn, Dilling, Kaletta (1999)
(Correct)
0.2: High Performance RAIT - Hughes, Milligan, Debiez (2002)
(Correct)
0.2: Similarity Join for Low- and High-Dimensional Data - Kalashnikov, Prabhakar (2002)
(Correct)
BibTeX entry: (Update)
@inproceedings{ johnson99tape,
author = "Theodore Johnson and Sunil Prabhakar",
title = "Tape Group Parity Protection",
booktitle = "{IEEE} Symposium on Mass Storage Systems",
pages = "72-79",
year = "1999",
url = "citeseer.ist.psu.edu/233574.html" }
Citations (may not include all citations):
39
Analysis of striping techniques in robotic storage libraries
- Golubchik, Muntz et al. - 1995
30
Striped tape arrays (context) - Drapeau, Katz - 1993
9
Sun Microsystems Computer Company (context) - hsm, guide - 1997
2
RAID: High-performance reliable secondary memory (context) - Chen, Lee et al. - 1994
2
Analysis of the access patterns at the GSFC Distributed Acti..
- Johnson, Bedet - 1996
1
comp-archstorage /FAQ (context) - Van Meter, arch et al.
Documents on the same site (http://www.cs.purdue.edu/homes/sunil/pub.html): More
Efficient Disk Allocation for Fast Similarity Searching - Prabhakar (1997)
(Correct)
Scalable Access within the Context of Digital Libraries - Cheng (1997)
(Correct)
Data Declustering for Efficient Range and Similarity.. - Prabhakar, Agrawal, Abbadi
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC