We aren't endorsed by this school
##### CS 1541 - Intro To Computer Architecture - Pittsburgh Study Resources
• 24 Pages
###### Lect-datapath_2up

School: Pittsburgh

Course: INTRO TO COMPUTER ARCHITECTURE

CS/COE1541: Introduction to d Computer Architecture Datapath and Control Review Sangyeun Cho Dept. of Computer Science University of Pittsburgh Datapath elements Arithmetic logic unit (ALU) Combinational logic (=function) I i (carryin i hidden) i is hidd

• 2 Pages
###### H6_solutions

School: Pittsburgh

Course: INTRODUCTION TO COMPUTER ARCHITECTURE

CS: 1541 Homework 6 Solutions Question 1 (10 pt): Event P1 writes A=4 Write miss P3 writes B=8 Write miss P2 reads A Read miss P3 reads A Read miss P3 writes A=12 Write hit P2 reads A Read miss P1 reads B Read miss P1 writes B=10 Write hit P1s cache P2s c

• 4 Pages
###### H5_solutions

School: Pittsburgh

Course: INTRODUCTION TO COMPUTER ARCHITECTURE

CS: 1541 Homework 5 Solution Question 1: 32-bit virtual byte address, => page size = 8KB = 2K words =>there are (2^32)/(2^13) = 2^19 pages => physical memory = (2^27)/(2^13) = 2^14 pages Each page table entry has 8(Valid, Protection, Dirty and Use) + 14 (

• 5 Pages
###### H4_solutions

School: Pittsburgh

Course: INTRODUCTION TO COMPUTER ARCHITECTURE

Question 1: In this question, consider the following series of address references (given as word addresses): 21, 20, 33, 4, 21, 8, 20, 17, 34, 18, 60, 45, 33, 9, 21, 22, 44 For each of the following cache organizations, show the content of the cache after

• 6 Pages
###### H3_solutions

School: Pittsburgh

Course: INTRODUCTION TO COMPUTER ARCHITECTURE

CS 1541 Introduction to Computer Architecture Homework 3 Solutions Question 1: (2 points for each part = 10 points) (1) (2) (3) (4) (5) lw add sw add lw \$1, \$6, \$6, \$4, \$6, 40(\$6) \$2, \$2 50(\$1) \$5, \$6 10(\$4) a. Identify all the data dependencies in the co

• 6 Pages
###### H2_solutions

School: Pittsburgh

Course: INTRODUCTION TO COMPUTER ARCHITECTURE

CS 1541 Introduction to Computer Architecture Homework 2 Solutions Questions 1 (10 points = a-d 1.5 points each + e-f 1 point each + g 2 points) In this question, we examine how latencies of individual components of the processor datapath (see Figure 4.11

• 5 Pages
###### H1_solutions

School: Pittsburgh

Course: INTRODUCTION TO COMPUTER ARCHITECTURE

Homework 1 (due January 17, 2013) Question 1: (10 points - 4(a)+3(b)+3(c) Consider a MIPS program with the following mix of instructions 55% R-type arithmetic instructions 15% lw instructions 10% sw instructions 15% beq and bne instructions 5% Jump instru

• 4 Pages
###### Exam1_solutions

School: Pittsburgh

Course: INTRODUCTION TO COMPUTER ARCHITECTURE

Question 1 (5+5=10 points) (a) The maximum number of Format 1 instructions that can be supported by the ISA is _63_ and the maximum number of Format 2 instructions that can be supported by the ISA is _16_. (b) The maximum is determined by the range of the

• 5 Pages
###### H1_solutions

School: Pittsburgh

Course: INTRODUCTION TO COMPUTER ARCHITECTURE

Homework 1 (due January 17, 2013) Question 1: (10 points - 4(a)+3(b)+3(c) Consider a MIPS program with the following mix of instructions 55% R-type arithmetic instructions 15% lw instructions 10% sw instructions 15% beq and bne instructions 5% Jump instru

• 6 Pages
###### H2_solutions

School: Pittsburgh

Course: INTRODUCTION TO COMPUTER ARCHITECTURE

CS 1541 Introduction to Computer Architecture Homework 2 Solutions Questions 1 (10 points = a-d 1.5 points each + e-f 1 point each + g 2 points) In this question, we examine how latencies of individual components of the processor datapath (see Figure 4.11

• 6 Pages
###### H3_solutions

School: Pittsburgh

Course: INTRODUCTION TO COMPUTER ARCHITECTURE

CS 1541 Introduction to Computer Architecture Homework 3 Solutions Question 1: (2 points for each part = 10 points) (1) (2) (3) (4) (5) lw add sw add lw \$1, \$6, \$6, \$4, \$6, 40(\$6) \$2, \$2 50(\$1) \$5, \$6 10(\$4) a. Identify all the data dependencies in the co

• 5 Pages
###### H4_solutions

School: Pittsburgh

Course: INTRODUCTION TO COMPUTER ARCHITECTURE

Question 1: In this question, consider the following series of address references (given as word addresses): 21, 20, 33, 4, 21, 8, 20, 17, 34, 18, 60, 45, 33, 9, 21, 22, 44 For each of the following cache organizations, show the content of the cache after

• 1 Page
###### H7_solutions

School: Pittsburgh

Course: INTRODUCTION TO COMPUTER ARCHITECTURE

CS: 1541 Homework 7 Solution Question 2: Thread A =12 iterations (each with 5 instructions) Thread B = 20 iterations (each with 3 instructions) A A A A A A A A B B A A A A B B A A A A A B B A A B B A B A A A A B B B B A A A A B A B A A A A B B A A A A A B

Back to course listings