- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
计算机体系结构chapter04
The University of Adelaide, School of Computer Science * Chapter 2 — Instructions: Language of the Computer * The University of Adelaide, School of Computer Science * Chapter 2 — Instructions: Language of the Computer * The University of Adelaide, School of Computer Science * Chapter 2 — Instructions: Language of the Computer * * The University of Adelaide, School of Computer Science * Chapter 2 — Instructions: Language of the Computer * CS252 S05 * The University of Adelaide, School of Computer Science * Chapter 2 — Instructions: Language of the Computer * The University of Adelaide, School of Computer Science * Chapter 2 — Instructions: Language of the Computer * The University of Adelaide, School of Computer Science * Chapter 2 — Instructions: Language of the Computer * The University of Adelaide, School of Computer Science * Chapter 2 — Instructions: Language of the Computer * The University of Adelaide, School of Computer Science * Chapter 2 — Instructions: Language of the Computer * Without interleaving, the frequency of our access will be limited by the DRAM cycle time. With interleaving, that is having multiple banks of memory, we can access the memory much more frequently by accessing another bank while the last bank is finishing up its cycle. For example, first we will access memory bank 0. Once we get the data from Bank 0, we will access Bank 1 while Bank 0 is still finishing up the rest of its DRAM cycle. Ideally, with interleaving, how quickly we can perform memory access will be limited by the memory access time only. Memory interleaving is one common techniques to improve memory performance. + 1 = 68 min. (Y:48) * 性能基本上随着总线宽度和交叉技术的应用程比例增长。 这是一个相对简单直观的例子。 * 计算机体系结构 * 页面大小的选择 页面选择较大的优点 减少了页表的大小 如果局部性较好,可以提高命中率 页面选择较大的缺点 内存中的碎片较多,内存利用率低 进程启动时间长 失效开销加大 * 计算机体系结构 * Alpha VPN-PPN * 计算机体系结构 * TLB (Translation look-aside Buffer) 页表一般很大,存放在主存中。 导致每次访存可能要两次访问主存,一次读取页表项,一次读写数据 解决办法:采用 TLB TLB 存放近期经常使用的页表项,是整个页表的部分内容的副本。 基本信息: VPN##PPN##Protection Field##
文档评论(0)