Question

3. Media applications that play audio or video files are part of a class of workloads called streaming workloads; i.e., the
0 0
Add a comment Improve this question Transcribed image text
Answer #1

miss rate = no, of misses total no of Taccesses Cache block size = 64 byle In 256 kB direct mapped cache, there exists 26 misMiss rate : 12 SoOok x100 2x109 Miss rate = 6.25.1. cache block size 32 bytes misses = 1662500k misses Miss rate = 62500k x10

Add a comment
Know the answer?
Add Answer to:
3. Media applications that play audio or video files are part of a class of workloads...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 7.3 What is the memory layout of the 16-bit value, 0x7654 in a big-endian 16-bit machine,...

    7.3 What is the memory layout of the 16-bit value, 0x7654 in a big-endian 16-bit machine, and a little-endian 16-bit machine? b. What would the layouts be in 32-bit machines? 7.19 A certain two-way set-associative cache has an access time of 4 ns, compared to a miss time of 60 ns. Without the cache, main memory access time was 50 ns. Running a set of bench-marks with and without the cache indicated a speedup of 90%. What is the approximate...

  • 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...

  • Cache question computer architecture A cache holds 128 words where each word is 4 bytes. Assuming...

    Cache question computer architecture A cache holds 128 words where each word is 4 bytes. Assuming a 32-bit address, for each of the following organizations, complete the table. a.A direct-mapped cache with block size = 16words b.2-way set-associative cache with block size = 8words c.4-way set-associative cache with block size = 4words d.A fully associative cache with block size = 2words. Cache a Cache b Cache c Cache d total # bits for word & byte displacement # bits in...

  • Using the sequences of 32-bit memory read references, given as word addresses in the following table:...

    Using the sequences of 32-bit memory read references, given as word addresses in the following table: 6 214 175 214 6 84 65 174 64 105 85 215 For each of these read accesses, identify the binary address, the tag, the index, and whether it experiences a hit or a miss, for each of the following cache configurations. Assume the cache is initially empty. A direct-mapped cache with 16 one-word blocks. A direct-mapped cache with two-word blocks and a total...

  • 1. A cache holds 64 words where each word is 4 bytes. Assume a 32 bit...

    1. A cache holds 64 words where each word is 4 bytes. Assume a 32 bit address. There are four different caches a. A direct-mapped cache with block size = 16 words b. 2-way set-associative cache with block size = 8 words c. 4-way set-associative cache with block size=4 words d. A fully associative cache with block size = 16 words. Complete the table for each cache. Cache a Cache be Cache Cache de 16 Number of bits needed for...

  • Question 3: Consider a 32-bit physical address memory system with block size 16 bytes and a...

    Question 3: Consider a 32-bit physical address memory system with block size 16 bytes and a 32 blocks direct mapped cache. The cache is initially empty. The following decimal memory addresses are referenced 1020, 1006, 1022, 5106, 994, and 2019 Map the addresses to cache blocks and indicate whether hit or miss. Note: You must use the hexadecimal approach in solving this question. You must also show the computations of dividing the memory address into tag bits, cache index bits,...

  • 3. 12+2-4 points] We are comparing the two caches in Problem 1 and Problem 2. Suppose both caphes have a hit time of 2 cycles. The cache in Problem 1 has a miss penalty of 15 cycles. The o...

    3. 12+2-4 points] We are comparing the two caches in Problem 1 and Problem 2. Suppose both caphes have a hit time of 2 cycles. The cache in Problem 1 has a miss penalty of 15 cycles. The one in Problem 2 has a miss penalty of 25 cycles. Calculate the total time taken (in cycles) for all accesses, for each cache. Which cache is better- the one in Problem 1 or Problem 2? 3. 12+2-4 points] We are comparing...

  • 3. (6 pts) Consider a new processor. The memory system is 32-bit byte- addressable. The on-chip...

    3. (6 pts) Consider a new processor. The memory system is 32-bit byte- addressable. The on-chip cache memory is 128 KByte 4-way set-associative, with a 64 byte block size. (a) Draw a diagram showing how the cache controller will split the memory address: for each field. show its name and number of bits. (b) The design team decided to change the cache architecture to a direct mapped one. For each of the parameters in the following table, indicate the impact...

  • 1a. convert the following decimal number to 32 bit single precision Floating point binary number and...

    1a. convert the following decimal number to 32 bit single precision Floating point binary number and convert that binary number to hexadecimal NUMBER = -134.5 in decimal b. convert the following 32-bit single precision floating point number to decimal: 01000111111100000000000000000000 2. Using Booth's algorithm, multiply the decimal numbers -12 and +13. 3. you have two improvement alternatives, which is better and why? The first one improves 15% of the instructions, and it improves that speed by a factor of 6....

  • A short program loop goes through a 16 kB array one word at a time, reads...

    A short program loop goes through a 16 kB array one word at a time, reads a number from the array, adds a random number, and stores the result in the corresponding entry in another array that is located in the memory immediately following the first array. An outer loop repeats the above operation 100 times. The 64-bit processor, operating at a clock frequency of 4 GHz, is pipelined, has 48 address lines, three levels of caches with a 64...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT