← Indietro
EsameEsame completoTesto d’esame

11 02 2025 E T Silvano

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

Surname (COGNOME) Name POLIMI Personal Code Signature Politecnico di Milano, 11 February, 2025 Course on Advanced Computer Architectures Prof. C. Silvano EX1 ( 5 points) EX2 ( 3 points) EX3 ( 2 points) EX4 ( 5 points) Q1 ( 5 points) Q2 ( 5 points) QUIZZES ( 8 points) TOTAL (33 points) Course on Advanced Computer Architectures – prof. C. Silvano EXAM 11 Feb. 2025 – Please write in CAPITAL LETTERS AND BLACK/BLUE COLORS!!! Page 1 EXERCISE 1 – DEPENDENCY ANALYSIS + TOMASULO (5 points) 1. Let’s consider the following assembly code containing multiple types of intra-loop dependences. Complete the following table by inserting all types of true-data-dependences, anti-dependences and output dependences for each instruction: I# TYPE OF INSTRUCTION ANALYSIS OF DEPENDECES: 1. True data dependence with I# for $Fx 2. Anti-dependence with I# for $Fy 3. Output-dependence with I# for $Fz I0 LOOP: LD $F0, A($R0) None I1 LD $F2, B($R0) None I2 FADD $F4, $F0, $F2 I3 FADD $F6, $F4, $F4 I4 SD $F4, C($R0) I5 SD $F6, D($R0) I6 ADDI $R0, $R0, 4 I7 BNE $R0, $R1, LOOP 2. Let’s consider the previous assembly code to be executed on a CPU with dynamic scheduling based on TOMASULO algorithm with all cache HITS, a single Common Data Bus and: • 2 RESERV. STATIONS (RS1, RS2) with 2 LOAD/STORE units (LDU1, LDU2) with latency 6 • 2 RESERVATION STATION (RS3, RS4) with 2 FP unit12 (FPU1, FPU2) with latency 2 • 1 RESERVATION STATION (RS5) with 1 INT_ALU/BR unit (ALU1) with latency 1 Please complete the following table: LOOP: LD $F0, A($R0) 1 2 8 None RS1 LDU1 LD $F2, B($R0) 2 3 9 None RS2 LDU2 FADD $F4, $F0, $F2 FADD $F6, $F4, $F4 SD $F4, C($R0) SD $F6, D($R0) ADDI $R0, $R0, 4 BNE $R0, $R1, LOOP Calculate the CPI =_____________________________________ Course on Advanced Computer Architectures – prof. C.…

Anteprima

Prima pagina del documento.

Prima pagina: 11 02 2025 E T Silvano