操作系统第四章重点介绍.ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
* Physical dump A physical dump starts at block 0 of the disk, write all the disk blocks onto the output tape in order, and stops when it has copied the last one. Advantages: Simplicity Great speed Disadvantages: The inability to skip selected directories The inability to make incremental dumps The inability to restore individual files upon request * Logical dump A logical dump starts at one or more specified directories and recursively (递归地) dumps all files and directories found there that have changed since some given base date (基准日期). * 4.4.3 File System Consistency (文件系统的一致性) Many file systems read blocks, modify them, and write them out later. If the system crashes before all the modified blocks have been written out, the file system can be left in an inconsistent state. To deal with the problem of inconsistent file systems, most computers have a utility program that checks file system consistency. UNIX has fsck Windows has scandisk * File System Consistency Two kinds of consistency checks: Blocks (块的一致性检查) Files (文件的一致性检查) 1. Check for block consistency The program builds two tables, each one containing a counter for each block, initially set to 0. The counters in the first table keep track of how many times each block is present in a file; The counters in the second table record how often each block is present in the free list. * 1. Check for block consistency Figure 4-27. File system states. (a) Consistent. (b) Missing block. (c) Duplicate block in free list. (d) Duplicate data block. * 2. Check for file consistency It also uses a table of counters, but these are per file, rather than per block. It starts at the root directory and recursively descends the tree, inspecting each directory in the file system. For every i-node in every directory, it increments a counter for that file’s usage count. When the check is all done, it has a list, indexed by i-node number, telling how many directories contain each file. It then compares these numbers with th

文档评论(0)

金不换 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档