%0 Journal Article
%T Research on Double-Error Tolerance Data Placement Scheme DP-RAID<br>双容错数据布局算法DP—RAID扩展研究
%A LIU Wei-Ping
%A CAI Wan-Dong
%A Ren Jian-Qi
%A <br>刘卫平
%A 蔡皖东
%A 任建奇
%J 计算机科学
%D 2006
%I 
%X As the data placement scheme based on single-erasure correcting codes can not satisfy the requirement of storage system on reliability.Now there are more and more researches on the data placement scheme based on multi-e- rasure correcting codes such as multi-dimension parity,DH1,DH2.But these data placement schemes have some dis- advantages such as poor redundancy,heavy computing workload.DP-RAID is a double error tolerating data placement scheme based on horizontal parity and diagonal parity.Its computing load is low,and easy to implement.But it re- quires that the length of parity stripe is prime number.This paper extends the data placement scheme to the environ- ment that the length of parity stripe is prime number minus 1.The performance of the new data placement scheme im- proves obviously and reliability of the new data placement scheme doesn't change,comparing with other double-error tolerance data placement scheme.
%K RAID5<br>奇偶校验
%K 双容错编码
%K 可靠性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=9D8249D92DFD7627&yid=37904DC365DD7266&vid=27746BCEEE58E9DC&iid=E158A972A605785F&sid=B62E0EEFE746E568&eid=F122871CC7EC92DC&journal_id=1002-137X&journal_name=计算机科学&referenced_num=1&reference_num=7