목록hamming_code (1)
수정입니다
Memory Hierarchy(3) - Cache_2, Hamming code
Associative Caches Fully associative --> allow a given block to go in any cache entry --> more flexible, reduce miss rate!!! --> requires all entries to be serached at once --> comparator per entry => expensive! M-way set associative (Fully 와 Direct map의 중간 지점) --> Each set contains M entries --> block number determines which set (block number) % (number of sets in cache) --> serch all entries..
전공/컴퓨터구조
2023. 12. 28. 12:39