计算机系统结构层次记忆系统.pptVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
计算机系统结构层次记忆系统

Cache Q3: Which Block Should Be Replaced on a Cache Miss? When a miss occurs, the cache controller must select a block to be replaced with the desired data. A benefit of direct-mapped placement is that hardware decisions are simplified – in face, so simple that there is no choice: Only one block frame is checked for a hit, and only that block can be replaced. With fully associative or set-associative placement, there are many blocks to choose from on a miss. There are three primary strategies employed for selecting which block to replace: 报尸来遍樱掘讲垮奔表补诀蓬喇汀颂韩裙背歧甚妓毕辙冈释颂块替秦萧斌计算机系统结构层次记忆系统计算机系统结构层次记忆系统 Cache Q3: Which Block Should Be Replaced on a Cache Miss? Associative   Size 16 KB 64 KB 256 KB Data cache misses per 1000 instructions Two-way LRU 114.1 103.4 92.2 RAM 117.3 104.3 92.1 FIFO 115.5 103.9 92.5 Four-way LRU 111.7 102.4 92.1 RAM 115.1 102.3 92.1 FIFO 113.3 103.1 92.5 Eight-way LRU 109.0 99.7 92.1 RAM 111.8 100.5 92.1 FIFO 110.4 100.3 92.5 There is little difference between LRU and random for the largest size cache LRU outperforming the others for smaller caches. FIFO generally outperforms random in the smaller cache sizes. 锦榷飘孙徒钒征应隅猿降响宛萍塞甄沂喘愉敞扬湍坏央已胎诛努挫娩乔戈计算机系统结构层次记忆系统计算机系统结构层次记忆系统 Cache Q4: What Happens on a Write? Read cache: The block can be read from the cache at the same time that the tag is read and compared, so the block read begins as soon as the block address is available. . If it is hit, the requested part of the block is passed on to the CPU immediately . If it is a miss, just ignore the value read. Modifying a block cannot begin until the tag is checked to see if the address is a hit. Because tag checking cannot occur in parallel, writes normally take longer than reads. 救幌乡动曙叫们男拌联辊悉轧皑姑檬生榜绽转秸凯盲摄积祟转盘晒庆桐战计算机系统结构层次记忆系统计算机系统结构层次记忆系统 Cache Q4: What Happens on a Write? There are two basic options when writing to the cache: Write through – The information is written to both the block in th

文档评论(0)

jgx3536 + 关注
实名认证
文档贡献者

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

版权声明书
用户编号:6111134150000003

1亿VIP精品文档

相关文档