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

3MDG:基于动态均衡布局的网格元数据管理模型

3MDG:Grid Metadata Management Model Based on Dynamic Balanceable Placement
下载PDF
导出
摘要 通过对网格及元数据特点分析,给出了一种数据网格环境下的元数据管理模型。该模型目的在于实现分布式的元数据管理平台,负责对元数据的注册、访问及管理。通过建立元数据到存储系统的映射,用户可进行元数据资源的透明访问。为了适应网格中资源的多变性,提出改进的动态区间映射布局算法对元数据进行动态的、均衡的、可伸缩的重布局,以提高存储系统的自适应能力。 This paper proposes a metadata management model for data grid based on dynamic balanceable placement. The model aims to realize a distributed metadata management platform. This platform takes charge of the registry, access and management of metadata. And it implements the mapping from metadata to storage systems. So users can access to metadata resources transparently. In order to meet resource variability in the grid, the model supports a balanceable and scalable metadata placement through an improved data object placement algorithm based on dynamic interval mapping. Its purpose is to improve storage system adaptability.
作者 徐丽萍 李珺
机构地区 华中科技大学计算机科学与技术学院
出处 《计算机工程》 CAS CSCD 北大核心 2007年第21期72-74,77,共4页 Computer Engineering
基金 湖北省自然科学基金资助项目(ABA048)
关键词 元数据 元数据管理 动态区间映射 均衡 布局 metadata metadata management dynamic interval mapping balanceable placement
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献5

  • 1Singh G,Bharathi S,Chervenak A,et al.A Metadata Catalog Service for Data Intensive Applications[C]//Proceedings of the ACM/IEEE SC'03 Conference.2003.
  • 2刘仲,周兴铭.基于动态区间映射的数据对象布局算法[J].软件学报,2005,16(11):1886-1893. 被引量：16
  • 3Brandt S A,Miller E L,Long D D E,et al.Efficient Metadata Management in Large Distributed Storage Systems[C]//Proceedings of the 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies.2003.
  • 4中国科学院计算机网络信息中心科学数据库中心.科学数据库元数据标准框架[Z].2004.
  • 5Matsumoto M,Nishimura T,Twister M.A 623-dimensionally Equidistributed Uniform Pseudo-random Number Generator[J].ACM Transactions on Modeling and Computer Simulation,1998,8(1):3-30.

二级参考文献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

计算机工程
2007年 第21期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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