Fall1998-quiz2 - University of California Berkeley College...

Info icon This preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
University of California, Berkeley College of Engineering Computer Science Division — EECS Fall 1998 J. D. Kubiatowicz Quiz 2 November 20, 1998 CS252 Graduate Computer Architecture You are allowed to use a calculator and one 8.5” x 11” double-sided page of notes. Show your work on all problems. If you find a problem unclear or underspecified, please ask for clarification of the assumptions. If you make assumptions not listed in the problem, please state them clearly in your solutions. Good luck! Your name: SID number: Email address: 1 /30 2 /35 3 /35 Total /100
Image of page 1

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

View Full Document Right Arrow Icon
2 Question 1: Being Consistent a) List the three conditions sufficient for sequential consistency that were presented in class. Hint: one of these dictates the way in which processors can make requests; the other two deal with write atomicity) b) Draw a diagram illustrating the conditions of write atomicity for two processors ( hint: this dia- gram appeared several times in class )
Image of page 2
3 Question 1 (continued) c) Describe how the two conditions for write atomicity are satisfied in the following three cases: 1) a snoopy-cache protocol on an atomic bus 2) a snoopy-cache protocol on a split-transaction bus 3) a directory-based protocol in a distributed-memory multiprocessor
Image of page 3

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

View Full Document Right Arrow Icon
4 Question 1 (continued) d) Describe how your answer to subpart 3 of part c (the directory-based MP) can lead to livelock in large systems e) How might you modify the cache controller and/or the directory controller to fix this livelock problem? Give complete architectural details, if possible f) EXTRA CREDIT (5 points max): describe how to exploit the hardware features of a modern out-of-order processor without violating sequential consistency
Image of page 4
5 Question 2: Caches and Busses For this problem, assume that we are dealing with a bus-based shared memory multiprocessor (SMP) using the MESI protocol.
Image of page 5

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

View Full Document Right Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    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.

    Student Picture

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

  • Left Quote Icon

    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.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    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.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern