On variable scope of parity protection in disk arrays
In a common form of a RAID 5 architecture, data is organized on a disk array consisting of N+1 disks into stripes of N data blocks and one parity block (with parity block locations staggered so as to balance the number of parity blocks on each disk). This allows data to be recovered in the event of...
Saved in:
Published in | IEEE transactions on computers Vol. 46; no. 2; pp. 234 - 240 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.02.1997
Institute of Electrical and Electronics Engineers |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | In a common form of a RAID 5 architecture, data is organized on a disk array consisting of N+1 disks into stripes of N data blocks and one parity block (with parity block locations staggered so as to balance the number of parity blocks on each disk). This allows data to be recovered in the event of a single disk failure. Here we consider an extension to this architecture in which parity information applies to arbitrary subsets of the data blocks in each stripe. Using several simplifying assumptions, we present simulation and analytic results that provide estimates of the improvement using this approach, in terms of total I/O operations, as compared to 1) conventional RAID 5 under a random single-block write workload, and 2) the use of a log-structured file system in which data is written out in stripes. Results on the reduction of disk recovery costs are also presented. |
---|---|
AbstractList | In a common form of a RAID 5 architecture, data is organized on a disk array consisting of N+1 disks into stripes of N data blocks and one parity block (with parity block locations staggered so as to balance the number of parity blocks on each disk). This allows data to be recovered in the event of a single disk failure. Here we consider an extension to this architecture in which parity information applies to arbitrary subsets of the data blocks in each stripe. Using several simplifying assumptions, we present simulation and analytic results that provide estimates of the improvement using this approach, in terms of total I/O operations, as compared to 1) conventional RAID 5 under a random single-block write workload, and 2) the use of a log-structured file system in which data is written out in stripes. Results on the reduction of disk recovery costs are also presented. In a common form of a RAID 5 architecture, data is organized on a disk array consisting of N 1 disks into stripes of N data blocks and one parity block (with parity block locations staggered so as to balance the number of parity blocks on each disk). This allows data to be recovered in the event of a single disk failure. Here we consider an extension to this architecture in which parity information applies to arbitrary subsets of the data blocks in each stripe. Using several simplifying assumptions, we present simulation and analytic results that provide estimates of the improvement using this approach, in terms of total I/O operations, as compared to 1) conventional RAID 5 under a random single-block write workload, and 2) the use of a log-structured file system in which data is written out in stripes. Results on the reduction of disk recovery costs are also presented |
Author | Robinson, J.T. Franaszek, P.A. |
Author_xml | – sequence: 1 givenname: P.A. surname: Franaszek fullname: Franaszek, P.A. organization: IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA – sequence: 2 givenname: J.T. surname: Robinson fullname: Robinson, J.T. |
BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2610874$$DView record in Pascal Francis |
BookMark | eNqFkD1rwzAQhkVJoUnaoWsnDaXQwalOlmRpLKFfEMjSzkZWTqDWsV3JKeTf18Eha6aDu-ceXt4ZmTRtg4TcAlsAMPMEfCGVVExfkClIWWTGSDUhU8ZAZyYX7IrMUvpmjCnOzJTIdUP_bAy2qpEm13ZIW0-7YdPvaRfbHl0f2oaGhm5C-qE2RrtP1-TS2zrhzXHOydfry-fyPVut3z6Wz6vM5Ur3mdNYaKkrJ9AUHlGiZkrkaK30sJE-z42rCnDcg6ucciAU5iA23HgtKsvyOXkYvUOS3x2mvtyG5LCubYPtLpXc5MyIQXkW1MJIo-A8WHAlQOgBfBxBF9uUIvqyi2Fr474EVh6qLoGXY9UDe3-U2uRs7aNtXEinB66A6eIQ8m7EAiKerkfHP8kZhmU |
CODEN | ITCOB4 |
CitedBy_id | crossref_primary_10_1145_1629075_1629076 crossref_primary_10_1016_j_ipl_2004_10_009 crossref_primary_10_1145_1978907_1978912 |
Cites_doi | 10.1145/185514.185516 10.1006/jpdc.1993.1011 10.1145/176979.176981 10.1145/50202.50214 10.1145/146941.146943 10.1109/ICDE.1994.283000 |
ContentType | Journal Article |
Copyright | 1997 INIST-CNRS |
Copyright_xml | – notice: 1997 INIST-CNRS |
DBID | IQODW AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 7TB FR3 KR7 |
DOI | 10.1109/12.565608 |
DatabaseName | Pascal-Francis CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Mechanical & Transportation Engineering Abstracts Engineering Research Database Civil Engineering Abstracts |
DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional Civil Engineering Abstracts Engineering Research Database Mechanical & Transportation Engineering Abstracts |
DatabaseTitleList | Civil Engineering Abstracts Computer and Information Systems Abstracts Computer and Information Systems Abstracts |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Computer Science Applied Sciences |
EISSN | 1557-9956 |
EndPage | 240 |
ExternalDocumentID | 10_1109_12_565608 2610874 565608 |
GroupedDBID | --Z -DZ -~X .55 .DC 0R~ 29I 3EH 3O- 4.4 5GY 5VS 6IK 85S 97E AAJGR AASAJ AAYOK ABFSI ABQJQ ABVLG ACGFO ACIWK ACNCT AENEX AETEA AETIX AI. AIBXA AKJIK ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F20 HZ~ H~9 IAAWW IBMZZ ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ MVM O9- OCL P2P PQQKQ RIA RIC RIE RIG RNI RNS RXW RZB TAE TN5 TWZ UHB UKR UPT VH1 X7M XFK XJT XOL XZL YXB YYQ YZZ ZCG 08R AAUGY ABPTK IQODW AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 7TB FR3 KR7 |
ID | FETCH-LOGICAL-c368t-c8e7858bc4e97fee5e80643eaa5f1d5f339cb71c2f1cbc6c146e314d29f84ba03 |
IEDL.DBID | RIE |
ISSN | 0018-9340 |
IngestDate | Sat Oct 05 06:09:18 EDT 2024 Sat Oct 05 04:51:32 EDT 2024 Sat Oct 05 05:06:12 EDT 2024 Thu Sep 26 15:44:11 EDT 2024 Sun Oct 29 17:08:32 EDT 2023 Wed Jun 26 19:28:30 EDT 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 2 |
Keywords | Reliability Storage management Parity Magnetic disk storage Storage access File management |
Language | English |
License | CC BY 4.0 |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c368t-c8e7858bc4e97fee5e80643eaa5f1d5f339cb71c2f1cbc6c146e314d29f84ba03 |
Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
PQID | 27264148 |
PQPubID | 23500 |
PageCount | 7 |
ParticipantIDs | proquest_miscellaneous_29309464 ieee_primary_565608 proquest_miscellaneous_28495961 crossref_primary_10_1109_12_565608 pascalfrancis_primary_2610874 proquest_miscellaneous_27264148 |
PublicationCentury | 1900 |
PublicationDate | 1997-02-01 |
PublicationDateYYYYMMDD | 1997-02-01 |
PublicationDate_xml | – month: 02 year: 1997 text: 1997-02-01 day: 01 |
PublicationDecade | 1990 |
PublicationPlace | New York, NY |
PublicationPlace_xml | – name: New York, NY |
PublicationTitle | IEEE transactions on computers |
PublicationTitleAbbrev | TC |
PublicationYear | 1997 |
Publisher | IEEE Institute of Electrical and Electronics Engineers |
Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers |
References | bibt02342 bibt02343 bibt02341 bibt02346 bibt02344 bibt02345 |
References_xml | – ident: bibt02346 doi: 10.1145/185514.185516 – ident: bibt02342 doi: 10.1006/jpdc.1993.1011 – ident: bibt02341 doi: 10.1145/176979.176981 – ident: bibt02343 doi: 10.1145/50202.50214 – ident: bibt02345 doi: 10.1145/146941.146943 – ident: bibt02344 doi: 10.1109/ICDE.1994.283000 |
SSID | ssj0006209 |
Score | 1.5355264 |
Snippet | In a common form of a RAID 5 architecture, data is organized on a disk array consisting of N+1 disks into stripes of N data blocks and one parity block (with... In a common form of a RAID 5 architecture, data is organized on a disk array consisting of N + 1 disks into stripes of N data blocks and one parity block (with... In a common form of a RAID 5 architecture, data is organized on a disk array consisting of N 1 disks into stripes of N data blocks and one parity block (with... |
SourceID | proquest crossref pascalfrancis ieee |
SourceType | Aggregation Database Index Database Publisher |
StartPage | 234 |
SubjectTerms | Analytical models Applied sciences Arm Cleaning Computer architecture Computer Society Costs Electronics Exact sciences and technology File systems Load management Magnetic and optical mass memories Organizing Protection Storage and reproduction of information |
Title | On variable scope of parity protection in disk arrays |
URI | https://ieeexplore.ieee.org/document/565608 https://search.proquest.com/docview/27264148 https://search.proquest.com/docview/28495961 https://search.proquest.com/docview/29309464 |
Volume | 46 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3da9swEBddntaHtUtbmn5sYuzViWR9WHocYyUUur00kDcjyScIBafETqH96yvJdljbUfZijH0G6053upPufofQdyKttxRkVgmeZ5x7kmlniwysC6sJ48B83NC_-S3nC369FMseZzvVwgBASj6DabxNZ_nV2m3jVtksOh-xsPeDInlXqrUzunLI5qBBfxknPYgQJXpG82n34YulJ_VSiZmQpgnM8F0XizcGOa0yVwdd-XaTwAljcsnddNvaqXt6Bd34nwM4RJ96bxP_6KbHZ7QH9RgdDJ0ccK_YY7T_FyzhERJ_avwQYuhYVYVT2QpeexzbFbaPuAd2COLEqxpXq-YOm83GPDbHaHH16_bnPOvbK2SOSdVmTkGhhLKOgy48gAAV_RMwRnhaCc9YlBp1uafOOumCTQVGeZVrr7g1hJ2gUb2u4RRhrYQwhbTCcsp9Tk3w26QFAl6HC9gJ-jZwvrzvUDTKFH0QXdK87NgyQePIsR3B8PTyhYh2r0PoR1TBJ-jrILIyaEY87jA1rLdNmRfB2QvR3jsUKoSHWtJ3KDQL8a_kZ__8t3P0sUOzjdktF2jUbrZwGXyU1n5Js_MZnTPmIA |
link.rule.ids | 315,786,790,802,27955,27956,55107 |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT9wwELYqOLQ9AF1asTyKhbhmseNH7CNCRdsW6AUkbpHtjCWElEWbLNLy67GdZFVKhbhEUTKR4hmPZ8ae-QahYyKttxRkVgmeZ5x7kmlniwysC9aEcWA-buhfXsnpDf91K257nO1UCwMAKfkMJvE2neVXM7eIW2Un0fmIhb3rwcyToivWWi27csjnoEGDGSc9jBAl-oTmk-7TF8YndVOJuZCmCezwXR-LV0tysjPnm10Bd5PgCWN6yf1k0dqJe_oHvPGdQ9hCG72_iU-7CfIFfYB6hDaHXg64V-0R-vwXMOE2En9q_Bii6FhXhVPhCp55HBsWtkvcQzsEgeK7Gld3zT0287lZNl_RzfmP67Np1jdYyByTqs2cgkIJZR0HXXgAASp6KGCM8LQSnrEoN-pyT5110oVVFRjlVa694tYQ9g2t1bMadhDWSghTSCssp9zn1ATPTVog4HW4gB2jo4Hz5UOHo1Gm-IPokuZlx5YxGkWOrQiGpwcvRLR6HYI_ogo-RoeDyMqgG_HAw9QwWzRlXgR3L8R7b1CoECBqSd-g0CxEwJLv_vffDtHH6fXlRXnx8-r3HvrUYdvGXJd9tNbOF3AQPJbWfk8z9RneKul0 |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+variable+scope+of+parity+protection+in+disk+arrays&rft.jtitle=IEEE+transactions+on+computers&rft.au=Franaszek%2C+P.A.&rft.au=Robinson%2C+J.T.&rft.date=1997-02-01&rft.issn=0018-9340&rft.volume=46&rft.issue=2&rft.spage=234&rft.epage=240&rft_id=info:doi/10.1109%2F12.565608&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_12_565608 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9340&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9340&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9340&client=summon |