Google File System

Google File System
Design

GFS is optimized for Google's core data storage and usage needs (primarily the search engine
), Which can generate enormous amounts of data that needs to be retained; ^{[2]
Google file system grew out of an earlier Google effort, "bigfiles ", developed by Larry Page
and Sergey Brin
in the early days of Google, while it was still located in Stanford
. [2]
files are divided into chunks of 64 megabytes
, which are only extremely rarely overwritten, or shrunk; files are usually appended to or read. it is also designed and optimized to run on Google's computing clusters, the nodes of which consist of cheap, "commodity" computers, which means precautions must be taken against the high failure rate of individual nodes and the subsequent data loss. other design decisions select for high data throughputs
, even when it comes at the cost of latency
.}

the nodes are divided into two types: one master
node and a large number of chunkservers
. chunkservers store the data files, with each individual file broken up into fixed size chunks (hence the name) of about 64 megabytes
, ^{[3]
similar to clusters or sectors in regular file systems. each Chunk is assigned a unique 64-bit label, and logical Mappings of files to constituent chunks are maintained. each Chunk is replicated several times throughout the network, with the minimum being three, but even more for files that have high demand or need more redundancy.}

the master server doesn't usually store the actual chunks, but rather all the metadata
associated with the chunks, such as the tables mapping the 64-bit labels to chunk locations and the files they make up, the locations of the copies of the chunks, what processes are reading or writing to a particular chunk, or taking a "snapshot" of the chunk pursuant to replicating it (usually at the instigation of the master server, when, due to node failures, the number of copies of a chunk has fallen beneath the set number ). all this metadata is kept current by the master server periodically updating updates from each chunk server ("heart-beat messages ").

permissions for modifications are handled by a system of time-limited, expiring" leases ", where the master server grants permission to a process for a finite period of time during which no other process will be granted permission by the master server to modify the chunk. the modified chunkserver, which is always the primary chunk holder, then propagates the changes to the chunkservers with the backup copies. the changes are not saved until all chunkservers acknowledge, thus guaranteeing the completion and atomicity
of the operation.

Programs access the chunks by first querying the master server for the locations of the desired chunks; if the chunks are not being operated on (if there are no outstanding leases ), the master replies with the locations, and the program then contacts and reples es the data from the chunkserver directly (similar to Kazaa
And its supernodes
).

As opposed to your filesystems, gfs is not implemented in the kernel of an operating system
, But is instead provided as a userspace library.