Question

2. Bubble sort algorithm is used for sorting N integers, where N is 1024. Cache at L1 level is 2 way associative, with block size of 16 bytes and total size of 1024 bytes. Given an integer requires 4 bytes, show the cache hit and miss pattern for array accesses. 3 For the question 2, find the total number of hits and misses at L1 cache level.

          2. Bubble sort algorithm is used for sorting N integers, where N is 1024. Cache at L1 level is 2
way associative, with block size of 16 bytes and total size of 1024 bytes. Given an integer
requires 4 bytes, show the cache hit and miss pattern for array accesses.
3 For the question 2, find the total number of hits and misses at L1 cache level.

2. Bubble sort algorithm is used for sorting N integers, where N is 1024. Cache at L1 level is 2
way associative, with block size of 16 bytes and total size of 1024 bytes. Given an integer
requires 4 bytes, show the cache hit and miss pattern for array accesses.
3 For the question 2, find the total number of hits and misses at L1 cache level.

Added by Eddie F.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Madhur L

10/11/2023

Step 1

- The block size is 16 bytes, which can hold 4 integers (since each integer requires 4 bytes). - The total size of the L1 cache is 1024 bytes, which means it can hold 64 cache blocks (1024 / 16). - Since it's 2-way associative, there are 32 sets (64 / 2). Show more…

Show all steps

Thanks for your feedback!

Bubble sort algorithm is used for sorting N integers, where N is 1024 . Cache at L1 level is 2 way associative, with block size of 16 bytes and total size of 1024 bytes. Given an integer requires 4 bytes, show the cache hit and miss pattern for array accesses. 3 For the question 2, find the total number of hits and misses at L1 cache level. 2. Bubble sort algorithm is used for sorting N integers, where N is 1024. Cache at L1 level is 2 way associative, with block size of 16 bytes and total size of 1024 bytes. Given an integer requires 4 bytes, show the cache hit and miss pattern for array accesses. 3 For the question 2, find the total number of hits and misses at L1 cache level.