计算机组成原理期末要点.docxVIP

下载本文档

6
0
约7.03千字
约 19页
2020-06-29 发布于北京
举报
版权申诉

计算机组成原理期末要点.docx

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

CH4 1、hierarchy of memory (1)register - cache - main memory - external memory (2)从上到下性质的变化 increasing capacity increasing access time decreasing cost decreasing access frequency (3)层级之间数据交互的单位 register-cache: word cache-main memory: block (4)Dilemma faster access time, greater cost per bit greater capacity, smaller cost per bit greater capacity, slower access time 2、access method (1)sequential ①key word: beginning, read in order ②access time: depends on location of data and previous location (2)direct ①key word: block, jump+sequential ②access time: depends on location of data and previous location (3)random ①key word: exactly ②access time: independent of location or previous access (4)associative ①key word: comparison ②access time: independent of location or previous access 3、access time in two level memory T H: hit ratio in level 1 T1: access time in level 1 T2: access time in level 2 4、locality of reference (1)CH-P101/EN-P129 (2) 5、cache mapping (1)direct ①process CH-P84/EN-P107 ②computation number of addressable units = 2s+w words block size = line size = 2w number of blocks = 2 number of lines in cache = 2 index of line = (index of block) mod (number of lines) 行号既可以用上面的式子算，也可以用块号中对应的r位 (2)associative ①process CH-P88/EN-P111 ②computation number of addressable units = 2s+w words block size = line size = 2w number of blocks = 2 index of line = undetermined/random (3)set associative ①process CH-P89/EN-P114 ②computation k-way number of addressable units = 2s+w block size = line size = 2w words number of blocks = number of lines in set = k number of sets = 2 number of lines in cache = k? index of line = undetermined/random index of set = (index of block) mod (number of sets) (4)一个等式 k? 当k=1时，set associative就是direct 当d=0时，set associative就是associative (5)如果题目没有明说，则word看作byte CH10 1、number of addresses in structions (1)3 addresses opcode result operand source operand1 source operand2 result - source1 operation source2 (2) 2 addresses opcode result operand source op