Share Email Print
cover

Proceedings Paper

Approximate parameters analysis of a closed fork-join queue model in an object-based storage system
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

As a new generation of high-performance distributed storage system, object-based storage system is being developed to support high-performance computing environments. In the petabyte-scale object-based storage system, reasonable data distribution and parameters configuration can improve system performance and availability. To make the system performance evaluation work easier, we propose an approximate parameters analysis method to build performance model. We firstly model the whole storage system's architecture based on closed Fork-Join queue model; using our system architecture model, we then deduce an approximately analytical expression with erasure codes and replicas to predict the storage system's mean response time under various workloads simulating the real-world condition. Finally, a large number of comparison experiments validate our approximately analytical expression of system performance, and proved that our analytic method is appropriate to build performance model for object-based storage system.

Paper Details

Date Published: 20 March 2009
PDF: 6 pages
Proc. SPIE 7125, Eighth International Symposium on Optical Storage and 2008 International Workshop on Information Data Storage, 71251J (20 March 2009); doi: 10.1117/12.822592
Show Author Affiliations
Huai Yang Li, Huazhong Univ. of Science and Technology (China)
Yan Liu, Huazhong Univ. of Science and Technology (China)
Qiang Cao, Huazhong Univ. of Science and Technology (China)


Published in SPIE Proceedings Vol. 7125:
Eighth International Symposium on Optical Storage and 2008 International Workshop on Information Data Storage
Fuxi Gan, Editor(s)

© SPIE. Terms of Use
Back to Top