操作系统第一章 计算机系统概述.ppt

  1. 1、本文档共49页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
操作系统第一章 计算机系统概述

* Multiple Interrupts * Multiprogramming 多道 Processor has more than one program to execute The sequence the programs are executed depend on their relative priority and whether they are waiting for I/O After an interrupt handler completes, control may not return to the program that was executing at the time of the interrupt * Memory Hierarchy 存储层次 Faster access time, greater cost per bit Greater capacity, smaller cost per bit Greater capacity, slower access speed * Memory Hierarchy * Going Down the Hierarchy Decreasing cost per bit Increasing capacity Increasing access time Decreasing frequency of access of the memory by the processor Locality of reference * Secondary Memory 辅助存储器 Used to store program and data files Nonvolatile 非易失的 Auxiliary memory 辅助存储 * Disk Cache 磁盘高速缓存 A portion of main memory used as a buffer to temporarily to hold data for the disk Disk writes are clustered Some data written out may be referenced again. The data are retrieved rapidly from the software cache instead of slowly from disk * Cache Memory 高速缓存 Invisible to operating system Increase the speed of memory Processor speed is faster than memory speed Exploit the principle of locality * Cache Memory Contains a copy of a portion of main memory Processor first checks cache If not found in cache, the block of memory containing the needed information is moved to the cache and delivered to the processor * Cache/Main Memory System * Cache Read Operation * Cache Design Cache size Small caches have a significant impact on performance Block size The unit of data exchanged between cache and main memory Larger block size more hits until probability of using newly fetched data becomes less than the probability of reusing data that have to be moved out of cache * Cache Design Mapping function Determines which cache location the block will occupy Replacement algorithm Determines which block to replace Least-Recently-Used LRU algorithm * Cache Design Write policy When the memory write

文档评论(0)

sd44055 + 关注
实名认证
内容提供者

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

1亿VIP精品文档

相关文档