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

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