DocumentCode
174807
Title
Formalizing Google File System
Author
Mengdi Wang ; Bo Li ; Yongxin Zhao ; Geguang Pu
Author_Institution
Shanghai Key Lab. of Trustworthy Comput., East China Normal Univ., Shanghai, China
fYear
2014
fDate
18-21 Nov. 2014
Firstpage
190
Lastpage
191
Abstract
Google File System (GFS) is a distributed file system developed by Google for massive data-intensive applications which is widely used in industries nowadays. In this paper, we present a formal model of Google File System in terms of Communicating Sequential Processes (CSP#), which precisely describes the underlying read/write behaviours of GFS. Based on the achieved model some properties like deadlock-free, and consistency model of GFS can be analyzed and verified in the further work.
Keywords
distributed databases; CSP#; Communicating Sequential Processes; GFS; Google File System formalization; consistency model; deadlock-free properties; distributed file system; formal model; massive data-intensive applications; read/write behaviors; Analytical models; Cloud computing; Computational modeling; Electronic mail; File systems; Google; Servers; CSP#; Formal Modeling; GFS;
fLanguage
English
Publisher
ieee
Conference_Titel
Dependable Computing (PRDC), 2014 IEEE 20th Pacific Rim International Symposium on
Conference_Location
Singapore
Print_ISBN
978-1-4799-6473-4
Type
conf
DOI
10.1109/PRDC.2014.32
Filename
6974788
Link To Document