← Indietro
EsameEsame completoTesto d’esame

03 02 15

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 Email Address Signature (Firma) Politecnico di Milano, February 3rd, 2015 Prof. C. Silvano EX1A ( 2.5points) EX1B ( 2.5points) EX1C ( 2.5points) EX2A ( 5 points) EX2B ( 2.5 points) Q3 ( 5 points) Q4 ( 5 points) Q5 ( 5 points) Q6 ( 3 points) TOTAL (33 points) (33 points) Course on: Advanced Computer Architectures – Prof. C Silvano EXAM 03/02/2015 – Please write in CAPITAL LETTERS AND BLACK/BLUE COLORS!!! (MAIUSCOLO e COLORE NERO/BLU!!!) EXERCISE 1A – PIPELINE BASIC (2.5 points) Given the following loop expressed in a high level language: do {if ( vectA[i] >= 0 ) { vectB[i] = vectA[i] + K1; } else { vectB[i] = K2; } i++; } while (i != N) 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, VECTB and VECTC 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 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 hazard Page 1 - SOLUTION Course on: Advanced Computer Architectures – Prof. C Silvano EXAM 03/02/2015 – Please write in CAPITAL LETTERS AND BLACK/BLUE COLORS!!! (MAIUSCOLO e COLORE NERO/BLU!!!) Num. Stalls THEN Num. Stalls ELSE Instruction C1 C2 C3 C4 C5 C6 C7 C8 C9 C10 C11 C12 C13 C14 Hazard Type THEN Hazard Type ELSE 3 3 DO:…

Anteprima

Prima pagina del documento.

Prima pagina: 03 02 15