Module6分布式文件系统.ppt

Google Cluster Computing Faculty Training Workshop Module VI: Distributed Filesystems Outline Filesystems overview NFS AFS (Andrew File System) GFS File Systems Overview System that permanently stores data Usually layered on top of a lower-level physical storage medium Divided into logical units called “files” Addressable by a filename (“foo.txt”) Usually supports hierarchical nesting (directories) File Paths A file path joins file directory names into a relative or absolute address to identify a file Absolute: /home/aaron/foo.txt Relative: docs/someFile.doc The shortest absolute path to a file is called its canonical path The set of all canonical paths establishes the namespace for the filesystem What Gets Stored User data itself is the bulk of the file systems contents Also includes meta-data on a drive-wide and per-file basis: High-Level Organization Files are organized in a “tree” structure made of nested directories One directory acts as the “root” “links” (symlinks, shortcuts, etc) provide simple means of providing multiple access paths to one file Other file systems can be “mounted” and dropped in as sub-hierarchies (other drives, network shares) Low-Level Organization (1/2) File data and meta-data stored separately File descriptors + meta-data stored in inodes Large tree or table at designated location on disk Tells how to look up file contents Meta-data may be replicated to increase system reliability Low-Level Organization (2/2) “Standard” read-write medium is a hard drive (other media: CDROM, tape, ...) Viewed as a sequential array of blocks Must address ~1 KB chunk at a time Tree structure is “flattened” into blocks Overlapping reads/writes/deletes can cause fragmentation: files are often not stored with a linear layout inodes store all block ids related to file Fragmentation Design Considerations Smaller inode size reduces amount of wasted space Larger inode size increases speed of sequential reads (may not help random access) Should the file sy