存储技术英文PPT1.5.ppt

Intelligent Storage System Copyright ? 2009 EMC Corporation. Do not Copy - All Rights Reserved. Intelligent Storage System Unix File Systems Module 1.5 File Systems File system provides the most fundamental service for building any information systems. file storage, management and retrieve service. We look at two file operations: fp = open (“stf/exam”, r, 0); r = read (fp, n, buf); Hard disk Structure Head, cylinder, sector Data stored in the same cylinder first to reduce the head movement Disk operation in units of sectors Data Block and Block Number File system uses block as a data unit for disk operation Usually a block size is 1K (= sector size) Disk block is referenced by its block # Block # to Physical Address Translation sectors = blk_num ? (#sects-per-blk) cyld_num = sectors ? (#sects-per-cyld) head_num = (sectors mod (#sects-per-cyld)) ? (#sects-per-track) sect_num = sectors mod (#sects-per-track) Internal File Structure Each file has an i-node: file attributes and data index: File attributes: owner, access permissions, access times, file size 12 bytes Data index: 10 direct index, 1 indirect index, 1 double indirect index, 1 triple indirect index 13 * 4 =52 bytes The size of an inode = 64 bytes. An inode is referenced by its inode # Diagram of data index in inode Unix Directory File Directory files are ordinary files consisting of entries mapping names to i-node #s, e.g., directory file /etc After BSD4.3, file names are of variable length (upto 255 bytes). Each entry has the entry-length, name inode #. Directory structure and name resolution Directories are in a tree structure. Convert a pathname recursively to an i-node number, component by component from the root or relative dir: e.g., /users/lecturer/liu/stf/notes/UFS.ppt component name ? inode # inode # ? inode inode ? directory file content directory file content ? inode # (of the next component) Disk Management (inode # ? i-nodes) Super block Each file system has a super block wh