Title

A Novel Weighted-Graph-Based Grouping Algorithm for Metadata Prefetching

Authors

Authors

P. Gu; J. Wang; Y. F. Zhu; H. Jiang;P. J. Shang

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

IEEE Trans. Comput.

Keywords

Prefetch; algorithm; metadata; storage; Computer Science, Hardware & Architecture; Engineering, Electrical &; Electronic

Abstract

Although data prefetching algorithms have been extensively studied for years, there is no counterpart research done for metadata access performance. Existing data prefetching algorithms, either lack of emphasis on group prefetching, or bearing a high level of computational complexity, do not work well with metadata prefetching cases. Therefore, an efficient, accurate, and distributed metadata-oriented prefetching scheme is critical to leverage the overall performance in large distributed storage systems. In this paper, we present a novel weighted-graph-based prefetching technique, built on both direct and indirect successor relationship, to reap performance benefit from prefetching specifically for clustered metadata servers, an arrangement envisioned necessary for petabyte-scale distributed storage systems. Extensive trace-driven simulations show that by adopting our new metadata prefetching algorithm, the miss rate for metadata accesses on the client site can be effectively reduced, while the average response time of metadata operations can be dramatically cut by up to 67 percent, compared with legacy LRU caching algorithm and existing state-of-the-art prefetching algorithms.

Journal Title

Ieee Transactions on Computers

Volume

59

Issue/Number

1

Publication Date

1-1-2010

Document Type

Article

Language

English

First Page

1

Last Page

15

WOS Identifier

WOS:000272314600001

ISSN

0018-9340

Share

COinS