Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

RAID Organizations for Improved Reliability and Performance: A Not Entirely Unbiased Tutorial (1st revision) (2401.03235v1)

Published 6 Jan 2024 in cs.DC, cs.OS, and cs.PF

Abstract: RAID proposal advocated replacing large disks with arrays of PC disks, but as the capacity of small disks increased 100-fold in 1990s the production of large disks was discontinued. Storage dependability is increased via replication or erasure coding. Cloud storage providers store multiple copies of data obviating for need for further redundancy. Varitaions of RAID based on local recovery codes, partial MDS reduce recovery cost. NAND flash Solid State Disks - SSDs have low latency and high bandwidth, are more reliable, consume less power and have a lower TCO than Hard Disk Drives, which are more viable for hyperscalers.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (52)
  1. [16] S. H. Baek and K. H. Park. 2008. Prefetching with adaptive cache culling for striped disk arrays. In Proc. USENIX Ann’l Technical Conf., ATC 2008: 363-376.
  2. [17] J. Basak and R. Katz. 2015. RAID-Cube: The Modern Datacenter Case for RAID. EECS Dept. UC Berkeley. TR NO. UCB/EECS-2015-4. https://www2.eecs.berkeley.edu/Pubs/TechRpts/2015/EECS-2015-4.pdf
  3. [18] D. Bitton and J. Gray. 1988. Disk shadowing. In Proc. 14th Int’l Conf. on Very Large Data Bases - VLDB 1988: 331-338
  4. [23] J. Bonwick. 2016. Scalable high performance FLASH systems (slides). 32nd Int’l Conf. on Massive Storage Systems and Technology - MSST 2016. https://storageconference.us/2016/Slides/JeffBonwick.pdf
  5. [24] D. Borthakur. 2007. The Hadoop distributed file system: Architecture and design. Technical Report Apache Software Foundation 2007. http://svn.apache.org/repos/asf/hadoop/common/tags/release-0.16.3/docs/hdfs_design.pdf
  6. [27] E. Brewer. 2016. Spinning disks and their cloudy future. In Proc. 14th USENIX Conf. on File and Storage Technologies - FAST 2016 (presentation). https://www.usenix.org/sites/default/files/conference/protected-files/fast16_slides_brewer.pdf.
  7. [40] H. A. David and H. N. Nagaraja. 2003. Order Statistics, 3rd edition. Wiley 2003.
  8. [44] P. J. Denning. 1967. Effects of scheduling on file memory operations. In Proc. AFIPS Spring Joint Computing Conf. 1967, 9-21.
  9. [55] L. Flatto and S. Hahn. 1984. Two parallel queues created by arrivals with two demands: I. SIAM J. Applied Mathematics 44 (1984), 1041-1053.
  10. [62] E. Fujiwara. 2006. Code Design for Dependable Systems Theory and Practical Applications. Wiley-Interscience, 2006.
  11. [65] G. A. Gibson. 1992. Redundant Disk Arrays: Reliable, Parallel Secondary Storage Systems. The MIT Press 1992.
  12. [67] M. Goldszmidt. 2012. Finding soon-to-fail disks in a haystack. In Proc. 4th USENIX Workshop Hot Topics in Storage and File Systems, HotStorage 2012: 1-5.
  13. [70] N. K. Goyal and S. Rajkumar (2020): Interconnection Network Reliability Evaluation: Multistage Layouts. Wiley, 2020.
  14. [73] J. Gray and P. J. Shenoy. 2000. Rules of thumb in data engineering. In Proc. 16th Int’l Conf. on Data Engineering, ICDE 2000: 3-10.
  15. [74] J. Gray. Storage bricks (presentations. In Proc. Usenix Conf. on File and Storage Technologies - FAST 2002. https://www.usenix.org/legacy/publications/library/proceedings/fast02/gray/sld001.htm
  16. [80] M. Hall. 1986. Combinatorial Theory, Second edition. Wiley-Interscience 1986.
  17. [85] J. L. Hennessey and D. A. Patterson. 2017. Computer Architecture: A Quantitative Approach, 6th ed. Morgan-Kaufmann Publisher 2017.
  18. [87] H.-I. Hsiao and D. J. DeWitt. 1990. Chained declustering: A new availability strategy for multiprocessor database machines. In Proc. 6th IEEE Int’l Conf. on Data Eng. - ICDE’90, 456-465.
  19. [96] T. Ibaraki and N. Katoh. 1988. Resource Allocation Problems: Algorithmic Approach. The MIT Press, 1988.
  20. [106] I. Iliadis. 2022. Effect of lazy rebuild on reliability of erasure coded storage systems. In Proc. CTRQ 2022: 15th Int’l Conf. on Communication Theory. https://www.iaria.org/conferences2022/filesCTRQ22/CTRQ_70005.pdf
  21. [109] D. M. Jacobson and J. Wilkes. 1991. Disk scheduling algorithms based on rotational position Tech. Report HPL–CSP–91–7rev. March 1991. https://pages.cs.wisc.edu/~remzi/Classes/838/Fall2001/Papers/hp-sched.pdf
  22. [118] P. Karlsson. 2006. Solaris 10 Features In-depth: Containers and ZFS. http://uk.sun.com/sunnews/events/2006/mar/javauk06/presentations/Peter_Karlsson_Containers_ZFS.pdf
  23. [122] L. Kleinrock. 1975. Queueing Systems, Vol. I: Theory. Wiley-Interscience 1975.
  24. [123] L. Kleinrock. 1976. Queueing Systems, Vol. II: Applications. Wiley-Interscience 1976.
  25. [125] S. Kotz and S. Nadarajah. 2000. Extreme Value Distributions: Theory and Applications. Imperial College Press, London 2000.
  26. [127] S. S. Lavenberg, ed. 1983. Computer Performance Modeling Handbook. Academic Press 1983.
  27. [136] C. R.Lumb and R. Golding. 2004. D-SPTF: Decentralized request distribution in brick-based storage systems. In Proc. 11th Int’l Conf. on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2004: 37–47.
  28. [141] F. P. Mathur and A. Avizienis. 1970. Reliability analysis and architecture of a hybrid-redundant digital system: Generalized triple modular redundancy with self-repair. In Proc. AFIPS Spring Joint Computing Conf. 1970, 375-383.
  29. [143] B. McNutt. 2002. The Fractal Structure of Data Reference - Applications to the Memory Hierarchy. Advances in Database Systems 22, Kluwer 2002.
  30. [145] J. Menon and J. Cortney. 1993. The architecture of a fault-tolerant cached RAID controller. In Proc. 20th Ann’l Int’l Symp on Computer Architecture, ISCA 1993: 76-86.
  31. [147] J. Menon. 1995. A performance comparison of RAID-5 and log-structured arrays. In Proc. 4th Int’l Symp. on High Performance Distributed Computing, HPDC 1995: 167-178
  32. [152] R. R. Muntz and J. C. S. Lui. 1990. Performance analysis of disk arrays under failure. In Proc 16th Int’l Conf. on Very Large Data Bases - VLDB 1990, 162-173.
  33. [157] S. W. Ng. 1994. Crosshatch disk array for improved reliability and performance. In Proc. 21st Int’l Symp. on Computer Architecture - ISCA CA 1994, 255-264.
  34. [170] D. A. Patterson and J. Hennessey. 2017. Computer Organization and Design. MKP 2017
  35. [182] A. Rafii. 1976 Study of the performance of RPS. ACM SIGMETRICS Perform. Evaluation Rev. 5(4): 21-38 (1976)
  36. [189] J. Resch and I. Volvivski. 2013. Reliability models for highly fault-tolerant storage systems. arxiv.org/abs/1310.4702
  37. [193] A. Riska and E. Riedel. 2003. It’s not fair - Evaluating efficient disk scheduling. In Proc. 11th Int’l Workshop on Modeling, Analysis and Simulation of Computer and Telecomm. Systems - MASCOTS 2003: 288-295.
  38. [194] R. Rojas-Cessa. 2017. Interconnections for Computer Communications and Packet Networks. CRC Press, 2017.
  39. [197] F. G. Sanchez. 2007. Modeling of Field and Thermal Magnetization Reversal in Nanostructured Magnetic Materials. PhD thesis, Autonomous Univ. of Madrid 2007. http://www.fgarciasanchez.es/thesisfelipe.pdf
  40. [205] G. Schulz. Resilient Storage Networks. Designing Flexible Scalable DataInfrastructures. Elsevier Digital Press 2004,
  41. [206] T. J. E. Schwarz and W. A. Burkhard. 1996. Almost Complete Address Translation (ACATS) disk array declustering, In Proc. 8th IEEE Symp. on Parallel and Distributed Processing - SPDP 1996: 324-331.
  42. [200] SEFI - European Soc. Eng. Education. 2013. A framework for mathematics curricula in engineering education: A report of the mathematics working group.2013. http://sefibenvwh.cluster023.hosting.ovh.net/wp-content/uploads/2017/07/Competency-based-curriculum-incl-ads.pdf
  43. [210] R. D. Sloan. 1992. A practical implementation of the data base machine - Teradata DB/1012. In Proc. 25th Hawaii Int’l Conf. on Systems Science, Vol. 1: 320-327.
  44. [212] A. J. Smith. 1985. Disk cache-miss ratio analysis and design considerations. ACM Trans. Computer Systems 3(3): 161-203 (1985).
  45. [213] W. J. Stewart. 2021. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 2021.
  46. [216] H. Takagi. 1991. Queueing Analysis: A Foundation of Performance Evaluation : Vacation and Priority Systems, North Holland 1991.
  47. [222] A. Thomasian: Rebuild options in RAID5 disk arrays. In Proc. 7th IEEE Symp. on Parallel and Distributed Processing, SPDP 1995: 511-518.
  48. [224] A. Thomasian and C. Liu. 2002, Some new disk scheduling policies and their performance. In Proc. ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems 2002: 266-267
  49. [242] A. Thomasian. 2014. Performance Evaluation of Computer Systems. Computing Handbook, 3rd ed. (Vol. 1) 2014: Chapter 56: 1-50.
  50. [244] A. Thomasian. 2018. Vacationing server model for M/G/1 Queues for rebuild processing in RAID5 and threshold scheduling for readers and writers. Information Processing Letters - IPL 135 (20018), 41-46.
  51. [247] K. Treiber and J. Menon. 1995. Simulation study of cached RAID5 designs. In Proc. 1st IEEE Symp. on High-Performance Computer Architecture - HPCA 1995, 186-197.
  52. [257] A. Wilner. 2001. Multiple drive failure tolerant RAID system. US Patent 6,327,672, Dec. 2001

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets