Response Time Analysis of Distributed File System Based on Fork-join Queue Model ⋆

Application performance is criterion for distributed storage system evaluation, and hence the specific task of system configuration and performance tuning for these application is of great interest. The effectiveness of automatic storage management depends on the accuracy of the storage performance models that are used for making resource optimization configuration. Distributed file system plays a key role in mass distributed storage system. Although the potential advantages of distributed file system in application workloads have been documented, the potential impact to application performance in mass distributed storage environments is not clearly understood. This paper presents a response time analysis approach based on fork-join queue model for distributed file system. The performance technique is potentially useful in the early phases of design distributed storage system when several candidate configurations have to be evaluated quickly. The experiments validate our response time analysis model and prove our approach is appropriated to build performance model for distributed storage system.

[1]  Elizabeth Varki,et al.  Response Time Analysis of Parallel Computer and Storage Systems , 2001, IEEE Trans. Parallel Distributed Syst..

[2]  Verdi March,et al.  Evaluation of a Performance Model of Lustre File System , 2010, 2010 Fifth Annual ChinaGrid Conference.

[3]  GhemawatSanjay,et al.  The Google file system , 2003 .

[4]  Nāgārjuna,et al.  A Secure Erasure Code-Based Cloud Storage System with Secure Data Forwarding , 2014 .

[5]  Jeffrey S. Vetter,et al.  Exploiting Lustre File Joining for Effective Collective IO , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[7]  Jeffrey S. Vetter,et al.  Empirical Analysis of a Large-Scale Hierarchical Storage System , 2008, Euro-Par.

[8]  Yinliang Yue,et al.  High Availability Storage System Based on Two-Level Metadata Management , 2007, 2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007).

[9]  Asser N. Tantawi,et al.  Approximate Analysis of Fork/Join Synchronization in Parallel Queues , 1988, IEEE Trans. Computers.

[10]  Depei Qian,et al.  A High Availability Mechanism for Parallel File System , 2005, APPT.

[11]  Nan Wang,et al.  The feasibility research of cloud storage based on Global File System , 2012, 2012 9th International Conference on Fuzzy Systems and Knowledge Discovery.

[12]  Jarek Nieplocha,et al.  Evaluation of active storage strategies for the lustre parallel file system , 2007, Proceedings of the 2007 ACM/IEEE Conference on Supercomputing (SC '07).

[13]  Elizabeth Varki,et al.  Response time analysis of two server fork-join systems , 1996, Proceedings of MASCOTS '96 - 4th International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[14]  Jeffrey S. Vetter,et al.  Performance characterization and optimization of parallel I/O on the Cray XT , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[15]  Qiang Cao,et al.  Approximate parameters analysis of a closed fork-join queue model in an object-based storage system , 2009, International Workshop on Information Data Storage and International Symposium on Optical Storage.

[16]  Min Wang,et al.  Characteristics Analysis of Aggregate Workload on Storage System , 2007, Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007).

[17]  Hairong Kuang,et al.  The Hadoop Distributed File System , 2010, 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST).