Fall99-prerequisite quiz

# Computer Architecture: A Quantitative Approach, 4th Edition

• Homework Help
• davidvictor
• 9

This preview shows pages 1–4. Sign up to view the full content.

1 University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Prerequisite Quiz SOLUTIONS September 1, 1999 CS252 Computer Architecture and Engineering This prerequisite quiz will be used in determining class admissions. Good Luck! Your Name: SID Number: Discussion Section: 1 2 3 Total P

This preview has intentionally blurred sections. Sign up to view the full version.

2 1) Assume that we have a 32-bit processor with 32-bit words, and that this processor is byte-addressed (i.e. addresses specify bytes). Now, suppose that this processor has a 32-word, two-way, set- associative cache (LRU replacement) with 2-word cache lines. a) Split the 32-bit address into “tag”, “index”, and “cache-line offset” pieces. We start you off with one of these. tag: 31 - 6 index: 5 - 3 cache-line offset: bits 2 - 0 b) Assume that the processor makes the following byte accesses. Label each reference address as a Hit (H) or a Miss (M). Also, identify each cache miss as a compulsory, conflict, or capacity miss. Blank working space is available on the next page. Byte Address Hit/Miss? Miss Type 6 (0x006) M Compulsory 76(0x04C) M Compulsory 43(0x02B) M Compulsory 122(0x07A) M Compulsory 168(0x0A8) M Compulsory 207(0x0CF) M Compulsory 46(0x02E) H 72(0x048) H 238(0x0EE) M Compulsory 75(0x04B) H 172(0x0AC) M Conflict 40(0x028) M Conflict 203(0x0CB) H 170(0x0AA) H c) Calculate the cache hit rate (you can leave as a fraction). (hits) / (total accesses) = 5 / 14
3 [ This page left as scratch for problem #1] All misses are compulsory if the cache has never seen that line before. Misses are capacity misses if a fully associative cache of the same size would experience the same miss (because increasing the size would solve the problem). Otherwise, it is a conflict miss (because increasing the associativity would solve the problem). 0

This preview has intentionally blurred sections. Sign up to view the full version.

This is the end of the preview. Sign up to access the rest of the document.
• Spring '07
• Kubiatowicz
• Computer Architecture, SEPTA Regional Rail, Central processing unit, CPU cache, Cache algorithms, Compulsory Compulsory Compulsory Compulsory Compulsory

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern