A Correlation-Aware Prefetching Strategy for Object-Based File System

被引:0
作者
Sui, Julei [1 ]
Tong, Jiancong [1 ]
Wang, Gang [1 ]
Liu, Xiaoguang [1 ]
机构
[1] Nankai Univ, Coll Informat Tech Sci, Nankai Baidu Joint Lab, Tianjin 300071, Peoples R China
来源
ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PT 1, PROCEEDINGS | 2010年 / 6081卷
关键词
object-based storage; prefetching; object duplication; orthogonal layout;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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%.
引用
收藏
页码:236 / 245
页数:10
相关论文
共 13 条
[1]   Group-based management of distributed file caches [J].
Amer, A ;
Long, DDE ;
Burns, RC .
22ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2002, :525-534
[2]  
[Anonymous], P 15 ACM S OP SYST P
[3]  
BUTT AR, 2005, P 2005 ACM SIGMETRIC, P157
[4]  
Cheng J. R., 1991, Proceedings of the First International Conference on Parallel and Distributed Information Systems (Cat. No.91TH0393-4), P30, DOI 10.1109/PDIS.1991.183064
[5]  
Jiang S, 2005, USENIX ASSOCIATION PROCEEDINGS OF THE 4TH USENIX CONFERENCE ON FILE AND STORAGE TECHNOLOGIES, P101
[6]  
LIU H, 2001, IEEE P 15 INT PAR DI, P62
[7]  
Lonczewski F., 1996, CADUI, V96, P37
[8]  
Nagle David., 2004, SC 04, P53
[9]  
Olson MA, 1999, PROCEEDINGS OF THE FREENIX TRACK, P183
[10]  
PAI R, 2004, P LIN S OTT ONT CAN, P391