Translator Disclaimer
Paper
19 March 2009 Approximate parameters analysis of a closed fork-join queue model in an object-based storage system
Author Affiliations +
Proceedings Volume 7125, Eighth International Symposium on Optical Storage and 2008 International Workshop on Information Data Storage; 71251J (2009) https://doi.org/10.1117/12.822592
Event: Eighth International Symposium on Optical Storage and 2008 International Workshop on Information Data Storage, 2008, Wuhan, China
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.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Huai Yang Li, Yan Liu, and Qiang Cao "Approximate parameters analysis of a closed fork-join queue model in an object-based storage system", Proc. SPIE 7125, Eighth International Symposium on Optical Storage and 2008 International Workshop on Information Data Storage, 71251J (19 March 2009); https://doi.org/10.1117/12.822592
PROCEEDINGS
6 PAGES


SHARE
Advertisement
Advertisement
Back to Top