TY - GEN
T1 - Metadata-intensive I/O optimizations in parallel file systems
AU - Xiao, Limin
AU - Xie, Ke
AU - Li, Xiuqiao
AU - Wu, Qimeng
AU - Ruan, Li
AU - Peng, Junjie
PY - 2014
Y1 - 2014
N2 - With parallel file systems increasingly growing in size, the performance of metadata I/O becomes critical for overall performance. Metadata-intensive applications create a lot of metadata I/O requests with a small amount of data, making metadata access become the bottleneck of system. We propose an optimization method based on aggregating and merging requests for metadataintensive I/O to deal with this problem. Extensive simulations show that the aggregate throughput of intensive file creating can be increased by up to 15.28 times and average response time can be decreased by factors of up to 99.27 percent when the aggregation period and request interval is configured as 0.8ms and 0.025ms respectively. Simulations also show that the aggregate throughput of intensive metadata access can be increased by up to 8.45 times and average response time can be decreased by factors of up to 99.02 percent when the merging period and request interval is configured as 0.4ms and 0.025ms respectively. Meanwhile, experiments show that our method can scale well with the number of metadata servers and clients.
AB - With parallel file systems increasingly growing in size, the performance of metadata I/O becomes critical for overall performance. Metadata-intensive applications create a lot of metadata I/O requests with a small amount of data, making metadata access become the bottleneck of system. We propose an optimization method based on aggregating and merging requests for metadataintensive I/O to deal with this problem. Extensive simulations show that the aggregate throughput of intensive file creating can be increased by up to 15.28 times and average response time can be decreased by factors of up to 99.27 percent when the aggregation period and request interval is configured as 0.8ms and 0.025ms respectively. Simulations also show that the aggregate throughput of intensive metadata access can be increased by up to 8.45 times and average response time can be decreased by factors of up to 99.02 percent when the merging period and request interval is configured as 0.4ms and 0.025ms respectively. Meanwhile, experiments show that our method can scale well with the number of metadata servers and clients.
KW - Aggregating and merging requests
KW - Metadata-intensive I/O
KW - Parallel file system
UR - https://www.scopus.com/pages/publications/84896032610
U2 - 10.2495/ICFCIT130791
DO - 10.2495/ICFCIT130791
M3 - 会议稿件
AN - SCOPUS:84896032610
SN - 9781845648510
T3 - WIT Transactions on Engineering Sciences
SP - 675
EP - 683
BT - Future Computer and Information Technology
PB - WITPress
T2 - 2013 International Conference on Future Computer and Information Technology, ICFCIT 2013
Y2 - 22 August 2013 through 23 August 2013
ER -