← Indietro
EsameEsame completoTesto d’esame

27 06 16 2

Esame completo di Advanced Computer Architectures per il corso di Computer Engineering presso Politecnico di Milano. Materiale proveniente dall’archivio storico Studwiz e classificato per la consultazione online.

Advanced Computer ArchitecturesEsame completo

Informazioni sul documento

Cosa trovi in questo materiale

Esame completo di Advanced Computer Architectures per il corso di Computer Engineering presso Politecnico di Milano. Materiale proveniente dall’archivio storico Studwiz e classificato per la consultazione online.

Qualità dell’importazione: il testo è stato estratto direttamente dal documento originale.

Contenuti estratti dal documento

Passaggi rappresentativi riconosciuti nelle diverse parti del materiale. Il testo completo resta presente nella pagina per la ricerca, mentre l’anteprima compatta rende più semplice la lettura.

Pagina 1

Course on Advanced Computer Architectures Surname (Cognome) SOLUTION Name (Nome) POLIMI ID Number Signature (Firma) Politecnico di Milano, June 27th, 2016 Prof. C. Silvano EX1A ( 2 points) EX1B ( 2 points) EX1C ( 2 points) EX2 ( 5 points) EX3 ( 5 points) Subtotal ( 16 points) Q4 ( 5 points) Q5 ( 6 points) Q6 ( 5 points) TOTAL (32 points) Advanced Computer Architectures – Prof. C Silvano EXAM 27/06/2016 – Please write in CAPITAL LETTERS AND BLACK/BLUE COLORS!!! Page 2 - SOLUTION EXERCISE 1A – PIPELINE BASIC (2 points) Given the following loop expressed in a high-level language: for (k = 0, j = 1, i = 2; i < N; i++, j++, k++) ^ vectA[i] = vectA[j] + vectB[k]; vectB[i] = vectA[k] * 2; ` The program has been compiled in MIPS assembly code assuming that registers $t5, $t6, $t7, and $t8 have been initialized with values 0, 4, 8 and 4N respectively. The symbols vectA, vectB, are 16-bit constant. The processor clock frequency is 1.2 GHz. Let us consider the loop executed by 5-stage pipelined MIPS processor WITHOUT any optimization in the pipeline (PLEASE don’t consider any inter-iteration dependencies) 1. Identify the RAW (Read After Write) Hazards in the pipeline scheme and identify the Hazard Type (Data 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 IF and ID stage of each instruction) to solve the hazards blt $t7, $t8, FOR # branch on less than, sll $t2, $t3, 2 # shift left logical: $t2 = $t3 << 2 x Asymptotic CPI (N cycles) : CPI AS= (IC + # stalls) / IC = (11+16) /11 = 2.45 _____________________ Num. Stalls INSTRUCTION C1 C2 C3 C4 C5 C6 C7 C8 C9 C10 C11 C12 C13 C14 C15 Hazard Type 3 FOR: lw $t2,VECTA($t6) IF ID EX ME WB C N T R lw $t3,VECTB($t5) I F I D EX ME WB 3 a d d $ t…

Anteprima

Prima pagina del documento.

Prima pagina: 27 06 16 2