Applying Aggregate I/O to Improve Performance of Network Storage

Cao Qiang and Xie Changsheng

Journal of Computer Research and Development > 2005 > 42(4): 544-550.

Cao Qiang and Xie Changsheng. Applying Aggregate I/O to Improve Performance of Network Storage[J]. Journal of Computer Research and Development, 2005, 42(4): 544-550.

Citation:

Cao Qiang and Xie Changsheng. Applying Aggregate I/O to Improve Performance of Network Storage[J]. Journal of Computer Research and Development, 2005, 42(4): 544-550.

Citation:

Cao Qiang and Xie Changsheng. Applying Aggregate I/O to Improve Performance of Network Storage[J]. Journal of Computer Research and Development, 2005, 42(4): 544-550.

PDF (383 KB)

Applying Aggregate I/O to Improve Performance of Network Storage

Cao Qiang and Xie Changsheng

(Data Storage System Laboratory, School of Computer Science and Technology, Huaz hong University of Science and Technology, Wuhan 430074)

More Information

Published Date: April 14, 2005

Graphical Abstract

Abstract

Abstract

Network storage provide high scalability, availability and flexible for storage systems, and are widely applied to many fields. Small I/O seriously affects the performance of the storage system including network storage. Current several met hods want a theory model and only improve write performance. In this paper, the aggregate I/O model is presented first. Moreover, how to apply this methodology in a NAS system is also illustrated based on IP network. The aggregate I/O modul e called CFS (chunk file system) is designed at both the NAS device and the cust omer end. In the experiment, the analysis of the results shows correctness of th e model and an improvement made by aggregate I/O for network storage performance .
- network storage,
- aggregate I/O,
- queuing model

FullText(HTML)

References (0)

[1]	LiuPeixia, JiangHaitao, ZhuDaming. Complexity and Algorithm for Minimum Breakpoint Median from PQ-trees[J]. Journal of Computer Research and Development, 2016, 53(3): 644-650. DOI: 10.7544/issn1000-1239.2016.20148258
[2]	Xu Yuming, Zhu Ningbo, Ouyang Aijia, and Li Kenli. A Double-Helix Structure Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems[J]. Journal of Computer Research and Development, 2014, 51(6): 1240-1252.
[3]	Li Kenli, Luo Xing, Wu Fan, Zhou Xu, and Huang Xin. An Algorithm in Tile Assembly Model for Maximum Clique Problem[J]. Journal of Computer Research and Development, 2013, 50(3): 666-675.
[4]	Zhou Xu, Li Kenli, Yue Guangxue, Yang Zhibang. A Volume Molecular Solution for the Maximum Matching Problem on DNA-Based Computing[J]. Journal of Computer Research and Development, 2011, 48(11): 2147-2154.
[5]	Wang Bin, Guo Qing, Li Zhongbo, Yang Xiaochun. Index Structures for Supporting Block Edit Distance[J]. Journal of Computer Research and Development, 2010, 47(1): 191-199.
[6]	Li Kenli, Liu Jie, Yang Lei, Liu Wenbin. An O(1.414\+n) Volume Molecular Solutions for the Exact Cover Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2008, 45(10): 1782-1788.
[7]	Jiang He, Zhang Xianchao, Che Haoyang, Chen Guoliang. A Multi-Commodity Flow Linear Programming with Polynomial Constraints for Black and White Traveling Salesman Problem[J]. Journal of Computer Research and Development, 2007, 44(10): 1796-1800.
[8]	Li Kenli, Yao Fengjuan, Li Renfa, Xu Jin. Improved Molecular Solutions for the Knapsack Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2007, 44(6): 1063-1070.
[9]	Zhao Baohua, Guo Xionghui, QianLan, and Qu Yugui. On the Problem of How to Place the Observers in Passive Testing[J]. Journal of Computer Research and Development, 2005, 42(10): 1815-1819.
[10]	Zhou Huaqi, Lu Mingming, and Zhu Hong. A Preemptive Scheduling Problem with Different Interrupted Time Cost on Identical Parallel Machines[J]. Journal of Computer Research and Development, 2005, 42(3).