Quiz 1 2016

pdf

School

University of Ottawa *

*We aren’t endorsed by this school

Course

4136

Subject

Computer Science

Date

Dec 6, 2023

Type

pdf

Pages

4

Uploaded by jake_998

Report
Page 1 of 4 CEG 4136 Computer Architecture III: Quiz #1 Date: September 30th Professor: Dr. M. Bolic Duration: 45 min Session: Fall 2016 Total Points = 8 Note: Closed book exam. Calculators are not allowed. Name: _______________________Student ID:_______________ QUESTION 1 (0.5 points each, total 2.5 points) 1. a. Is OpenMP language or Application Programming Interface (API)? b. If it is API, what languages is it specified for? c. Is it for shared memory or for message passing systems? 2. We need to apply mutual exclusion when:
Page 2 of 4 a. Two processes read from the same memory location b. Two processes write to the same memory location c. For both a. and b. 3. List advantages and disadvantages of private vs. shared L2 cache in manycore shared memory systems. 4. What is SPMD and what is the difference between SPMD and SIMD? 5. Describe the advantages of non-blocking caches? Describe how you would implement the non- blocking cache. QUESTION 2 (2.5 points)
Page 3 of 4 QUESTION 3 (3 points)
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help
Page 4 of 4 Let us consider a system with 3 processor nodes and a central shared memory. The coherence protocol is centralized directory (it is not a snooping protocol). All processor read variable x that is originally 500 , subtract 100 from it and write back into x. Each processor has a write-back cache and it is running MSI protocol. The main memory is running full directory protocol. State transition diagram of MSI protocol is shown in the figure below. Fill the table below: P0 instr P1 instr P2 Instr Cache 0 status Cache 0 Data Cache 1 status Cache 1 Data Cache 2 status Cache 1 Data Memory data Directory Presence bits Directory Dirty bit I - I - I - x=500 0 0 0 0 Read x x=x- 100 Read x Read x x=x- 100 x=x- 100