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

基于动态区间映射的数据对象布局算法 被引量：16

A Data Object Placement Algorithm Based on Dynamic Interval Mapping
下载PDF
导出
摘要 高效、可伸缩的数据管理在大规模分布存储系统中日益重要,关键是需要一种能够自动适应存储节点增加或减少的灵活、均衡和可伸缩的数据对象布局与定位方法.提出了一种基于动态区间映射的数据对象布局算法,在均衡数据分配和最少迁移数据方面都是统计意义上最优的,并且支持按照存储节点的权重分配数据和任意的数据对象副本. Efficient and scalable data management becomes increasingly important in large-scale distributed storage systems. A key enabling technique is a flexible, balancing and scalable data object placement and location scheme that automatically adapts to the additions or departures of storage nodes. In this paper, a data object placement algorithm based on dynamic interval mapping is proposed, which is probabilistically optimal in both distributing data evenly and minimizing data movement when storage nodes is changed. Moreover, this algorithm supports weighted allocation of the storage nodes and variable levels of the object replication.
作者 刘仲 周兴铭
机构地区 国防科学技术大学计算机学院
出处 《软件学报》 EI CSCD 北大核心 2005年第11期1886-1893,共8页 Journal of Software
基金 国家自然科学基金~~
关键词 动态区间映射 数据布局 对象存储 均衡分布 可伸缩 dynamic interval mapping data placement object storage balanced distribution scalable
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献10

  • 1Ghemawat 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.
  • 2Xin 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.
  • 3LitwinW, Neimat MA, Schneider DA. LH*-A scalable, distributed data structure. ACM Trans. on Database Systems, 1996,21(4):480-525.
  • 4Choy DM, Fagin R, Stockmeyer L. Efficiently extendible mappings for balanced data distribution. Algorithmica, 1996,16(2):215-232.
  • 5Brinkmann 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.
  • 6Brinkmann 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.
  • 7Honicky 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.
  • 8Weber 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.
  • 9张悠慧,郑纬民.基于网络附属对象设备的集群存储体系结构[J].软件学报,2003,14(2):293-299. 被引量：6
  • 10Matsumoto M, Nishimura T. Mersenne Twister: A 623-dimensionally equidistributed uniform pseudorandom number generator.ACM Trans. on Modeling and Computer Simulation, 1998,80):3-30.

二级参考文献11

  • 1[1]Preslan KW, Barry AP, Brassow J. Scalability and failure recovery in a Linux cluster file system. In: Salus P, ed. Proceedings of the 4th Annual Linux Showcase and Conference. Atlanta: ACM Press, 2000. 8～10.
  • 2[2]Ji M, Felten E, Wang R, Singh JP. Archipelago: an island-based file system for highly available and scalable internet services. In: Chen JB, Draves R, eds. Proceedings of the 4th USENIX Windows Systems Symposium. Washington: USENIX Press, 2000. 37～48.
  • 3[3]Grimm R, Swift MM, Levy HM. Revisiting structured storage: a transactional record store. Technical Report, UW-CSE-00-04-01, Department of Computer Science and Engineering, University of Washington. 2000. http://www.cs.washington.edu/homes/rgrimm/ papers/tr00-04-01.pdf.
  • 4[4]Goldman R, McHugh J, Widom J. From semistructured data to XML: migrating the lore data model and query language. In: Maedche A, Sattler K-U, eds. Proceedings of the 2nd International Workshop on the Web and Databases. Philadelphia, Pennsylvania: USENIX Press, 1999. 12～20.
  • 5[5]Gribble SD, Brewer EA, Hellerstein JM. Scalable, distributed data structures for Internet service construction. In: Jones MB, Kaashoek F, eds. Proceedings of the 4th Symposium on Operating Systems Design and Implementation. San Diego: USENIX Press, 2000. 68～76.
  • 6[6]Carey MJ, DeWitt DJ, Franklin MJ. Shoring up persistent applications. In: Snodgrass RT, Winslett M, eds. Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data. Minnesota: ACM Press. 1994. 383～394.
  • 7[7]Gibson GA, Nagle DF, William, CII. NASD scalable storage systems. In: Rubin A, Antonelli C, eds. Proceedings of the USENIX'99, Extreme Linux Workshop. Monterey: USENIX Press, 1999. 121～130.
  • 8[8]Gibson G. File server scaling with network-attached secure disks. In: Leutenegger S, ed. Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems. Washington: ACM Press, 1997. 272～284.
  • 9[9]Shriver E. A formalization of the attribute mapping problem. Technical Report, HPL-1999-127, HP Labs, 1999. http://www.hpl.hp. com/techreports/1999/HPL-1999-127.pdf.
  • 10[10]GM: the low-level message-passing system for Myrinet networks. Technical Reports, Myricom Company. 2001. http://www. myricom.com/scs/index.html.

共引文献5

同被引文献118

引证文献16

二级引证文献58

软件学报
2005年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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