How many total bits are required for a direct-mapped cache with 2^12 blocks (12-bit index), two-word in each block, assuming 64-bit address?
Added by Johnathan M.
Step 1
Since each block contains two words, and each word is 64 bits, the size of each block is 2 x 64 = 128 bits. Show more…
Show all steps
Your feedback will help us improve your experience
Deepak Kumar and 77 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Assume: A processor has a direct-mapped cache. Data words are 8 bits long, i.e. 1 byte. Data addresses refer to the word. A physical address is 20 bits long. The tag is 11 bits. Each block holds 16 bytes of data. How many blocks are in this cache?
Supreeta N.
For a direct-mapped cache design with a 32-bit address, the following bits of the address are used to access the cache: Tag (31-12), Index (11-6), Offset (5-0). a. What is the cache block size in words? b. How many entries does this cache have? c. What is the ratio between the total bits required for such a cache implementation and the data storage bits?
Sri K.
Given a 4-way set associative cache with 64 sets (S). Each cache block contains 32 bytes of data (B). Provide answers to each of the following questions. How many bits (b) will be needed for block offset (B)? b = bits. How many bits (s) will be needed for sets (S)? s = bits. What is the size of this cache? size = bytes.
Akash M.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD