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
相关论文
共 9 条
  • [1] A strategy of small file storage access with performance optimization
    Zhao, Yuelong
    Xie, Xiaoling
    Cai, Yongcai
    Wang, Guohua
    Liu, Lin
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2012, 49 (07): : 1579 - 1586
  • [2] A small file merging and prefetching strategy based on access task in cloud storage
    Wang, T. (wangtao.mac@gmail.com), 1600, Editorial Board of Medical Journal of Wuhan University (38):
  • [3] Determining the optimal file size on tertiary storage systems based on the distribution of query sizes
    Bernardo, LM
    Nordberg, H
    Rotem, D
    Shoshani, A
    TENTH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT - PROCEEDINGS, 1998, : 22 - 31
  • [4] Enabling Union Page Cache to Boost File Access Performance of NVRAM-Based Storage Device
    Chen, Shuo-Han
    Chen, Tseng-Yi
    Chang, Yuan-Hao
    Wei, Hsin-Wen
    Shih, Wei-Kuan
    2018 55TH ACM/ESDA/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2018,
  • [5] Research on Optimal Access of Fluctuation Source and Storage Device in DN Based on Statistical and Fuzzy Theory
    Cao, Shuang
    Fu, Lijun
    Wang, Xingyue
    Liu, Hongda
    2016 IEEE 8TH INTERNATIONAL POWER ELECTRONICS AND MOTION CONTROL CONFERENCE (IPEMC-ECCE ASIA), 2016, : 201 - 206
  • [6] Small-d MSR Codes With Optimal Access, Optimal Sub-Packetization, and Linear Field Size
    Vajha, Myna
    Balaji, S. B.
    Kumar, P. Vijay
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (07) : 4303 - 4332
  • [7] Optimal Size of Photovoltaic Systems with Storage for Office and Residential Loads in the Italian Net-Billing Scheme
    Ciocia, Alessandro
    Ahmad, Jawad
    Chicco, Gianfranco
    Di Leo, Paolo
    Spertino, Filippo
    2016 51ST INTERNATIONAL UNIVERSITIES POWER ENGINEERING CONFERENCE (UPEC), 2016,
  • [8] DATA CONVERTER FOR DIFFERENT SIZE DATA SECTORS IN A DIRECT-ACCESS STORAGE DEVICE OF A COMPUTER.
    Anon
    IBM technical disclosure bulletin, 1985, 28 (02): : 525 - 528
  • [9] Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for d = k+1, k+2, k+3
    Vajha, Myna
    Babu, Balaji Srinivasan
    Kumar, P. Vijay
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2376 - 2380