|
DSpace at Cochin University >
Department of Computer Science >
Seminar Reports >
MTech 2009-2011 Batch >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/258
|
| Title: | Google File System |
| Authors: | SARITHA, S |
| Keywords: | Distributed File System data Google File System master chunk chunkservers garbage collection fault tolerance |
| Issue Date: | 14-Jun-2010 |
| Abstract: | The great success of Google Inc. is attributed not only to its efficient search algorithm, but also to the underlying commodity hardware and, thus the file system. As the number of applications run by Google increased massively, Google’s goal became to build a vast storage network out of inexpensive commodity hardware. Google created its own file system, named as Google File System. Google File System was innovatively created by Google engineers and ready for production in record time in a span of one year in 2003, which speeded Google’s market thereafter. Google File system is the largest file system in operation. Formally, Google File System (GFS) is a scalable distributed file system for large distributed data intensive applications.
In the design phase of GFS, points which were given stress includes component failures are the norm rather than the exception, files are huge in the order of MB & TB and files are mutated by appending data. The entire file system is organized hierarchically in directories and identified by pathnames. The architecture comprises of a single master, multiple chunk servers and multiple clients. Files are divided into chunks, which is the key design parameter. Google File System also uses leases and mutation order in their design to achieve consistency and atomicity. As of fault tolerance, GFS is highly available, replicas of chunk servers and master exists. |
| URI: | http://hdl.handle.net/123456789/258 |
| Appears in Collections: | MTech 2009-2011 Batch
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|