阿摩線上測驗 登入

申論題資訊

試卷:101年 - 101 國立中山大學_碩士班招生考試_資工系(甲、乙組):計算機結構#105905
科目:中山◆資工◆計算機結構
年份:101年
排序:0

申論題內容

6. There are three small caches, each consisting of four one-word blocks. The first cache is direct mapped, the second cache is two-way set associative, and the third cache is fully associative. Find the numbers of misses for each organization given the following sequence of block addresses: 8. 0. 8. 6, 0. Copy Table 6 to your answer sheet and fill in the answers. Assume that the least recently used replacement policy is used for the fully associative cache and the set-associative cache.
61ea16637f0be.jpg