By Topic

CEFLS: A Cost-Effective File Lookup Service in a Distributed Metadata File System

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Xiuqiao Li ; Sch. of Comput. Sci. & Eng., Beihang Univ., Beijing, China ; Bin Dong ; Limin Xiao ; Li Ruan
more authors

As large file systems increasingly grow in size, metadata operations become one of the major performance bottlenecks that constrain the overall I/O performance. Previous analysis on I/O workloads shows the file lookup operation makes up a large proportion of metadata operations. Existing optimizations for lookup operations such as MHS method employ the directory lookup table (DLT) to avoid directory traversal. However, the inefficient design of DLT produces large amount of storage cost and rename overhead, not suitable for large file systems. In this paper, we present a cost-effective file lookup service (CEFLS) for a distributed metadata file system. Our method benefits from efficient partition method and structures to increase the cache efficiency for DLT. Extensive simulations show that the percentages of cached directories with CELFS can be increased by factors of up to 305 and 279 percent compared with MHS when the cache size on each metadata server is configured as 1GB and 2GB, respectively. Meanwhile, CELFS can also significantly reduce the average latency for both file lookup and directory rename operations.

Published in:

Cluster, Cloud and Grid Computing (CCGrid), 2012 12th IEEE/ACM International Symposium on

Date of Conference:

13-16 May 2012