期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于Tornado码的存储冗余算法研究 被引量：3

Research in Redundancy Storage Algorithm Based on Tornado Code
下载PDF
导出
摘要 纠删码是提供数据高可用性的重要方法。与传统纠删码相比较,Tornado码是基于稀疏矩阵的级连纠删码,通过异或操作完成编解码,实现纠错功能。经实验分析,在存储系统中采用Tornado码进行数据冗余,可以有效的加快编解码速度和减少存储空间的消耗,并提供较高的纠错能力。 Erasure code is an important method for providing high availability in data storage. Comparing with the existing kinds of erasure codes,the Tornado code is the one based on a cascade of sparse bipartite graphs, encoded and decoded through the operation of the exclusive - or （ XOR）, implement the function of correcting. By simulations, adopting Tornado code for data redundancy in the storage system can accelerate the speed of encoding and decoding, reduce the cost of storage, and providing the good ability of correcting.
作者 孙伟平 汤毅凡
机构地区 华中科技大学计算机学院
出处 《微处理机》 2008年第2期71-74,共4页 Microprocessors
基金 国家自然科学基金资助项目(60373088)
关键词 纠删码 高可用性 编解码 纠错 冗余 Erasure code High availability Encoding and decoding Correcting Redundancy
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献6

  • 1Kubiatowiez J, Bindel D, Chen Y, et al. OceanStore: An Architecture for Global - scale Persistent Storage [ C ].Proc. Conf. Arch - itectural Support for Programming Languages and Operating Systems ( ASPLOS2IX), ACM Press, New York,2000 : 190 - 2011.
  • 2Drusehel P, Rowstron A. PAST: A Large - scale, Persistent Peer - to - peer Storage Utility [ C ]. In: Proc of HotOSⅧ, Schloss Elmau, Germany,2001 : 75 - 80.
  • 3Luby M G, Mitzenmacher M, ShokroUahi M A, et al. Practical Loss- resilient Codes[ C]. In Proceedings of the Twenty- ninth Annual ACM Symposium on Theory of Corn - puting, El Paso,Texas, USA, 1997 : 150 - 159.
  • 4Richardson T J, Urbanke RL. Efficient Encoding of Low - density Parity - check Codes [ J ]. IEEE Trans on InformationTheory ,2001,47 (2) : 638 - 656.
  • 5J S Plank, M G Thomason. A practical analysis of low - density parity - check erasure codes for wide - area stor- age applications [ J ]. In DSN - 2004 : The International Conference on Dependable Systems and Networks. IEEE, June 2004.
  • 6慕建君,王鹏,王新梅.正则低密度纠删码的分析[J].西安电子科技大学学报,2003,30(4):469-472. 被引量：5

二级参考文献9

  • 1MacKay D J C, Neal R M. Near Shannon Limit Performance of Low-density Parity Check Codes[J]. Electron Lett, 1996, 32(6) : 1645-1646.
  • 2MacKay D J C, Neal R M, Good Error Correcting Codes Based on Very Sparse Matrices[A]. In Cryptography and Codings: 5th IMA Conf[C]. (Lecture Notes in Computer Science No 1025), Colin Boyd, Ed, Berlin, Germany: Springer, 1995, 100-111.
  • 3Chung S Y, Jr Forney G D, On the Design of Low-deasity Parity-check Codes Within 0.0045 dB of the Shannon Limit[J]. IEEE Comm Letters, 2001, 5(2): 58-60.
  • 4Luby M, Mitzenmacher M, Shokrollahi A, el al. Practical Loss-Resilient Codes[A]. Proc of the 29th ACM Symposium on Theory of Computing[C]. Texas: EI-Paso, 1997, 150-159.
  • 5Shokrollahi M A. New Sequences of Linear-time Erasure Codes Approaching the Channel Capacity[A]. In Proceedings of the 13th Conference on Applied Algebra, Error Correcting Codes and Cryptography: Vol 1719[C]. Berlin: Springer Veralg, 1999. 65-76.
  • 6Luby M, Mitzenmacher M, Shokrollahi A. Analysis of Random Processes Via And-Or Tree Evaluation[A]. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms[C]. San Francisco: [s.n.], 1998. 364-373.
  • 7Luby M. Habilitalionsschrift [DB/OL]. http://citeseer. nj. nec. com/419720. html, 2001-12-10,.
  • 8孙韶辉,慕建君,王新梅.低密度校验码研究及其新进展[J].西安电子科技大学学报,2001,28(3):393-397. 被引量：23
  • 9慕建君,贺玉成,王新梅.低密度纠删码稳定收敛条件的证明[J].电子学报,2002,30(4):530-532. 被引量：3

共引文献4

同被引文献22

  • 1Sanjay Ghemawat,Howard Gobioff,Shun-Tak Leung.The Google file system[M].Proc.of the 19th ACM SOSP.New York:ACM Press,2003:29-43.
  • 2Amazon.Amazon Simple Storage Service (S3)[EB/OL].http://www.amazon.com/s3,2010.
  • 3WICKER SB,BHARGAVA VK.Reed-Solomon Codes and Their Applications[M].New York:IEEE Press,1994.
  • 4Rizzo L.On the Feasibility of Software FEC[Z].Internal report University of Pisa,1997.
  • 5Blomer J,Mitzenmacher M,Shokrollahi A.An XOR-based erasure-resilient coding scheme,ICSI Technical Report,No.TR-95048[R].I995.
  • 6Gallager R G.Low-Density Parity-Cheek Codes[M].MIT Press,Cambridge,MA,1963.
  • 7Byers W,Luby M,Mitzenmacher M,et,al.A Digital Fountain Approach to Reliable Distribution of Bulk Data[Z].SIGCOMM,1998:56-67.
  • 8DruschelP,RowstronA.PAST:ALarge-scale,persistentpeer-to-peerstorageutility[C]//Proceedingsofthe8thWorkshoponHotTopicsinOperatingSystems.SclossElmau:JasonFlinn,2001.
  • 9RizzoL.Effectiveerasurecodesforreliablecomputercommunicationprotocols[J].ACMSIGCOMMComputerCommunicationReview,1997,27(2):24-36.
  • 10RizzoL.OnthefeasibilityofsoftwareFEC[EB/OL].(1997-01-31)[2014-05-18].http://www.iet.unipi.it/luigi/softfcc.ps.

引证文献3

二级引证文献12

微处理机
2008年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部