The prefetching strategies used in modern distributed storage systems generally are based on temporal and/or spatial locality of requests. Due to the special properties of object-based storage systems, however, the traditional tactics are almost incompetent for the job. This paper presents a new prefetching approach, which takes the correlationship among objects into account. Two orthogonal replica distribution algorithms are proposed to aggregate prefetching operations. A moving window mechanism is also developed to control prefetching. We implement these approaches in our object-based file system called NBJLOFS (abbreviated for Nankai-Baidu Joint Lab Object-based File System). The experimental results show that these approaches improves throughput by up to 80%. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Sui, J., Tong, J., Wang, G., & Liu, X. (2010). A correlation-aware prefetching strategy for object-based file system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6081 LNCS, pp. 236–245). https://doi.org/10.1007/978-3-642-13119-6_21
Mendeley helps you to discover research relevant for your work.