阿摩線上測驗 登入

申論題資訊

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

申論題內容

5. Increasing associativity requires more comparators, as well as more tag bits per cache block. Assuming a cache of 4K blocks, a four-word block size, and a 32-bit address, find the total number of sets and the total number of tag bits for caches that are direct mapped, two-way and four-way set associative, and fully associative. Please copy Table 5 to your answer sheet and fill in your answers. 61e7cf7dda293.jpg