Nexus: A Novel Weighted-Graph-Based Prefetching Algorithm for Metadata Servers in Petabyte-Scale Storage Systems, in Proceedings of International Symposium on Cluster Computing and the Grid (CCGrid, 2006), May 16-19, 2006, Singapore, pp. 409-416. (Acceptance rate: 61/257 = 25.7%).
Abstract
An efficient, accurate and distributed metadataoriented prefetching scheme is critical to the overall performance in large distributed storage systems. In this paper, we present a novel weighted-graph-based prefetching technique, built on successor relationship, to gain 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 prefetching algorithm, the hit rate for metadata access on the client site can be increased by up to 13%, while the average response time of metadata operations can be reduced by up to 67%, compared with LRU and an existing state of the art prefetching algorithm.
BibTeX Entry
	@inproceedings{yzhu_ccgrid06, author = {Peng Gu and Yifeng Zhu and Hong Jiang and Jun Wang}, title = {Nexus: A Novel Weighted-Graph-Based Prefetching Algorithm for Metadata Servers in Petabyte-Scale Storage Systems}, booktitle = {CCGRID '06: Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)}, year = {2006}, isbn = {0-7695-2585-7}, pages = {409--416}, publisher = {IEEE Computer Society}, address = {Washington, DC, USA}, }
Full Paper
pdf
Last modified on October 16, 2007