首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Metadata Distribution and Consistency Techniques for Large-Scale Cluster File Systems
【24h】

Metadata Distribution and Consistency Techniques for Large-Scale Cluster File Systems

机译:大型群集文件系统的元数据分布和一致性技术

获取原文
获取原文并翻译 | 示例

摘要

Most supercomputers nowadays are based on large clusters, which call for sophisticated, scalable, and decentralized metadata processing techniques. From the perspective of maximizing metadata throughput, an ideal metadata distribution policy should automatically balance the namespace locality and even distribution without manual intervention. None of existing metadata distribution schemes is designed to make such a balance. We propose a novel metadata distribution policy, Dynamic Dir-Grain (DDG), which seeks to balance the requirements of keeping namespace locality and even distribution of the load by dynamic partitioning of the namespace into size-adjustable hierarchical units. Extensive simulation and measurement results show that DDG policies with a proper granularity significantly outperform traditional techniques such as the Random policy and the Subtree policy by 40 percent to 62 times. In addition, from the perspective of file system reliability, metadata consistency is an equally important issue. However, it is complicated by dynamic metadata distribution. Metadata consistency of cross-metadata server operations cannot be solved by traditional metadata journaling on each server. While traditional two-phase commit (2PC) algorithm can be used, it is too costly for distributed file systems. We proposed a consistent metadata processing protocol, S2PC-MP, which combines the two-phase commit algorithm with metadata processing to reduce overheads. Our measurement results show that S2PC-MP not only ensures fast recovery, but also greatly reduces fail-free execution overheads.
机译:如今,大多数超级计算机都基于大型集群,这需要复杂,可伸缩和分散的元数据处理技术。从最大化元数据吞吐量的角度来看,理想的元数据分发策略应自动平衡名称空间的位置,甚至在没有人工干预的情况下进行分发。现有的元数据分配方案均未旨在实现这种平衡。我们提出了一种新颖的元数据分发策略,动态Dir-Grain(DDG),旨在通过将命名空间动态划分为大小可调的层次单元来平衡保持命名空间局部性和负载分配的需求。大量的仿真和测量结果表明,具有适当粒度的DDG策略比传统技术(如随机策略和子树策略)明显胜过40%至62倍。另外,从文件系统可靠性的角度来看,元数据一致性是一个同样重要的问题。但是,动态元数据分配使它变得复杂。跨元数据服务器操作的元数据一致性无法通过每台服务器上的传统元数据日记来解决。尽管可以使用传统的两阶段提交(2PC)算法,但对于分布式文件系统而言,该算法的成本太高。我们提出了一个一致的元数据处理协议S2PC-MP,该协议将两阶段提交算法与元数据处理相结合以减少开销。我们的测量结果表明,S2PC-MP不仅确保了快速恢复,而且还大大降低了无故障执行开销。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号