期刊文献+

Analysis models and methods on the network storage system I/O performance

Analysis models and methods on the network storage system I/O performance
下载PDF
导出
摘要 Network storage provides high scalability, availability and flexibility for storage systems, and is widely applied to many fields. Particularly, I/O performance is of great significance. Its application is wide and expanding rapidly. I/O performance has already become the bottleneck of the whole performance of computer systems for a long time, and under the condition of the present computer technology, I/O performance optimization method looks especially important. In the paper, I/O performance model was analyzed based on the combination of quasi birth, death process and queuing model, and then solved the model. A number of important related performance indicators and the relationship between them were given. By the way of example, this method can show the I/O performance more accurately. Finally, we got some useful conclusions, which may be used to evaluate network storage performance, and are the basis of confirming I/O scheduling strategy. Network storage provides high scalability, availability and flexibility for storage systems, and is widely applied to many fields. Particularly, I/O performance is of great significance. Its application is wide and expanding rapidly. I/O performance has already become the bottleneck of the whole performance of computer systems for a long time, and under the condition of the present computer technology, I/O performance optimization method looks especially important. In the paper, I/O performance model was analyzed based on the combination of quasi birth, death process and queuing model, and then solved the model. A number of important related performance indicators and the relationship between them were given. By the way of example, this method can show the I/O performance more accurately. Finally, we got some useful conclusions, which may be used to evaluate network storage performance, and are the basis of confirming I/O scheduling strategy.
作者 刁莹 姚念民
出处 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2012年第4期37-42,共6页 哈尔滨工业大学学报(英文版)
基金 Sponsored by the National Natural Science Foundation of China(Grant No. 61073047) the Fundamental Research Funds for the Central Universities(Grant No.HEUCFT1007andHEUCF100607) the State Key Laboratory of High-End Server & Storage Technology(Grant No.2009HSSA08)
关键词 I/O performance QUEUING model QUASI BIRTH and DEATH process network STORAGE I/O performance,queuing model,quasi birth and death process,network storage
  • 相关文献

参考文献1

二级参考文献9

  • 1Garth A. Gibson, Rodney Van Meter. Network attached storage architecture. IEEE Internet Computing, 2001, 43(11): 50~ 58.
  • 2Yingwu Zhu, Yiming Hu. UCFS-A novel user-space, high performance, customized file system for Web proxy servers. IEEE Trans. Computers, 2002, 51(9): 1056~1071.
  • 3M. Rosenblum, J. K. Ousterhout. The design and implementation of a log-structured file system. ACM Trans.Computer Systems, 1992, 10(1): 26~52.
  • 4T. Nightingale, Y. Hu, Q. Yang. The design and implementation of DCD device driver for Unix. The 1999USENIX Annual Technical Conf., Monterey, California, USA,1999.
  • 5G.R. Ganger, M. K. McKusick, C. A. N. Soules, et al. Soft updates: A solution to the metadata update problem in file systems. ACM Trans. Computer Systems, 2000, 18(2): 127~153.
  • 6Xubin He, Qing Yang, Ming Zhang. Introducing SCSI-to-IP cache for storage area networks. The 2002 Int'l Conf. Parallel Processing (ICPP'02), Vancouver, B.C., Canada, 2002.
  • 7Darrell Anderson, Jeff Chase. Interposed request routing for scalable network storage. IEEE Trans. Computer Systems (T OCS), 2002, 20(1): 25~48.
  • 8Athicha Muthitacharoen, Benjie Chen. A low-bandwidth network file system. The 18th ACM Symp. Operating Systems Principles (SOSP'01), Chateau Lake Louise, Banff, Canada, 2001.
  • 9曹强,谢长生.网络存储系统中I/O请求响应时间的研究[J].计算机研究与发展,2003,40(8):1271-1276. 被引量:16

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部