OPTIMAL CLUSTERING SIZE OF SMALL FILE ACCESS IN NET WORK ATTACHED STORAGE DEVICE

被引:5
作者
Deng, Yuhui [1 ]
Wang, Frank [1 ]
Helian, N. A. [2 ]
Feng, Dan [3 ]
Zhou, K. E. [3 ]
机构
[1] Cambridge Cranfield High Performance Comp Facil, Ctr Grid Comp, Cranjield Univ Campus, Cranfield MK43 0AL, Beds, England
[2] London Metropolitan Univ, London, England
[3] Huazhong Univ Sci & Technol, Minist Educ, Sch Comp, Key Lab Data Storage Syst, Wuhan 430074, Hubei, Peoples R China
关键词
Small File Access; Clustering; NAS; Disk Service Time; Performance Model;
D O I
10.1142/S0129626406002800
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Email and short message service are pervasive on the Internet now and continue to grow rapidly, which propels the research on small file access in storage systems. The Clustering technology places logical data blocks of multiple small files on physically contiguous disk blocks and accesses them as a single unit, which is normally adopted to improve small file access performance. This paper constructs a mathematical analysis model to discover the optimal clustering size of small file access in Network Attached Storage (NAS). The analysis results indicate that the optimal clustering size for small file access is the product of one cylinder size and disk number in NAS. Experimental results give a useful validation of our analysis. The analysis results can be applied to optimize the NAS oriented system software and the corresponding application software design.
引用
收藏
页码:501 / 512
页数:12
相关论文
共 23 条
[1]  
Ahn WH, 2002, MASCOTS 2002: 10TH IEEE INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS, AND SIMULATION OF COMPUTER AND TELECOMMUNICATIONS SYSTEMS, PROCEEDINGS, P71, DOI 10.1109/MASCOT.2002.1167062
[2]  
*ANSI, 1993, X3131 ANSI
[3]  
Baker M. G., 1991, Operating Systems Review, V25, P198, DOI 10.1145/121133.121164
[4]   DESIGN AND PERFORMANCE ANALYSIS OF A DISK ARRAY SYSTEM [J].
CATANIA, V ;
PULIAFITO, A ;
RICCOBENE, S ;
VITA, L .
IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (10) :1236-1247
[5]  
Cortes T, 2001, USENIX ASSOCIATION PROCEEDINGS OF THE 2001 USENIX ANNUAL TECHNICAL CONFERENCE, P119
[6]   DISK ARRAYS - HIGH-PERFORMANCE, HIGH-RELIABILITY STORAGE SUBSYSTEMS [J].
GANGER, GR ;
WORTHINGTON, BL ;
HOU, RY ;
PATT, YN .
COMPUTER, 1994, 27 (03) :30-36
[7]  
GANGER GR, 1997, ANN USENIX TECHN C A, P1
[8]   A cost driven disk scheduling algorithm for multimedia object retrieval [J].
Ghandeharizadeh, S ;
Huang, LG ;
Kamel, I .
IEEE TRANSACTIONS ON MULTIMEDIA, 2003, 5 (02) :186-196
[9]   Network attached storage architecture [J].
Gibson, GA ;
Van Meter, R .
COMMUNICATIONS OF THE ACM, 2000, 43 (11) :37-45
[10]  
Jin H, 2000, CONCURRENCY-PRACT EX, V12, P909, DOI 10.1002/1096-9128(20000825)12:10<909::AID-CPE516>3.0.CO