第五章概念(国外英文资料).docVIP

第五章概念 The fifth chapter is storage hierarchy What are the major differences between 1. single stage memories? What is the usual way to solve this problem? The main contradiction: (1) the faster the rate, the higher the price. (2) the greater the capacity, the lower the price. (3) the greater the capacity, the slower the speed. Multilevel storage hierarchy method is adopted to solve the problem. 2. what are the main parameters that evaluate the storage hierarchy? Average price per shot, hit rate or failure rate, average access time. What is the main difference between the 3. Cache- memory and memory - secondary level? Storage hierarchy The project Cache- memory level memory - secondary level In order to make up for the lack of main memory speed, in order to make up for the lack of main memory capacity The implementation of storage management is realized by special hardware, which is mainly realized by software Access speed ratio (Level 1 is better than level second) A typical block (page) size of tens of bytes, hundreds to thousands of bytes CPU access to level second can be accessed directly through the first level If CPU is switched when not hit, do not switch to other processes 4. what are the four issues that should be addressed in the storage hierarchy? (1) image rule: when you transfer a block to a higher layer of memory, where can you put it?. (2) lookup algorithm: when the block to be accessed is stored in a higher layer memory, how do we find the block?. (3) replacement algorithm: which piece should be replaced when failure occurs?. (4) write policy: what actions should be performed when writing access?. What are the 5. address mapping methods? What are their respective advantages and disadvantages? (1) fully associative mapping. The mechanism of searching is complex, costly and slow. The utilization ratio of Cache space is high, and the probability of block collision is low, so the failure rate of Cache is low. (2) direct mapping. The mechanism of searchin