Can a Decentralized Metadata Service Layer Benefit Parallel Filesystems?

V. Meshram, Xavier Besseron, Xiangyong Ouyang, R. Rajachandrasekar, R. Prakash, D. Panda
{"title":"Can a Decentralized Metadata Service Layer Benefit Parallel Filesystems?","authors":"V. Meshram, Xavier Besseron, Xiangyong Ouyang, R. Rajachandrasekar, R. Prakash, D. Panda","doi":"10.1109/CLUSTER.2011.85","DOIUrl":null,"url":null,"abstract":"The demand for scalable I/O continues to grow rapidly as computer clusters keep growing. Much of the research in storage systems has been focused on improving the scale and performance of I/O throughput. Scalable file systems do a good job of scaling large file access bandwidth by striping or sharing I/O resources across many servers or disks. However, the same cannot be said about scaling file metadata operation rates. Most existing parallel file systems choose to concentrate all the metadata processing load on a single server. This centralized processing can guarantee the correctness, but it severely hampers scalability. This downside is becoming more and more unacceptable as metadata throughput is critical for large scale applications. Distributing metadata processing load is critical to improve metadata scalability when handling huge number of client nodes. However, a solution to speed up metadata operations has to address two challenges simultaneously, namely the scalability and reliability. In this paper, we have designed a decentralized metadata service layer and evaluated its benefits and shortcomings that concern parallel file systems. The main aim of this service layer is to maintain reliability and consistency in a distributed metadata environment. At the same time we also focus on improving the scalability of the metadata operations, and in turn, the scalability of the underlying parallel file system. As demonstrated by experiments, the approach presented in this paper achieves significant improvements over native parallel file systems by large margin for all the major metadata operations. With 256 client processes, our decentralized metadata service outperforms Lustre and PVFS2 by a factor of 1.9 and 23, respectively, to create directories. With respect to stat() operation on files, our approach is 1.3 and 3.0 times faster than Lustre and PVFS.","PeriodicalId":200830,"journal":{"name":"2011 IEEE International Conference on Cluster Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLUSTER.2011.85","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

The demand for scalable I/O continues to grow rapidly as computer clusters keep growing. Much of the research in storage systems has been focused on improving the scale and performance of I/O throughput. Scalable file systems do a good job of scaling large file access bandwidth by striping or sharing I/O resources across many servers or disks. However, the same cannot be said about scaling file metadata operation rates. Most existing parallel file systems choose to concentrate all the metadata processing load on a single server. This centralized processing can guarantee the correctness, but it severely hampers scalability. This downside is becoming more and more unacceptable as metadata throughput is critical for large scale applications. Distributing metadata processing load is critical to improve metadata scalability when handling huge number of client nodes. However, a solution to speed up metadata operations has to address two challenges simultaneously, namely the scalability and reliability. In this paper, we have designed a decentralized metadata service layer and evaluated its benefits and shortcomings that concern parallel file systems. The main aim of this service layer is to maintain reliability and consistency in a distributed metadata environment. At the same time we also focus on improving the scalability of the metadata operations, and in turn, the scalability of the underlying parallel file system. As demonstrated by experiments, the approach presented in this paper achieves significant improvements over native parallel file systems by large margin for all the major metadata operations. With 256 client processes, our decentralized metadata service outperforms Lustre and PVFS2 by a factor of 1.9 and 23, respectively, to create directories. With respect to stat() operation on files, our approach is 1.3 and 3.0 times faster than Lustre and PVFS.
去中心化的元数据服务层能使并行文件系统受益吗?
随着计算机集群的不断增长,对可伸缩I/O的需求也在持续快速增长。存储系统的许多研究都集中在提高I/O吞吐量的规模和性能上。可扩展文件系统通过在许多服务器或磁盘上分割或共享I/O资源,可以很好地扩展大型文件访问带宽。但是,扩展文件元数据操作速率就不是这样了。大多数现有的并行文件系统选择将所有元数据处理负载集中在一台服务器上。这种集中处理可以保证正确性,但严重阻碍了可伸缩性。随着元数据吞吐量对大规模应用程序至关重要,这种缺点变得越来越难以接受。在处理大量客户端节点时,分配元数据处理负载对于提高元数据可伸缩性至关重要。然而,加速元数据操作的解决方案必须同时解决两个挑战,即可伸缩性和可靠性。在本文中,我们设计了一个分散的元数据服务层,并评估了其与并行文件系统相关的优点和缺点。该服务层的主要目的是维护分布式元数据环境中的可靠性和一致性。同时,我们还着重于提高元数据操作的可伸缩性,进而提高底层并行文件系统的可伸缩性。实验证明,本文提出的方法在所有主要元数据操作方面都比本地并行文件系统取得了显著的改进。使用256个客户端进程,我们的分散式元数据服务在创建目录方面的性能分别比Lustre和PVFS2高出1.9倍和23倍。关于文件上的stat()操作,我们的方法比Lustre和PVFS快1.3倍和3.0倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信