期刊文献+

基于对象分组的集群存储系统可靠性分析模型 被引量:3

Reliability analysis model of cluster storage system by object grouping
在线阅读 下载PDF
导出
摘要 可靠性问题是研究大规模集群存储系统的一个重要方面。借鉴RAID的方法,提出基于对象分组在算法一级实现数据冗余分布的高可靠数据对象布局算法。在数据对象和存储节点失效时,利用冗余数据重构数据对象和存储节点,有效保证存储系统的高可用性。采用马尔可夫激励模型对存储系统进行定量的可用性分析,计算结果表明该方法是有效的。 The reliability of the large-scale cluster storage system is one important research aspect in the related domain. A high-availability data objects placement algorithm was proposed. It groups objected into redundancy sets using RAID at the algorithm level. The redundancy allowed us to reconstruct any corrupted data objects and storage nodes when it failed and assured efficiently the high availability of storage system. The availability of storage system was quantitatively analyzed by using Markov reward model, and the computing results indicate the algorithm is efficient.
出处 《计算机应用》 CSCD 北大核心 2008年第1期36-38,共3页 journal of Computer Applications
基金 国家自然科学基金资助项目(60503042)
关键词 集群存储系统 数据布局 可靠性 马尔可夫模型 cluster storage system data placement reliability Markov model
作者简介 刘仲(1971-),男,湖南邵东人,副教授,博士,主要研究方向:网络存储、并行与分布处理;zhongliu@nudt.edu.cn 李宗伯(1969-),男,湖南桃源人,副教授,博士,主要研究方向:嵌入式系统、体系结构; 阳柳(1979-),女,湖北恩市人,讲师,硕士,主要研究方向:嵌入式系统。
  • 相关文献

参考文献5

  • 1NAGLE D, SERENYI D, MATTHEWS A. The panasas active scale storage cluster delivering scalable high bandwidth storage [C]// BENTON V, ed. Proceedings of the ACM/IEEE SC2004 Conference. Washington: IEEE Computer Society Press, 2004,53-62.
  • 2SCHWAN P.Lustre: Building a file system for 1000 node clusters [C]//JOHN W L,ed. Proceedings of the 2003 Ottawa Linux Symposium. Ottawa: Rod Hat,Inc., 2003,401-407.
  • 3XIN Q, MILLER E L, LONG D D E, et al. Reliability mechanisms for very large storage systems[C]// MOORE R, ed. Proceedings of the 20th IEEE / 11th NASA Goddard Conference on Mass Storage Systems and Technologies. Washington: IEEE Computer Society Press, 2003,146-156.
  • 4刘仲,周兴铭.基于动态区间映射的数据对象布局算法[J].软件学报,2005,16(11):1886-1893. 被引量:16
  • 5BOLCH G, GREINER S, MEER H, et al. Queueing networks and Markov chains[ M]. New York: John Wiley & Sons, 1998.

二级参考文献10

  • 1Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform capacities, In: Maggs B, ed. Proc.of the 14th ACM Syrup. on Parallel Algorithms and Architectures (SPAA). New York: ACM Press, 2002.53-62.
  • 2Honicky RJ, Miller EL. A fast algorithm for online placement and reorganization of replicated data. In: Dongarra J, ed, Proc, of the 17th Int'l Parallel & Distributed Processing Symp. Nice: IEEE Computer Society, 2003.
  • 3Weber RO. Information technology--SCSI object-based storage device commands (OSD), Technical Council Proposal DocumentT10/1355-D, Technical Committee T10, 2004. http://www.t10.org/ftp/tl0/drafts/osd/osd-rl0.pdf.
  • 4Matsumoto M, Nishimura T. Mersenne Twister: A 623-dimensionally equidistributed uniform pseudorandom number generator.ACM Trans. on Modeling and Computer Simulation, 1998,80):3-30.
  • 5Ghemawat S, Gobioff H, Leung ST. The google file system. In: Larry P, ed. Proc. of the 19th ACM Symp. on Operating Systems Principles. New York: ACM Press, 2003. 19-22.
  • 6Xin Q, Miller EL, Long DDE, Brandt SA, Schwarz T, Litwin W. Reliability mechanisms for very large storage systems. In: Moore R, eds. Proc. of the 20th IEEE/the 1 lth NASA Goddard Conf. on Mass Storage Systems and Technologies. Washington: IEEE Computer Society, 2003:146-156.
  • 7LitwinW, Neimat MA, Schneider DA. LH*-A scalable, distributed data structure. ACM Trans. on Database Systems, 1996,21(4):480-525.
  • 8Choy DM, Fagin R, Stockmeyer L. Efficiently extendible mappings for balanced data distribution. Algorithmica, 1996,16(2):215-232.
  • 9Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks. In: Miller G,ed. Proc. of the 12th ACM Symp. on Parallel Algorithms and Architectures (SPAA). New York: ACM Press, 2000. 119-128.
  • 10张悠慧,郑纬民.基于网络附属对象设备的集群存储体系结构[J].软件学报,2003,14(2):293-299. 被引量:6

共引文献15

同被引文献35

  • 1杨德志,黄华,张建刚,许鲁.大容量、高性能、高扩展能力的蓝鲸分布式文件系统[J].计算机研究与发展,2005,42(6):1028-1033. 被引量:28
  • 2张薇,马建峰.LPCA——分布式存储中的数据分离算法[J].系统工程与电子技术,2007,29(3):453-458. 被引量:14
  • 3KUBIATOWICZ J,BINDEL D,CHEN Yan,et al.OceanStore:an architecture for global-scale persistent storage[C] //Proc of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems.New York:ACM Press,2000:190-201.
  • 4RABIN M O.Efficient dispersal of information for security,load ba-lancing,and fault tolerance[J].Journal of the ACM,1989,36(2):335-348.
  • 5KNIGHT J C,SULLIVAN K J,ELDER M C,et al.Survivable architectures:issues and approaches[C] //Proc of DARPA Information Survivability Conference and Exposition.Hilton Head,SC:IEEE Computer Society,2000:157-171.
  • 6KNIGHT J C,HEIMBIGNER D,WOLF A,et al.The willow architecture:comprehensive survivability for large-scale distributed applications[C] //Proc of International Conference on Dependable Systems and Networks.Washington DC:[s.n] ,2002:311-320.
  • 7GANGER G R,KHOSLA P K,BAKKALOGLU M,et al.Survivable storage systems[C] //Proc of DARPA Information Survivability Conference and Exposition.Anaheim,CA:IEEE Press,2001:184-195.
  • 8KNIGHT J C,STRUNK E A,SULLLIVAN K J.Towards a rigorous definition of information system survivability[C] // Proc of DARPA Information Survivability Conference and Exposition.Washington DC:IEEE Computer Society,2003:78-89.
  • 9YU Qing.Current version Fast_DFS_v1.23[EB/OL].[2009-09].http://code.google.com/p/fastdfs/.
  • 10Business Intelligence Lowdown Company.The top 10 largest databases[EB/OL]. ( 2007-02-18) [2011-04-01 ].http ://www.busi- nessintelligencelowdown.com/2007/02/top_ 10_largest_.html.

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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