Back
ExamFull examExam paper only

21 02 14

Full exam for Advanced Computer Architectures in the Computer Engineering degree programme at Politecnico di Milano. The document covers: Corso Architetture Avanzate dei Calcolatori Cognome (Surname) SOLUTION Nome (Name) POLIMICodice Persona (POLIMIPersonal Code) Firma (Signature) Politecnico di Milano, Feb. 21st, 2014 Prof. C. Silvano EX 1A ( 2.5 points) EX 1B ( 2.5 points) EX 2 ( 5 points) EX 3 ( 5 points) Q 3 (

Advanced Computer ArchitecturesFull exam

Document information

What's included in this study material

Full exam for Advanced Computer Architectures in the Computer Engineering degree programme at Politecnico di Milano. The document covers: Corso Architetture Avanzate dei Calcolatori Cognome (Surname) SOLUTION Nome (Name) POLIMICodice Persona (POLIMIPersonal Code) Firma (Signature) Politecnico di Milano, Feb. 21st, 2014 Prof. C. Silvano EX 1A ( 2.5 points) EX 1B ( 2.5 points) EX 2 ( 5 points) EX 3 ( 5 points) Q 3 (

Import quality: text was extracted directly from the original document.

Extracted content from the document

Representative passages recognised in different parts of the material. The full extracted text remains available to search, while this compact preview makes the page easier to read.

Page 1

Corso Architetture Avanzate dei Calcolatori Cognome (Surname) SOLUTION Nome (Name) POLIMICodice Persona (POLIMIPersonal Code) Firma (Signature) Politecnico di Milano, Feb. 21st, 2014 Prof. C. Silvano EX 1A ( 2.5 points) EX 1B ( 2.5 points) EX 2 ( 5 points) EX 3 ( 5 points) Q 3 ( 5 points) Q 4 ( 5 points) Q 5 ( 5 points) Q 6 ( 3 points) TOTAL (33 points) (33 points) Course on: Architetture Avanzate dei Calcolatori– Prof. C Silvano EXAM 21/02/2014 – Please write in CAPITAL LETTERS AND BLACK/BLUE COLORS!!! (MAIUSCOLO e COLORE NERO/BLU!!!) Page 1 - SOLUTION EXERCISE 1A – PIPELINE BASIC (2.5 points) Given the following loop expressed in a high level language: for (i =0; i < N; i ++)  vectA[i] = vectB[i] vectD[i] = vectC[i];  The program has been compiled in MIPS assembly code assuming that registers $t6 and $t7 have been initialized with values 0 and 4N respectively. The symbols VECTA and VECTB are 16-bit constant. The processor clock frequency is 2 GHz. Let us consider the loop executed by 5-stage pipelined MIPS processor WITHOUT any optimization in the pipeline (PLEASE consider the inter-iteration dependency on $t6) 1. Identify the RAW (Read After Write) Hazards in the pipeline scheme and identify the Hazard Type (Data Hazard or Control Hazard) in the last column 2. Identify in the first column the number of stalls to be inserted before each instruction (or between the stage IF and ID of each instruction) necessary to solve the hazards Num. Stalls INSTRUCTION C1 C2 C3 C4 C5 C6 C7 C8 C9 C10 C11 Hazard Type 3 FOR:beq $t6,$t7,END IF ID EX ME WB CNTR + RAW $t6 * 3 lw $t2,VECTB($t6) IF ID EX ME WB CNTR 3 sw $t2,VECTA($t6) IF ID EX ME WB RAW $t2 lw $t2,VECTC($t6) IF ID EX ME WB 3 sw $t2,VECTD($t6) IF ID EX ME WB RAW $t2 addi $t6,$t6,4 IF ID EX ME WB j FOR IF ID EX ME WB * RAW…

Preview

First page of the document.

First page: 21 02 14