{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T22:50:13Z","timestamp":1756075813901,"version":"3.41.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2012,5,31]],"date-time":"2012-05-31T00:00:00Z","timestamp":1338422400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGARCH Comput. Archit. News"],"published-print":{"date-parts":[[2012,5,31]]},"abstract":"<jats:p>The rotated parity RAID5 disk array tolerates single disk failures by continuing operation by on-demand reconstruction of data blocks of the failed disk, until the systematic reconstruction of the contents of the failed disk is completed by the rebuild process on a spare disk. Supplementary Parity Augmentation (SPA), unlike the pyramid code, which has two parities covering half of the arrays disks each, extends RAID5's P parity with an additional S parity, which covers half of the disks. The extra load with respect to RAID5 of updating the S parity by one half of the disks is compensated by the more efficient on demand reconstructtion and rebuild processing when a disk fails. Although SPA has the same disk space redundancy level as RAID6, unlike RAID6 it can only deal with roughly half of all possible double disk failure cases for eight disks. For rebuild processing SPA reads half of the disks required by RAID5 and this leads to a higher Mean Time to Data Loss than RAID5, since fewer Latent Sector Errors are encountered. We review performance and reliability modeling of RAID5 arrays to provide insights into SPA's performance and reliability, which cannot be gained from numerical results alone. SPA is outperformed by the Intra-Disk Redundancy schemes combined with RAID5, which results in RAID6's reliability and RAID5 performance.<\/jats:p>","DOI":"10.1145\/2234336.2234340","type":"journal-article","created":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T15:51:28Z","timestamp":1338565888000},"page":"18-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Rebuild processing in RAID5 with emphasis on the supplementary parity augmentation method[37]"],"prefix":"10.1145","volume":"40","author":[{"given":"Alexander","family":"Thomasian","sequence":"first","affiliation":[{"name":"Thomasian &amp; Associates, Pleasantville, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,5,31]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1109\/12.364531"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1109\/FTCS.1994.315647"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_1","DOI":"10.1145\/176979.176981"},{"volume-title":"Proc. USENIX Conf. on File and Storage Technologies (FAST'04)","year":"2004","author":"Corbett P. F.","key":"e_1_2_1_4_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_5_1","DOI":"10.1145\/1353452.1353453"},{"volume-title":"The MIT Press","year":"1992","author":"Gibson G. A.","key":"e_1_2_1_6_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.1007\/BF01266332"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_1","DOI":"10.1109\/HICSS.1993.270756"},{"volume-title":"Proc. 6th Int'l Symp. on Network Computing and Applications (NCA 2007","year":"2007","author":"Huang C.","key":"e_1_2_1_9_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_1","DOI":"10.1145\/1970348.1970350"},{"volume-title":"DRAM","year":"2008","author":"Jacob B. L.","key":"e_1_2_1_11_1"},{"unstructured":"H. H. Kari. \"Latent Sector Faults and Relability of Disk Arrays\" PhD Thesis University of Helsinki Finland 1977.  H. H. Kari. \"Latent Sector Faults and Relability of Disk Arrays\" PhD Thesis University of Helsinki Finland 1977.","key":"e_1_2_1_12_1"},{"volume-title":"Theory","year":"1975","author":"Kleinrock L.","key":"e_1_2_1_13_1"},{"volume-title":"Proc. 13th Workshop on Hot Topics in Operating Systems (HotOS 2011","year":"2011","author":"Krevat E.","key":"e_1_2_1_14_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_15_1","DOI":"10.1109\/TPDS.2002.1003860"},{"doi-asserted-by":"publisher","key":"e_1_2_1_16_1","DOI":"10.1109\/12.278490"},{"doi-asserted-by":"publisher","key":"e_1_2_1_17_1","DOI":"10.1109\/12.260634"},{"doi-asserted-by":"publisher","key":"e_1_2_1_18_1","DOI":"10.1007\/BF01266331"},{"doi-asserted-by":"publisher","key":"e_1_2_1_19_1","DOI":"10.1109\/12.485575"},{"doi-asserted-by":"publisher","key":"e_1_2_1_20_1","DOI":"10.5555\/645916.671832"},{"doi-asserted-by":"publisher","key":"e_1_2_1_21_1","DOI":"10.1109\/TC.1980.1675495"},{"doi-asserted-by":"publisher","key":"e_1_2_1_22_1","DOI":"10.1145\/133057.133090"},{"doi-asserted-by":"publisher","key":"e_1_2_1_23_1","DOI":"10.1109\/TDSC.2010.21"},{"doi-asserted-by":"publisher","key":"e_1_2_1_24_1","DOI":"10.1145\/1288783.1288785"},{"doi-asserted-by":"publisher","key":"e_1_2_1_25_1","DOI":"10.1145\/1837915.1837917"},{"volume-title":"North-Holland","year":"1991","author":"Takagi H.","key":"e_1_2_1_26_1"},{"volume-title":"Proc. 10th IEEE Int'l Conf. on Data Engineering (ICDE)","year":"1994","author":"Thomasian A.","key":"e_1_2_1_27_1"},{"volume-title":"Proc. 7th IEEE Symp. Parallel and Distributed Systems","year":"1995","author":"Thomasian A.","key":"e_1_2_1_28_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_29_1","DOI":"10.1109\/71.595583"},{"doi-asserted-by":"publisher","key":"e_1_2_1_30_1","DOI":"10.1093\/comjnl\/bxh108"},{"doi-asserted-by":"publisher","key":"e_1_2_1_31_1","DOI":"10.1109\/TC.2007.1041"},{"doi-asserted-by":"publisher","key":"e_1_2_1_32_1","DOI":"10.1093\/comjnl\/bxl064"},{"doi-asserted-by":"publisher","key":"e_1_2_1_33_1","DOI":"10.1145\/1629075.1629076"},{"doi-asserted-by":"publisher","key":"e_1_2_1_34_1","DOI":"10.1145\/2024716.2024719"},{"doi-asserted-by":"publisher","key":"e_1_2_1_35_1","DOI":"10.1016\/j.ipl.2011.03.001"},{"doi-asserted-by":"publisher","key":"e_1_2_1_36_1","DOI":"10.1109\/NAS.2011.22"},{"doi-asserted-by":"publisher","key":"e_1_2_1_37_1","DOI":"10.1145\/1970338.1970341"},{"volume-title":"Wiley","year":"2001","author":"Trivedi K. S.","key":"e_1_2_1_38_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_39_1","DOI":"10.1109\/GLOCOMW.2010.5700274"},{"doi-asserted-by":"publisher","key":"e_1_2_1_40_1","DOI":"10.5555\/1364813.1364815"},{"doi-asserted-by":"publisher","key":"e_1_2_1_41_1","DOI":"10.1145\/1811039.1811054"},{"doi-asserted-by":"publisher","key":"e_1_2_1_42_1","DOI":"10.1109\/18.746809"}],"container-title":["ACM SIGARCH Computer Architecture News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2234336.2234340","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2234336.2234340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:00:43Z","timestamp":1750276843000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2234336.2234340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,31]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,5,31]]}},"alternative-id":["10.1145\/2234336.2234340"],"URL":"https:\/\/doi.org\/10.1145\/2234336.2234340","relation":{},"ISSN":["0163-5964"],"issn-type":[{"type":"print","value":"0163-5964"}],"subject":[],"published":{"date-parts":[[2012,5,31]]},"assertion":[{"value":"2012-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}