World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

OPTIMAL CLUSTERING SIZE OF SMALL FILE ACCESS IN NETWORK ATTACHED STORAGE DEVICE

    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.

    References

    • Garth A. Gibson, Communications of the ACM 43(11), 37 (2000), DOI: 10.1145/353360.353362. Crossref, ISIGoogle Scholar
    • M. Mesnier, G. R. Ganger and E. Riedel, IEEE Communications Magazine 41(8), 84 (2003), DOI: 10.1109/MCOM.2003.1222722. Crossref, ISIGoogle Scholar
    • D. Patterson, G. Gibson and R. Katz, A Case for Redundant Arrays of Inexpensive Disks (RAID), Proc. ACM Conf. on Management of Data pp. 109–116. Google Scholar
    • Gregory R. Gangeret al., Computer 27(3), 30 (1994), DOI: 10.1109/2.268882. Crossref, ISIGoogle Scholar
    • Gregory R. Ganger and M. Frans Kaashoek, Embedded Inodes and Explicit Grouping: Exploiting Disk Bandwidth for Small Files, Annual USENIX Technical Conference (1997) pp. 1–17. Google Scholar
    • M. Bakeret al., Measurements of a Distributed File System, ACM Symposium on Operating Systems Principles (1991) pp. 198–212. Google Scholar
    • W. Vogels, File system usage in Windows NT 4.0, 17th ACM Symposium on Operating Systems Principles pp. 93–109. Google Scholar
    • http://www.namesys.com/ . Google Scholar
    • M. McKusick, W. Joy and S. Leffler, ACM Trans. on Computer Systems 2(3), 181 (1984), DOI: 10.1145/989.990. Crossref, ISIGoogle Scholar
    • W. H. Ahnet al., DFS: A De-Fragmented File System, Proc. 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02) (2002) pp. 71–81. Google Scholar
    • http://log-file-system.area51.ipupdater.com/ . Google Scholar
    • Qingsong Weiet al., Operating Systems Review 37(3), 55 (2003), DOI: 10.1145/881783.881790. CrossrefGoogle Scholar
    • T. Cortes and J. Labarta, Extending Heterogeneity to RAID level 5, Proc. of the 2001 USENIX Technical Conference (2001) pp. 119–132. Google Scholar
    • Jose Renato Santos and Richard R. Muntz, Performance analysis of the rio multimedia storage system with heterogeneous disk configurations, Proc. of the ACM International Multimedia Conference (ACM MM) (1998) pp. 303–308. Google Scholar
    • E. Varkiet al., IEEE Trans. on Parallel and Distributed Systems 15(6), 559 (2004), DOI: 10.1109/TPDS.2004.9. Crossref, ISIGoogle Scholar
    • Bruce L. Worthington, Gregory R. Ganger and Yale N. Patt, Scheduling for Modern Disk Drives and Non-Random Workloads, Proc. of the 1994 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (1994) pp. 241–251. Google Scholar
    • S. Ghandeharizadeh, LiGuo Huang and I. Kamel, IEEE Trans. on Multimedia 5(2), 186 (2003), DOI: 10.1109/TMM.2003.811623. Crossref, ISIGoogle Scholar
    • V. Cataniaet al., IEEE Trans. on Computers 44(10), 1236 (1995), DOI: 10.1109/12.467698. Crossref, ISIGoogle Scholar
    • E. K. Lee and R. Katz, An analytic performance model of disk arrays, ACM Conf. on Measurement and Modeling of Computer Systems (SIGMETRICS) (1993) pp. 98–109. Google Scholar
    • Hai Jin and Kai Hwang, Concurrency: Practice and Experience 12(10), 909 (2000). Crossref, ISIGoogle Scholar
    • J. Schindleret al., Track aligned extents: matching access patterns to disk drive characteristics, Proc. of Conf. on File and Storage Technologies (FAST02) (2002) pp. 259–274. Google Scholar
    • Xinrong Zhou and Tong Wei, A greedy I/O scheduling method in the storage system of clusters, Proc. 3rd IEEE/ACM Int. Symposium on Cluster Computing and the Grid (2003) pp. 712–717. Google Scholar
    • ANSI STD X3.131, Small Computer Systems Interface-2. American, National Standards Institute, 1993 . Google Scholar
    • Peng Chenget al., ACM Computer Architecture News 27(3), 10 (1999), DOI: 10.1145/333680.333688. CrossrefGoogle Scholar
    • Bonnie++ benchmark, http://www.coker.com.au/bonnie++/ . Google Scholar