期刊文献+

储存系统数据布局算法进展分析

Overview of Data Layout Algorithm of Storage System
下载PDF
导出
摘要 数据布局是存储系统的基础性问题之一,是提高数据处理效率的关键技术。文章依据储存规模和系统覆盖范围的不同,将储存系统分为磁盘阵列、数据中心和多数据中心三类,分别分析了各自数据布局策略,对各自数据布局算法进展描述,包括典型数据布局算法。最后探讨了数据布局技术发展趋势。 Data layout is one of the issues for data storage system, which is key technology to improve the efficiency of data processing. Based on the data storage size and coverage of storage systems, there are divided intothree categories: disk arrays, data centers and mutil-data center. In this paper, we analyze respective layout strategy and algorithm progress of data layout, including the typical data layout algorithm. Finally, Data layout trends are discussed.
出处 《信息网络安全》 2013年第5期73-78,共6页 Netinfo Security
基金 国家科技支撑计划[2012BAH38B04] 信息网络安全公安部重点实验室开放课题项目资助
关键词 数据布局 存储系统 数据布局策略 data layout storage systems data layout strategies
  • 相关文献

参考文献46

  • 1Gray J. What next? A few remaining problems in information technology[EB/OL], http://research.microsoft.com/-gray/talks/ Gray Turing_FCRC.pdf, 1998.
  • 2Patterson D. Technical perspective: The data center is the computer [J]. Communications of the ACM, 2008, 51(1): 105.
  • 3Bryant R. Data intensive supercomputing: The case for DISC [EB/OL]. http://www.cs.cmu.edu/-bryant/pubdir/cmu/cs/07-128.pdf, 2008-12-10.
  • 4Well S A, Brandt S A, Miller E L, et al. CRUSH: Controlled. scalable and decentralized placement ofreplicated data[C]. Proc of SC 2006. New York: ACM, 2006:122-133.
  • 5张薇,马建峰.LPCA——分布式存储中的数据分离算法[J].系统工程与电子技术,2007,29(3):453-458. 被引量:14
  • 6罗舟,赵跃龙.基于存储区域网(SAN)的数据备份[J].现代电子技术,2004,27(22):33-36. 被引量:11
  • 7覃政仁,吴渝,王国胤.一种基于RoughSet的海量数据分割算法[J].模式识别与人工智能,2006,19(2):249-256. 被引量:7
  • 8Pawlak Z. Rough Set Approach to Multi-Attriute Decision Analysis[J]. European Journal of Operational Research, 1994, 72: 443-459.
  • 9Pawlak Z, Grzymala - Busse J, Slowinski R, et al. Rough Sets[J]. Communications of the ACM, 1995, 38(11): 89- 95.
  • 10姚辉学,卢章平.海量数据多边形布尔运算的区域分割算法[J].中国图象图形学报,2007,12(3):552-557. 被引量:7

二级参考文献118

  • 1韩德志,谢长生,李怀阳.存储备份技术探析[J].计算机应用研究,2004,21(6):1-4. 被引量:49
  • 2刘仲,周兴铭.基于动态区间映射的数据对象布局算法[J].软件学报,2005,16(11):1886-1893. 被引量:16
  • 3谈华芳,孙丽丽,侯紫峰.大规模存储中的一个有效的数据放置算法[J].计算机工程,2006,32(10):47-49. 被引量:4
  • 4王迪,舒继武,薛巍,沈美明.基于块级别的SAN系统自适应分级存储[J].高技术通讯,2007,17(2):111-115. 被引量:8
  • 5Honicky R J, Miller E L. A Fast Algorithm for Online Placement and Reorganization of Replicated Data[C]//Proc of IPDPS'03, 2003.
  • 6Xin Q, Miller E L, Long D D E, et al. Reliability Mechanisms for Very Large Storage Systems[C]// Proc of MSST'03, 2003:146-156.
  • 7Brinkmann A, Effert S, Heide F M A D, et al. Dynamic and Redundant Data Placement[C]//Proc of ICDCS'07, 2007:29.
  • 8Karger D, Lehman E, Leighton T, et al. Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web[C]/// Proc of STOC'97, 1997:654-663.
  • 9Brinkmann A, Salzwedel K, Scheideler C. Efficient, Distributed Data Placement Strategies for Storage Area Networks [C]//Proc of SPAA'00, 2000:119-128.
  • 10Brinkmann A, Salzwedel K, Scheideler C. Compact, Adaptive Placement Schemes for Non-uniform Distribution Requirements[C]// Proc of SPAA'02, 2002:53-62.

共引文献125

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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