Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ChinaGrid.2010.38
Title: | Evaluation of a performance model of lustre file system | Authors: | Zhao, T. March, V. Dong, S. See, S. |
Keywords: | Lustre Model Parallel file system Performance evaluaion |
Issue Date: | 2010 | Citation: | Zhao, T.,March, V.,Dong, S.,See, S. (2010). Evaluation of a performance model of lustre file system. Proceedings - 5th Annual ChinaGrid Conference, ChinaGrid 2010 : 191-196. ScholarBank@NUS Repository. https://doi.org/10.1109/ChinaGrid.2010.38 | Abstract: | As a large-scale global parallel file system, Lustre file system plays a key role in High Performance Computing (HPC) system, and the potential performance of such systems can be difficult to predict because the potential impact to application performance is not clearly understood. It is important to gain insights into the deliverable Lustre file system IO efficiency. In order to gain a good understanding on what and how to impact the performance of Lustre file system. This paper presents a study on performance evaluation of Lustre file systems and we propose a novel relative performance model to predict overhead under different performance factors. In our previous experiments, we discover that different performance factors have a closed correlation. In order to mining the correlations, we introduce relative performance model to predict performance differences between a pair of Lustre file system equipped with different performance factors. On average, relative model can predict bandwidth within 17%-28%. The results show our relative prediction model can obtain better prediction accuracy. © 2010 IEEE. | Source Title: | Proceedings - 5th Annual ChinaGrid Conference, ChinaGrid 2010 | URI: | http://scholarbank.nus.edu.sg/handle/10635/41903 | ISBN: | 9780769541068 | DOI: | 10.1109/ChinaGrid.2010.38 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.