2013spring_11_ch4_2计算机体系结构.pdfVIP

  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文档。上传文档
查看更多
LLec 11 11 How to improve cacheHow to improve cache pperfformance ((cont.)) Cache performance metricsCache performance metrics Miss rateMiss rate – Independent of the speed of hardware. Average memory access time( AMAT) – Better than miss rateBetter than miss rate , butbut – Indirect measure of performance CPUtiCPUtime S CA_2013Spring_Lec11_mem 1.2 EEx1: Impact on mpact on Performanc rformance Suppose a processor executes at – Clock Rate = 200 MHz (5 ns per cycle)Clock Rate = 200 MHz (5 ns per cycle), Ideal (no misses) CPI = 1 Ideal (no misses) CPI = 1.11 – 50% arith/logic, 30% ld/st, 20% control Suppose that 10% of memory operations get 50 cycle miss penalty Suppose that 1% of instructions get same miss penalty Calculate the AMAT and real CPI. •Answer:CPI = ideal CPI + average stalls per instruction = 1.1(cycles//ins) + [ 0.30 (DataMops//ins) x 0.10 (miss/DataMop) x 50 (cycle/miss)] + 1 ((InstMopp/ins)) x 0.01 ((miss/InstMop)p) x 50 ((cyycle/miss)])] = (1.1 + 1.5 + .5) cycle/ins = 3.1 •58% of the time the proc is stalled waiting for memory! •AMATAMAT=(1/1(1/1.3)3)x[[11.11+00.0101x5050]]+(0(0.3/13/1.3)3)x[[11.11+00.11x5050]] • =2.54 S CA_2013Spring_Lec11_mem 1.3 Ex2: Imppact on Performance Assume : Ideal CPI=1 (no misses) L/SL/S’s structures structure . 50% of instructions are data accesses50% of instructions are data accesses Miss penalty is 25 clock cycles Miss rate is 2% How faster would the computer be if all instructions were cache hits? Answer: first compute the performance for always hithits: CPUexecution time =(CPU clock cycles+memory stall cycles)cycles) ××clock cycleclock cycle =(IC ×CPI+0) ×Clock cycle =IC=IC ××11.00 ××clock cyc

文档评论(0)

today-is-pqsczlx + 关注
实名认证
文档贡献者

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

1亿VIP精品文档

相关文档