Show how a 2K cache should be organized to handle a 64K memory using 16 words/block...

Question

Question

Show how a 2K cache should be organized to handle a 64K memory using 16 words/block...

Show how a 2K cache should be organized to handle a 64K memory using 16 words/block memory.

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

Solution: The organization of a 2K cache is shown below: . The cache size is 211 The memory size is 216 . The number of words

Add a comment

Answer 2

Similar Homework Help Questions

Suppose a computer using set associative cache has 216 words of main memory and a cache...

Suppose a computer using set associative cache has 216 words of main memory and a cache of 32 blocks, and each cache block contains 8 words. 3. If this cache is 2-way set associative, what is the format of a memory address as seen by the cache, that is, what are the sizes of the tag, set, and word fields? If this cache is 4-way set associative, what is the format of a memory address as seen by the cache?...
Suppose that a main memory has 8192 blocks each block having 32 words. Show the memory...

Suppose that a main memory has 8192 blocks each block having 32 words. Show the memory address format (see figures 4.10 and 4.12 of your textbook for examples) for each of the cache organizations below. a. a direct map cache with 64 lines of 32 words each b. a set associative cache with 16 sets each with four lines of 32 words each c. a fully associate cache with 128 lines of 32 words each PLEASE EXPLAIN IN DETAIL
1. 2-way Set Associative Cache Memory Consider a hypothetical machine with 1K words of cache memo...

1. 2-way Set Associative Cache Memory Consider a hypothetical machine with 1K words of cache memory. They are in two-way set associative organization, with cache block size of 128 words, using LRU replacement algorithm. Suppose the cache hit time is 9ns, the time to transfer the first word from main memory to cache is 50ns, while subsequent words require 10ns/word. Consider the following read pattern (in blocks of 128 words, and block id starts from 0): 1 2 3 5...

Name #5 Suppose a compute memory and a cache of 1024 blocks, where each cache block...

Name #5 Suppose a compute memory and a cache of 1024 blocks, where each cache block contains a) How many blocks of main memory are there? b) Wha r using direct mapped cache has 4bytes of byte-addressable main t is the format of a memory address as seen by the cache; that is, what are the sizes of the tag, block, and offset fields? To which cache block will the memory address 0x000063FA map? c)
question 2 and 3 2. Determine how many sets of cache blocks will be there for...

question 2 and 3 2. Determine how many sets of cache blocks will be there for the following Cache memory size (in bytes) Direct Mapped Blocks Size (in bits) 32 64 218 2-way Set Associative Block Size (in bits) 32 64 A 2A6 [0.5 * 16 = 8] 4-way Set Associative Block Size (in bits) 32 64 SK 64K 256K 3. The physical memory address generated by a CPU is converted into cache memory addressing scheme using the following mapping...
6. A 2-way set associative cache consists of four sets. Main memory contains 2K blocks of...

6. A 2-way set associative cache consists of four sets. Main memory contains 2K blocks of eight words each. a. Show the main memory address format that allows us to map addresses from main memory to cache. Be sure to include the fields as well as their sizes. b. Compute the hit ratio for a program that loops 5 times from locations 8 to 51 in main memory. You may leave the hit ratio in terms of a fraction.

Consider a memory hierarchy using one of the three organization for main memory shown in a...

Consider a memory hierarchy using one of the three organization for main memory shown in a figure below. Assume that the cache block size is 32 words, That the width of organization b is 4 words, and that the number of banks in organization c is 2. If the main memory latency for a new access is 10 cycles, sending address time is 1 cycle and the transfer time is 1 cycle, What are the miss penalties for each of...
Consider a hypothetical machine with 1K words of cache memory. They are iin direct-mapped organiz...

Consider a hypothetical machine with 1K words of cache memory. They are iin direct-mapped organization, with cache block size of 128 words, using LRU replacement algorithm. Suppose the cache hit time is 8ns, the time to transfer the first word from main memory to cache is 50ns, while subsequent words require 10ns/word. Consider the following read pattern (in blocks of 128 words, and block id starts from 0): 1 2 3 5 6 2 3 4 9 10 11 6...
32 bytes of memory. 16 bytes of 2-way set-associative cache, where blocks can go anywhere within...

32 bytes of memory. 16 bytes of 2-way set-associative cache, where blocks can go anywhere within the set. Block is 2 bytes, set in cache is two blocks. Populate memory starting with upper-case letters, then 0-5. Hint- with full associativity in the set: each block has its own set of Tag bits in the cache. Memory is not organized by sets, though blocks get assigned to sets, and load in the cache per set. 1) Break down the addressing: Tag...

Consider a cache of 8 lines of 16 bytes each. Main memory is divided into blocks...

Consider a cache of 8 lines of 16 bytes each. Main memory is divided into blocks of 16 bytes each. That is, block 0 has bytes with addresses 0 through 15, and so on. Now consider a program that accesses memory in the following sequence of addresses: Loop three times: 10 through 20; 32 through 52. Once: 20 through 35. Suppose the cache is organized as direct mapped. Memory blocks 0, 8, 16 and so on are assigned to line...

Show how a 2K cache should be organized to handle a 64K memory using 16 words/block...

Homework Answers

Add Answer to:
Show how a 2K cache should be organized to handle a 64K memory using 16 words/block...

Post as a guest

Earn Coins

Suppose a computer using set associative cache has 216 words of main memory and a cache...

Suppose that a main memory has 8192 blocks each block having 32 words. Show the memory...

1. 2-way Set Associative Cache Memory Consider a hypothetical machine with 1K words of cache memo...

Name #5 Suppose a compute memory and a cache of 1024 blocks, where each cache block...

question 2 and 3 2. Determine how many sets of cache blocks will be there for...

6. A 2-way set associative cache consists of four sets. Main memory contains 2K blocks of...

Consider a memory hierarchy using one of the three organization for main memory shown in a...

Consider a hypothetical machine with 1K words of cache memory. They are iin direct-mapped organiz...

32 bytes of memory. 16 bytes of 2-way set-associative cache, where blocks can go anywhere within...

Consider a cache of 8 lines of 16 bytes each. Main memory is divided into blocks...

Show how a 2K cache should be organized to handle a 64K memory using 16 words/block...

Homework Answers

Add Answer to: Show how a 2K cache should be organized to handle a 64K memory using 16 words/block...

Post as a guest

Earn Coins

Add Answer to:
Show how a 2K cache should be organized to handle a 64K memory using 16 words/block...