{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:06:14Z","timestamp":1648512374518},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p> 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. <\/jats:p>","DOI":"10.1142\/s0129626406002800","type":"journal-article","created":{"date-parts":[[2006,12,20]],"date-time":"2006-12-20T06:24:00Z","timestamp":1166595840000},"page":"501-512","source":"Crossref","is-referenced-by-count":4,"title":["OPTIMAL CLUSTERING SIZE OF SMALL FILE ACCESS IN NETWORK ATTACHED STORAGE DEVICE"],"prefix":"10.1142","volume":"16","author":[{"given":"YUHUI","family":"DENG","sequence":"first","affiliation":[{"name":"Center for Grid Computing, Cambridge-Cranfield High Performance Computing Facilities, Cranfield University Campus, Bedfordshire MK430AL, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FRANK","family":"WANG","sequence":"additional","affiliation":[{"name":"Center for Grid Computing, Cambridge-Cranfield High Performance Computing Facilities, Cranfield University Campus, Bedfordshire MK430AL, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"NA","family":"HELIAN","sequence":"additional","affiliation":[{"name":"London Metropolitan University, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAN","family":"FENG","sequence":"additional","affiliation":[{"name":"Key Laboratory of Data Storage System, Ministry of Education, School of Computer, Huazhong University of Science and Technology, Wuhan 430074, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"KE","family":"ZHOU","sequence":"additional","affiliation":[{"name":"Key Laboratory of Data Storage System, Ministry of Education, School of Computer, Huazhong University of Science and Technology, Wuhan 430074, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1145\/353360.353362"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2003.1222722"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/2.268882"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1145\/989.990"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1145\/881783.881790"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.9"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2003.811623"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1109\/12.467698"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1002\/1096-9128(20000825)12:10<909::AID-CPE516>3.0.CO;2-D"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1145\/333680.333688"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626406002800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T09:29:19Z","timestamp":1565170159000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626406002800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":10,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S0129626406002800"],"URL":"https:\/\/doi.org\/10.1142\/s0129626406002800","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}