The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
A case for redundant arrays of inexpensive disks (RAID)
Open accessAbstract
Increasing performance of CPUs and memories will be squandered if not matched by a similar performance increase in I/O. While the capacity of Single Large Expensive Disks (SLED) has grown rapidly, the performance improvement of SLED has been modest. Redundant Arrays of Inexpensive Disks (RAID), based on the magnetic disk technology developed for personal computers, offers an attractive alternative to SLED, promising improvements of an order of magnitude in performance, reliability, power consumption, and scalability. This paper introduces five levels of RAIDs, giving their relative cost/performance, and compares RAID to an IBM 3380 and a Fujitsu Super Eagle.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Error Detecting and Error Correcting Codes
Hamming, R. W. (1950) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1950.tb00463.x · Cited by 5,377
Validity of the single processor approach to achieving large scale computing capabilities
Amdahl, G. M. (1967) · Proceedings of the April 18-20, 1967, spring joint computer conference on - AFIPS '67 (Spring) · doi:10.1145/1465482.1465560 · Cited by 4,339
ERROR DETECTING AND ERROR CORRECTING CODES
Chauhan, N., Yadav, P., & Kumari, P. (2014) · Cited by 3,270
Progress in Digital Integrated Electronics
Moore, G. E. (1975) · Technical digest - International Electron Devices Meeting/Technical digest · Cited by 1,702
Synchronized Disk Interleaving
Kim (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676699 · Cited by 258
Bell (1984) · Computer · doi:10.1109/mc.1984.1658955 · Cited by 44
Cited by
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
Parallel database systems: the future of high performance database systems
DeWitt, D., & Gray, J. (1992) · Communications of the ACM · doi:10.1145/129888.129894 · Cited by 1,291
The design and implementation of a log-structured file system
Rosenblum, M., & Ousterhout, J. K. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146943 · Cited by 1,268
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
RAID: high-performance, reliable secondary storage
Chen, P. M., Lee, E. K., Gibson, G. A., Katz, R. H., & Patterson, D. A. (1994) · ACM Computing Surveys · doi:10.1145/176979.176981 · Cited by 1,198
Self-citationThe design and implementation of a log-structured file system
Rosenblum, M., & Ousterhout, J. K. (1991) · Proceedings of the thirteenth ACM symposium on Operating systems principles · doi:10.1145/121132.121137 · Cited by 970
GraphChi: Large-Scale Graph Computation on Just a PC
Kyrola, A., Blelloch, G. E., & Guestrin, C. (2018) · Figshare · doi:10.1184/r1/6605999 · Cited by 868
EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
Blaum, M., Brady, J., Bruck, J., & Menon, J. (1995) · IEEE Transactions on Computers · doi:10.1109/12.364531 · Cited by 689
The Gamma database machine project
DeWitt, D. J., Ghandeharizadeh, S., Schneider, D. A., Bricker, A., Hsiao, H.-I., & Rasmussen, R. (1990) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.50905 · Cited by 668
(2002) · Choice Reviews Online · doi:10.5860/choice.39-2844 · Cited by 613
FAWN: a fast array of wimpy nodes
Andersen, D. G., Franklin, J., Kaminsky, M., Phanishayee, A., Tan, L., & Vasudevan, V. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629577 · Cited by 561
A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems
Plank, J. S. (1997) · Software: Practice and Experience · doi:10.1002/(sici)1097-024x(199709)27:9<995::aid-spe111>3.0.co;2-6 · Cited by 525
Design, Modeling, and Evaluation of a Scalable Multi-level Checkpointing System
Moody, A., Bronevetsky, G., Mohror, K., & Supinski, B. R. D. (2010) · 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2010.18 · Cited by 521
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Bolosky, W. J., Douceur, J. R., Ely, D., & Theimer, M. (2000) · Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/339331.339345 · Cited by 484
The case for RAMClouds: scalable high-performance storage entirely in DRAM
Ousterhout, J., Agrawal, P., Erickson, D., Kozyrakis, C., Leverich, J., Mazières, D., Mitra, S., Narayanan, A., Parulkar, G., Rosenblum, M., et al. (2010) · ACM SIGOPS Operating Systems Review · doi:10.1145/1713254.1713276 · Cited by 447
Fast crash recovery in RAMCloud
Ongaro, D., Rumble, S. M., Stutsman, R., Ousterhout, J., & Rosenblum, M. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043560 · Cited by 360
Understanding failures in petascale computers
Schroeder, B., & Gibson, G. A. (2007) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/78/1/012022 · Cited by 358
Self-citationFundamentals of fault-tolerant distributed computing in asynchronous environments
Gärtner, F. C. (1999) · ACM Computing Surveys · doi:10.1145/311531.311532 · Cited by 346
Error Characterization, Mitigation, and Recovery in Flash-Memory-Based Solid-State Drives
Cai, Y., Ghose, S., Haratsch, E. F., Luo, Y., & Mutlu, O. (2017) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2713127 · Cited by 343
DepSky: Dependable and Secure Storage in a Cloud-of-Clouds
Bessani, A., Correia, M., Quaresma, B., André, F., & Sousa, P. (2013) · ACM Transactions on Storage · doi:10.1145/2535929 · Cited by 330
A cost-effective, high-bandwidth storage architecture
Gibson, G. A., Nagle, D. F., Amiri, K., Butler, J., Chang, F. W., Gobioff, H., Hardin, C., Riedel, E., Rochberg, D., & Zelenka, J. (1998) · ACM SIGPLAN Notices · doi:10.1145/291006.291029 · Cited by 324
Self-citationDepSky: dependable and secure storage in a cloud-of-clouds
Bessani, A., Correia, M., Quaresma, B., André, F., & Sousa, P. (2011) · Proceedings of the sixth conference on Computer systems · doi:10.1145/1966445.1966449 · Cited by 320
An analysis of latent sector errors in disk drives
Bairavasundaram, L. N., Goodson, G. R., Pasupathy, S., & Schindler, J. (2007) · Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/1254882.1254917 · Cited by 296
Materials Data Science: Current Status and Future Outlook
Kalidindi, S. R., & De Graef, M. (2015) · Annual Review of Materials Research · doi:10.1146/annurev-matsci-070214-020844 · Cited by 294
Hibernator: helping disk arrays sleep through the winter
Zhu, Q., Chen, Z., Tan, L., Zhou, Y., Keeton, K., & Wilkes, J. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095828 · Cited by 287
Chen, F., Lee, R., & Zhang, X. (2011) · 2011 IEEE 17th International Symposium on High Performance Computer Architecture · doi:10.1109/hpca.2011.5749735 · Cited by 283
An analysis of data corruption in the storage stack
Bairavasundaram, L. N., Arpaci-Dusseau, A. C., Arpaci-Dusseau, R. H., Goodson, G. R., & Schroeder, B. (2008) · ACM Transactions on Storage · doi:10.1145/1416944.1416947 · Cited by 282
Predator data station: A fast data acquisition system for advanced FT-ICR MS experiments
Blakney, G. T., Hendrickson, C. L., & Marshall, A. G. (2011) · International Journal of Mass Spectrometry · doi:10.1016/j.ijms.2011.03.009 · Cited by 261
Understanding latent sector errors and how to protect against them
Schroeder, B., Damouras, S., & Gill, P. (2010) · ACM Transactions on Storage · doi:10.1145/1837915.1837917 · Cited by 131
MemGPT: Towards LLMs as Operating Systems
Packer, C., Wooders, S., Lin, K., Fang, V., Patil, S. G., Stoica, I., & Gonzalez, J. E. (2023) · arXiv · doi:10.48550/arxiv.2310.08560 · Cited by 64
Parity models: erasure-coded resilience for prediction serving systems
Kosaian, J., Rashmi, K. V., & Venkataraman, S. (2019) · Proceedings of the 27th ACM Symposium on Operating Systems Principles · doi:10.1145/3341301.3359654 · Cited by 48
Metadata
- Authors
- Patterson, D. A., Gibson, G., & Katz, R. H.
- Venue
- ACM SIGMOD Record
- Published
- 1988-06
- Volume
- 17
- Issue
- 3
- Pages
- 109-116
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2147504831
- Cited by
- 2,281
- References
- 6
- FWCI
- 37.37
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.