EXAMINATIONS 2010 END OF YEAR NWEN 242 COMPUTER ORGANIZATION
|
|
- Raymond James
- 5 years ago
- Views:
Transcription
1 EXAINATIONS 2010 END OF YEAR COPUTER ORGANIZATION Time Allowed: 3 Hors (180 mintes) Instrctions: Answer all qestions. ake sre yor answers are clear and to the point. Calclators and paper foreign langage dictionaries are allowed. No reference material is allowed. There are 180 possible marks on the eam. Every bo with a heavy otline reqires an answer. There is an appendi listing IPS instrctions. Topic arks 1 Inpt-Otpt, Performance, and lti Core 45 marks 2 Converting C into IPS Assembly 20 marks 3 IPS Addressing odes 15 marks 4 IPS Assembly Programming 10 marks 5 Single Cycle Data Path 30 marks 6 Pipelined Data Path 30 marks 7 emory Hierarchy 30 marks Note: arks are shown for each qestion as a whole and also for their parts.
2 Qestion 1. Inpt-Otpt, Performance, and lti-core StdentId [45 arks] For each of the following statements, say whether it is tre or false, 2 marks each qestion. a) DA directly transfers data between an I/O device and memory. b) A DA controller does not need to inform the processor when the data transfer has completed. c) Peripheral devices are considered to be part of the physical address space. d) emory bses are a common way of connecting I/O devices to processors driven by handshaking. e) A simple way to ensre that a ser program does not read or write a peripheral device, is to ensre that the ser program s virtal memory space is set p so that no page corresponds to physical addresses set aside for specific devices. f) DA operations can be triggered at bs cycle bondary while interrpts can only be triggered at instrction bondary. 2 contined
3 StdentId g) ost DA controllers have a Stats Register. This register spplies information to the CPU. h) lti-core processors are ID: Different cores eecte different threads (ltiple Instrctions), operating on different parts of memory (ltiple Data). i) In a mlti-core mltiprocessor, each core has its own memory. j) In a IPS processor, when one thread is waiting for a floating point operation to complete, another thread can se the integer nits. k) There are two kinds of bses: Synchronos bses are more fleible; asynchronos bses are faster. l) The operating system plays a major role in handling I/O, acting as an interface between program and hardware. m) The processor always ses different bses to address memory and I/O devices. 3 contined
4 StdentId n) In brst transfer, a DA controller steals a cycle before every CPU instrction. o) The operating system sally prevents ser programs from interacting directly with I/O devices. For the net five qestions, choose ONE correct answer. 3 arks each qestion. p) A disadvantage of DA is that: A. Compter system performance is improved by direct transfer of data between memory and I/O devices, bypassing the CPU. B. CPU is free to perform operations that do not se system bses. C. In case of brst mode data transfer, the CPU is rendered inactive for relatively long periods of time. D. None of above. q) To speed p the eection of a program, yo can: A. Use fewer instrctions B. Use fewer cycles per instrction C. Use faster clock D. All of above r) Synchronos bses: A. Sffer overhead of handshaking B. Are proof against clock skew (there is no clock) C. Are clocked: All devices connected mst be rn at the same clock rate D. ake longer bses possible 4 contined
5 s) Asynchronos bses: StdentId A. Work with fast and slow devices B. Are inepensive and fast C. Use a simpler protocol than synchronos bses D. All of above t) The time reqired to transmit a signal on a bs in the compter depends on A. inimm block size B. Total delay time of all the devices on the bs C. Time to get control of the bs D. All of above 5 contined
6 Qestion 2. Converting C into IPS Assembly a) [10 marks] Rewrite the following program into IPS Assembly if ( i > j ) A[3] = i + j ; else A[4] = A[i] j; StdentId [20 arks] 6 contined
7 StdentId b) [10 marks] Rewrite the following program into IPS Assembly sm = 0; for (i=1;i<n;i++){ sm=sm+1;} 7 contined
8 Qestion 3. IPS Addressing odes StdentId [15 arks] Briefly eplain each of the following IPS addressing modes, inclding how the addressing mode works and any limitations it has. For each mode list two commands which cold se the addressing mode. a) Register addressing b) PC-relative addressing c) Base addressing 8 contined
9 SPARE PAGE FOR EXTRA S StdentId Cross ot the rogh working that yo do not want marked. Specify the qestion nmber for work yo do want marked. 9 contined
10 Qestion 4. IPS Assembly Programming[10 arks] StdentId Give the console otpts of the IPS program below, for each of the following inpt sets: a) [3 arks] 25. b) [3 arks] -7. c) [4 arks] 5, and then 1, 2, 4, 5, 9. The IPS program ses several instrctions that were not covered in lectres. Yo will need to read the brief reference material provided after the program in order to nderstand the program. The same reference material is also given in the Appendi to this eam..data str1:.asciiz " Please give an integer from 1 to 20: " errormsg:.asciiz "Ot of range (1-20). \n" nline:.asciiz "\n" # new line.tet error: li $v0, 4 la $a0, errormsg syscall #print error msg j get.globl main main: addi $s0, $zero,21 #s0=21 get: li $v0, 4 la $a0, str1 syscall #print string1 li $v0, 5 syscall #read int slt $s1, $v0, $s0 beq $s1, $zero, error blez $v0, error move $t0, $v0 add $t1, $0, $0 loop: addi $t1, $t1, 1 li $v0, 1 move $a0, $t1 syscall #print int li $v0, 4 la $a0, nline syscall #print nline slt $t2, $t1, $t0 bnez $t2, loop li $v0, 10 #eit program syscall 10 contined
11 StdentId IPS Reference la register, variable Load address of variable into register li register, vale Load 32-bit vale into register blez register, target branch to target if register is less than or eqal to zero bnez register, target branch to target if register is not eqal to zero move register1, register2 copies contents of register2 to register 1 syscall invokes a system call, for eample, for reading or printing to the console. Usage of syscall: Step 1. Load the service nmber in register $v0. Step 2. Load argment vales, if any, in $a0, $a1, $a2, or $f12 as specified. Step 3. Isse the SYSCALL instrction. Step 4. Retrieve retrn vales, if any, from reslt registers as specified. Service nmbers and registers *print integer: Code 1 in $v0: $a0 = vale to print *print string: Code 4 in $v0: $a0 = address of nllterminated string to print *read integer: Code 5 in $v0: $v0 willcontain integer read Eample: display the vale stored in $t0 on the console li $v0, 1 add $a0, $t0, $zero register $a0 syscall # service 1 is print integer # load desired vale into argment 11 contined
12 SPARE PAGE FOR EXTRA S StdentId Cross ot the rogh working that yo do not want marked. Specify the qestion nmber for work yo do want marked. 12 contined
13 Qestion 5. Single Cycle Data Path StdentId [30 marks] a) [10 marks] Consider the data_path of a IPS processor. Describe in one or two sentences what is each of the following data_path components sed for: i) [2 marks] Program conter (PC). ii) [2 marks] Register File. iii) [2 marks] ALU. iv) [2 marks] Control Unit. v) [2 marks] ltipleer. 13 contined
14 StdentId b) [7 marks] Consider the diagram of the Single Cycle Data Path in Figre 1 on the facing page. On the diagram, highlight only those lines and components that will be sed to eecte a IPS sw instrction. Trace the lines and circle the components sing a colored pen. Do not pay attention to control signals when answering this qestion. c) [3 marks] Consider the diagram of the Single Cycle Data Path in Figre 1 on the facing page again. Assme a sw instrction is taken. On the diagram, highlight only those control signals that will be asserted dring the eection of the IPS sw instrction. Trace these control signals sing a colored pen. d) [10 marks] Opcode of the IPS bne (branch not eqal) instrction is Opcode of the IPS beq (branch on eqal) instrction is Opcode of the IPS j (jmp) instrction is Design combinational logic blocks that will act as parts of the Single Cycle Data_Path Control Unit and generate Zero&Branch and Jmp control signals in Figre contined
15 StdentId contined 15 RegWrite emwrite shift left Instrction[25-0] 28 PC+4[31-28] JmpAddress[31-0] Jmp emtoreg ALUSrc RegDest zero Zero&Branch Read address Instrction [31-0] 0 1 Sign et PC shift left Add Instrction memory ALU Data memory Add 4 Instrction[25-21] Instrction[20-16] Instrction[15-11] Instrction[15-0] Address Write data Read data reslt Read register 1 Read register 2 Write register Write data Read data 1 Read data Register s Figre 1.
16 StdentId Qestion 6: Pipelined Data Path [30 marks] a) [2 marks] What is pipelining and what is the epected benefit of pipelining? b) [2 marks] What is a data hazard? c) [2 marks] Sppose there is neither hardware detection nor prevention of hazards. How many nops are needed between any two sbseqent instrctions being involved in a hazard? 16
17 ALUSelB ALUSelA StdentId d) [8 marks] Assme yo rn a IPS assembly program on a processor whose data_path contains forwarding nit as those that we considered in lectres. i) [3 marks] Consider the following fragment of a IPS assembly program. add $s0, $t0, $t1 sw $t2, 0($s2) sb $s2, $s0, $t3 If yo think there shold be nops inserted between instrctions to avoid hazards, then insert the necessary nops and show the altered program fragment in the answer bo below. If yo think nops are not needed, jst copy the program fragment above in the answer bo below. ii) [5 marks] Consider the data_path with forwarding in Figre 2. below and the fragment of the IPS assembly program in the answer bo above. If yo think the forwarding nit still has to ndertake some actions to prevent hazards, write instrctions of the program fragment in the appropriate pipeline stages in Figre 2. Take a colored pen and trace only those lines and circle the components in Figre 2 that will be sed to perform the needed forwarding. Note: The data_path in Figre 2 is not complete, bt contains all components yo may need to answer the qestion. ID/EX EX/E E/WB Register File Data memory rt rs Forwarding nit rd rd Figre 2. 17
18 StdentId e) [8 marks] Assme yo rn a IPS assembly program on a processor whose data_path contains a forwarding nit as one considered in lectres. i) [3 marks] Consider the following fragment of a IPS assembly program. add $s0, $t0, $t1 sw $t2, 0($s0) sb $s2, $s2, $t3 If yo think there shold be nops inserted between instrctions to avoid hazards, then insert the necessary nops and show the altered program fragment in the answer bo below. If yo think nops are not needed, jst copy the program fragment above in the answer bo below. ii) [5 marks] Consider the data_path with forwarding in Figre 3 below and the fragment of the IPS assembly program in the answer bo above. If yo think the forwarding nit still has to ndertake some actions to prevent hazards, write instrctions of the program fragment in the appropriate pipeline stages in Figre 3, take a colored pen and trace only those lines and circle the components that will be sed to perform the needed forwarding. Note: The data_path in Figre 3 is not complete, bt contains all components yo may need to answer the qestion. ID/EX EX/E E/WB sign etend ALUSrc Data memory Forwarding nit rd rd Figre 3. 18
19 ALUSelB ALUSelA StdentId f) [8 marks] Assme yo rn a IPS assembly program on a processor whose data_path contains a forwarding nit as one considered in lectres. i) [3 marks] Consider the following fragment of a IPS assembly program. add $s0, $t0, $t1 lw $t2, 0($s1) sb $s2, $s1, $t2 If yo think there shold be nops inserted between instrctions to avoid hazards, then insert the necessary nops and show the altered program fragment in the answer bo below. If yo think nops are not needed, jst copy the program fragment above in the answer bo below. ii) [5 marks] Consider the data_path with forwarding in Figre 4 below and the fragment of the IPS assembly program in the answer bo above. If yo think the forwarding nit still has to ndertake some actions to prevent hazards, show instrctions of the program fragment in the appropriate pipeline stages in Figre 4, take a colored pen and trace only those lines and circle the components that will be sed to perform the needed forwarding. Note: The data_path in Figre 4 is not complete, bt contains all components yo may need to answer the qestion. ID/EX EX/E E/WB Register File Data memory rt rs Forwarding nit rt Figre 4. 19
20 StdentId Qestion 7. emory Hierarchy [30 marks] a) [10 marks] In the table provided for the answer, list the names of the memory hierarchy levels, their typical size (capacity) in bytes or their mltiples, a typical time to read or write, and a typical amont of data read or written dring one read or right operation in bytes or their mltiples. name size r/w time amont b) [10 marks] Determining of the word offset length, slot nmber length, and the tag length are crcial for a correct memory to cache mapping. All these lengths are epressed by the nmber of memory address bits. Figre 5 below displays a memory address of a bits with its tag, slot (or slot set) nmber, word offset, and byte offset fields. Figre 5. Let the cache size be n = 2 s slots (s > 0), the way of cache set associativeness be m = 2 k (k > 0 and n > m), and the memory block size be w = 2 i (i > 0). The length of the byte offset is a constant b = 2. Recall, for m = 1, the cache is direct mapped, and for m = n, the cache is flly associative. Otherwise it is m-way set associative. i) [5 marks] Epress the tag length t as a fnction of a, s, k, i, and b. tag slot (or slot set) nmber word offset byte offset a
21 StdentId ii) [5 marks] Sppose a = 32, n = 2048, m = 8, and w =16. How mch is the tag length t? c) [10 marks] Consider an 8-way set associative cash having 2048 slots of 16 words per block. Assme the cache is initially empty. The processor isses the following reqests: i) [8 marks] In the answer bo below, show the cache content after satisfying the for processor reqests above. In yor answer show the content of the set slot nmber, valid bit, and tag fields of only those slots that are pdated when satisfying processor reqests. Slot Set Nmber V Tag W 0 W 15 ii) [2 marks] How many hits and misses will prodce the processor reqests above? Nmber of Hits = Nmber of isses = ******************* 21
EXAMINATIONS 2003 END-YEAR COMP 203. Computer Organisation
EXAINATIONS 2003 COP203 END-YEAR Compter Organisation Time Allowed: 3 Hors (180 mintes) Instrctions: Answer all qestions. There are 180 possible marks on the eam. Calclators and foreign langage dictionaries
More informationReview. A single-cycle MIPS processor
Review If three instrctions have opcodes, 7 and 5 are they all of the same type? If we were to add an instrction to IPS of the form OD $t, $t2, $t3, which performs $t = $t2 OD $t3, what wold be its opcode?
More informationQuiz #1 EEC 483, Spring 2019
Qiz # EEC 483, Spring 29 Date: Jan 22 Name: Eercise #: Translate the following instrction in C into IPS code. Eercise #2: Translate the following instrction in C into IPS code. Hint: operand C is stored
More information1048: Computer Organization
48: Compter Organization Lectre 5 Datapath and Control Lectre5A - simple implementation (cwli@twins.ee.nct.ed.tw) 5A- Introdction In this lectre, we will try to implement simplified IPS which contain emory
More informationTDT4255 Friday the 21st of October. Real world examples of pipelining? How does pipelining influence instruction
Review Friday the 2st of October Real world eamples of pipelining? How does pipelining pp inflence instrction latency? How does pipelining inflence instrction throghpt? What are the three types of hazard
More informationWhat do we have so far? Multi-Cycle Datapath
What do we have so far? lti-cycle Datapath CPI: R-Type = 4, Load = 5, Store 4, Branch = 3 Only one instrction being processed in datapath How to lower CPI frther? #1 Lec # 8 Spring2 4-11-2 Pipelining pipelining
More informationThe single-cycle design from last time
lticycle path Last time we saw a single-cycle path and control nit for or simple IPS-based instrction set. A mlticycle processor fies some shortcomings in the single-cycle CPU. Faster instrctions are not
More informationCS 251, Winter 2018, Assignment % of course mark
CS 25, Winter 28, Assignment 4.. 3% of corse mark De Wednesday, arch 7th, 4:3P Lates accepted ntil Thrsday arch 8th, am with a 5% penalty. (6 points) In the diagram below, the mlticycle compter from the
More informationChapter 3 & Appendix C Pipelining Part A: Basic and Intermediate Concepts
CS359: Compter Architectre Chapter 3 & Appendi C Pipelining Part A: Basic and Intermediate Concepts Yanyan Shen Department of Compter Science and Engineering Shanghai Jiao Tong University 1 Otline Introdction
More informationCS 251, Winter 2019, Assignment % of course mark
CS 25, Winter 29, Assignment.. 3% of corse mark De Wednesday, arch 3th, 5:3P Lates accepted ntil Thrsday arch th, pm with a 5% penalty. (7 points) In the diagram below, the mlticycle compter from the corse
More informationThe final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read.
The final path PC 4 Add Reg Shift left 2 Add PCSrc Instrction [3-] Instrction I [25-2] I [2-6] I [5 - ] register register 2 register 2 Registers ALU Zero Reslt ALUOp em Data emtor RegDst ALUSrc em I [5
More informationEnhanced Performance with Pipelining
Chapter 6 Enhanced Performance with Pipelining Note: The slides being presented represent a mi. Some are created by ark Franklin, Washington University in St. Lois, Dept. of CSE. any are taken from the
More informationReview Multicycle: What is Happening. Controlling The Multicycle Design
Review lticycle: What is Happening Reslt Zero Op SrcA SrcB Registers Reg Address emory em Data Sign etend Shift left Sorce A B Ot [-6] [5-] [-6] [5-] [5-] Instrction emory IR RegDst emtoreg IorD em em
More informationThe extra single-cycle adders
lticycle Datapath As an added bons, we can eliminate some of the etra hardware from the single-cycle path. We will restrict orselves to sing each fnctional nit once per cycle, jst like before. Bt since
More informationReview: Computer Organization
Review: Compter Organization Pipelining Chans Y Landry Eample Landry Eample Ann, Brian, Cathy, Dave each have one load of clothes to wash, dry, and fold Washer takes 3 mintes A B C D Dryer takes 3 mintes
More informationLecture 7. Building A Simple Processor
Lectre 7 Bilding A Simple Processor Christos Kozyrakis Stanford University http://eeclass.stanford.ed/ee8b C. Kozyrakis EE8b Lectre 7 Annoncements Upcoming deadlines Lab is de today Demo by 5pm, report
More informationEEC 483 Computer Organization
EEC 483 Compter Organization Chapter 4.4 A Simple Implementation Scheme Chans Y The Big Pictre The Five Classic Components of a Compter Processor Control emory Inpt path Otpt path & Control 2 path and
More informationCS 251, Spring 2018, Assignment 3.0 3% of course mark
CS 25, Spring 28, Assignment 3. 3% of corse mark De onday, Jne 25th, 5:3 P. (5 points) Consider the single-cycle compter shown on page 6 of this assignment. Sppose the circit elements take the following
More informationInstruction fetch. MemRead. IRWrite ALUSrcB = 01. ALUOp = 00. PCWrite. PCSource = 00. ALUSrcB = 00. R-type completion
. (Chapter 5) Fill in the vales for SrcA, SrcB, IorD, Dst and emto to complete the Finite State achine for the mlti-cycle datapath shown below. emory address comptation 2 SrcA = SrcB = Op = fetch em SrcA
More informationProf. Kozyrakis. 1. (10 points) Consider the following fragment of Java code:
EE8 Winter 25 Homework #2 Soltions De Thrsday, Feb 2, 5 P. ( points) Consider the following fragment of Java code: for (i=; i
More informationComputer Architecture
Compter Architectre Lectre 4: Intro to icroarchitectre: Single- Cycle Dr. Ahmed Sallam Sez Canal University Based on original slides by Prof. Onr tl Review Compter Architectre Today and Basics (Lectres
More informationExceptions and interrupts
Eceptions and interrpts An eception or interrpt is an nepected event that reqires the CPU to pase or stop the crrent program. Eception handling is the hardware analog of error handling in software. Classes
More informationComputer Architecture
Compter Architectre Lectre 4: Intro to icroarchitectre: Single- Cycle Dr. Ahmed Sallam Sez Canal University Spring 25 Based on original slides by Prof. Onr tl Review Compter Architectre Today and Basics
More informationLab 8 (All Sections) Prelab: ALU and ALU Control
Lab 8 (All Sections) Prelab: and Control Name: Sign the following statement: On my honor, as an Aggie, I have neither given nor received nathorized aid on this academic work Objective In this lab yo will
More informationComputer Architecture Chapter 5. Fall 2005 Department of Computer Science Kent State University
Compter Architectre Chapter 5 Fall 25 Department of Compter Science Kent State University The Processor: Datapath & Control Or implementation of the MIPS is simplified memory-reference instrctions: lw,
More informationCS 251, Winter 2018, Assignment % of course mark
CS 25, Winter 28, Assignment 3.. 3% of corse mark De onday, Febrary 26th, 4:3 P Lates accepted ntil : A, Febrary 27th with a 5% penalty. IEEE 754 Floating Point ( points): (a) (4 points) Complete the following
More informationPipelining. Chapter 4
Pipelining Chapter 4 ake processor rns faster Pipelining is an implementation techniqe in which mltiple instrctions are overlapped in eection Key of making processor fast Pipelining Single cycle path we
More information1048: Computer Organization
8: Compter Organization Lectre 6 Pipelining Lectre6 - pipelining (cwli@twins.ee.nct.ed.tw) 6- Otline An overview of pipelining A pipelined path Pipelined control Data hazards and forwarding Data hazards
More informationChapter 6: Pipelining
CSE 322 COPUTER ARCHITECTURE II Chapter 6: Pipelining Chapter 6: Pipelining Febrary 10, 2000 1 Clothes Washing CSE 322 COPUTER ARCHITECTURE II The Assembly Line Accmlate dirty clothes in hamper Place in
More informationEEC 483 Computer Organization. Branch (Control) Hazards
EEC 483 Compter Organization Section 4.8 Branch Hazards Section 4.9 Exceptions Chans Y Branch (Control) Hazards While execting a previos branch, next instrction address might not yet be known. s n i o
More information1048: Computer Organization
48: Compter Organization Lectre 5 Datapath and Control Lectre5B - mlticycle implementation (cwli@twins.ee.nct.ed.tw) 5B- Recap: A Single-Cycle Processor PCSrc 4 Add Shift left 2 Add ALU reslt PC address
More informationThe multicycle datapath. Lecture 10 (Wed 10/15/2008) Finite-state machine for the control unit. Implementing the FSM
Lectre (Wed /5/28) Lab # Hardware De Fri Oct 7 HW #2 IPS programming, de Wed Oct 22 idterm Fri Oct 2 IorD The mlticycle path SrcA Today s objectives: icroprogramming Etending the mlti-cycle path lti-cycle
More informationWinter 2013 MIDTERM TEST #2 Wednesday, March 20 7:00pm to 8:15pm. Please do not write your U of C ID number on this cover page.
page of 7 University of Calgary Departent of Electrical and Copter Engineering ENCM 369: Copter Organization Lectre Instrctors: Steve Noran and Nor Bartley Winter 23 MIDTERM TEST #2 Wednesday, March 2
More informationComp 303 Computer Architecture A Pipelined Datapath Control. Lecture 13
Comp 33 Compter Architectre A Pipelined path Lectre 3 Pipelined path with Signals PCSrc IF/ ID ID/ EX EX / E E / Add PC 4 Address Instrction emory RegWr ra rb rw Registers bsw [5-] [2-6] [5-] bsa bsb Sign
More informationSolutions for Chapter 6 Exercises
Soltions for Chapter 6 Eercises Soltions for Chapter 6 Eercises 6. 6.2 a. Shortening the ALU operation will not affect the speedp obtained from pipelining. It wold not affect the clock cycle. b. If the
More informationHardware Design Tips. Outline
Hardware Design Tips EE 36 University of Hawaii EE 36 Fall 23 University of Hawaii Otline Verilog: some sbleties Simlators Test Benching Implementing the IPS Actally a simplified 6 bit version EE 36 Fall
More informationPART I: Adding Instructions to the Datapath. (2 nd Edition):
EE57 Instrctor: G. Pvvada ===================================================================== Homework #5b De: check on the blackboard =====================================================================
More informationEEC 483 Computer Organization
EEC 83 Compter Organization Chapter.6 A Pipelined path Chans Y Pipelined Approach 2 - Cycle time, No. stages - Resorce conflict E E A B C D 3 E E 5 E 2 3 5 2 6 7 8 9 c.y9@csohio.ed Resorces sed in 5 Stages
More informationLecture 13: Exceptions and Interrupts
18 447 Lectre 13: Eceptions and Interrpts S 10 L13 1 James C. Hoe Dept of ECE, CU arch 1, 2010 Annoncements: Handots: Spring break is almost here Check grades on Blackboard idterm 1 graded Handot #9: Lab
More informationPS Midterm 2. Pipelining
PS idterm 2 Pipelining Seqential Landry 6 P 7 8 9 idnight Time T a s k O r d e r A B C D 3 4 2 3 4 2 3 4 2 3 4 2 Seqential landry takes 6 hors for 4 loads If they learned pipelining, how long wold landry
More informationLecture 6: Microprogrammed Multi Cycle Implementation. James C. Hoe Department of ECE Carnegie Mellon University
8 447 Lectre 6: icroprogrammed lti Cycle Implementation James C. Hoe Department of ECE Carnegie ellon University 8 447 S8 L06 S, James C. Hoe, CU/ECE/CALC, 208 Yor goal today Hosekeeping nderstand why
More informationCSE 141 Computer Architecture Summer Session I, Lectures 10 Advanced Topics, Memory Hierarchy and Cache. Pramod V. Argade
CSE 141 Compter Architectre Smmer Session I, 2004 Lectres 10 Advanced Topics, emory Hierarchy and Cache Pramod V. Argade CSE141: Introdction to Compter Architectre Instrctor: TA: Pramod V. Argade (p2argade@cs.csd.ed)
More informationChapter 6: Pipelining
Chapter 6: Pipelining Otline An overview of pipelining A pipelined path Pipelined control Data hazards and forwarding Data hazards and stalls Branch hazards Eceptions Sperscalar and dynamic pipelining
More informationOverview of Pipelining
EEC 58 Compter Architectre Pipelining Department of Electrical Engineering and Compter Science Cleveland State University Fndamental Principles Overview of Pipelining Pipelined Design otivation: Increase
More informationCSE Introduction to Computer Architecture Chapter 5 The Processor: Datapath & Control
CSE-45432 Introdction to Compter Architectre Chapter 5 The Processor: Datapath & Control Dr. Izadi Data Processor Register # PC Address Registers ALU memory Register # Register # Address Data memory Data
More informationCS 153 Design of Operating Systems
CS 153 Design of Operating Systems Spring 18 Lectre 3: OS model and Architectral Spport Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Last time/today
More informationPOWER-OF-2 BOUNDARIES
Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of
More informationComputer Architecture. Lecture 6: Pipelining
Compter Architectre Lectre 6: Pipelining Dr. Ahmed Sallam Based on original slides by Prof. Onr tl Agenda for Today & Net Few Lectres Single-cycle icroarchitectres lti-cycle and icroprogrammed icroarchitectres
More informationLecture 9: Microcontrolled Multi-Cycle Implementations
8-447 Lectre 9: icroled lti-cycle Implementations James C. Hoe Dept of ECE, CU Febrary 8, 29 S 9 L9- Annoncements: P&H Appendi D Get started t on Lab Handots: Handot #8: Project (on Blackboard) Single-Cycle
More informationChapter 6 Enhancing Performance with. Pipelining. Pipelining. Pipelined vs. Single-Cycle Instruction Execution: the Plan. Pipelining: Keep in Mind
Pipelining hink of sing machines in landry services Chapter 6 nhancing Performance with Pipelining 6 P 7 8 9 A ime ask A B C ot pipelined Assme 3 min. each task wash, dry, fold, store and that separate
More information4.13 Advanced Topic: An Introduction to Digital Design Using a Hardware Design Language 345.e1
.3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage 35.e.3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage to Describe and odel a Pipeline
More informationLecture 10: Pipelined Implementations
U 8-7 S 9 L- 8-7 Lectre : Pipelined Implementations James. Hoe ept of EE, U Febrary 23, 29 nnoncements: Project is de this week idterm graded, d reslts posted Handots: H9 Homework 3 (on lackboard) Graded
More informationComputer Architecture Lecture 6: Multi-cycle Microarchitectures. Prof. Onur Mutlu Carnegie Mellon University Spring 2012, 2/6/2012
8-447 Compter Architectre Lectre 6: lti-cycle icroarchitectres Prof. Onr tl Carnegie ellon University Spring 22, 2/6/22 Reminder: Homeworks Homework soltions Check and stdy the soltions! Learning now is
More informationCS 153 Design of Operating Systems
CS 53 Design of Operating Systems Spring 8 Lectre 9: Locality and Cache Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Some slides modified from originals
More informationCS 153 Design of Operating Systems Spring 18
CS 153 Design of Operating Systems Spring 18 Lectre 15: Virtal Address Space Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian OS Abstractions Applications
More informationCSSE232 Computer Architecture I. Mul5cycle Datapath
CSSE232 Compter Architectre I Ml5cycle Datapath Class Stats Next 3 days : Ml5cycle datapath ing Ml5cycle datapath is not in the book! How long do instrc5ons take? ALU 2ns Mem 2ns Reg File 1ns Everything
More informationCS 153 Design of Operating Systems
CS 53 Design of Operating Systems Spring 8 Lectre 6: Paging Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Some slides modified from originals by Dave
More informationMIPS Architecture. Fibonacci (C) Fibonacci (Assembly) Another Example: MIPS. Example: subset of MIPS processor architecture
Another Eample: IPS From the Harris/Weste book Based on the IPS-like processor from the Hennessy/Patterson book IPS Architectre Eample: sbset of IPS processor architectre Drawn from Patterson & Hennessy
More informationPIPELINING. Pipelining: Natural Phenomenon. Pipelining. Pipelining Lessons
Pipelining: Natral Phenomenon Landry Eample: nn, rian, Cathy, Dave each have one load of clothes to wash, dry, and fold Washer takes 30 mintes C D Dryer takes 0 mintes PIPELINING Folder takes 20 mintes
More informationInstruction Pipelining is the use of pipelining to allow more than one instruction to be in some stage of execution at the same time.
Pipelining Pipelining is the se of pipelining to allow more than one instrction to be in some stage of eection at the same time. Ferranti ATLAS (963): Pipelining redced the average time per instrction
More informationcs470 - Computer Architecture 1 Spring 2002 Final Exam open books, open notes
1 of 7 ay 13, 2002 v2 Spring 2002 Final Exam open books, open notes Starts: 7:30 pm Ends: 9:30 pm Name: (please print) ID: Problem ax points Your mark Comments 1 10 5+5 2 40 10+5+5+10+10 3 15 5+10 4 10
More informationCS 153 Design of Operating Systems Spring 18
CS 153 Design of Operating Systems Spring 18 Lectre 11: Semaphores Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Last time Worked throgh software implementation
More informationMultiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET
Mltiple-Choice Test Chapter 09.0 Golden Section Search Method Optimization COMPLETE SOLUTION SET. Which o the ollowing statements is incorrect regarding the Eqal Interval Search and Golden Section Search
More informationReview. How to represent real numbers
PCWrite PC IorD Review ALUSrcA emread Address Write data emory emwrite em Data IRWrite [3-26] [25-2] [2-6] [5-] [5-] RegDst Read register Read register 2 Write register Write data RegWrite Read data Read
More informationTdb: A Source-level Debugger for Dynamically Translated Programs
Tdb: A Sorce-level Debgger for Dynamically Translated Programs Naveen Kmar, Brce R. Childers, and Mary Lo Soffa Department of Compter Science University of Pittsbrgh Pittsbrgh, Pennsylvania 15260 {naveen,
More information(2, 4) Tree Example (2, 4) Tree: Insertion
Presentation for se with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 B-Trees and External Memory (2, 4) Trees Each internal node has 2 to 4 children:
More informationEE557--FALL 1999 MAKE-UP MIDTERM 1. Closed books, closed notes
NAME: STUDENT NUMBER: EE557--FALL 1999 MAKE-UP MIDTERM 1 Closed books, closed notes Q1: /1 Q2: /1 Q3: /1 Q4: /1 Q5: /15 Q6: /1 TOTAL: /65 Grade: /25 1 QUESTION 1(Performance evaluation) 1 points We are
More informationImprove performance by increasing instruction throughput
Improve performance by increasing instruction throughput Program execution order Time (in instructions) lw $1, 100($0) fetch 2 4 6 8 10 12 14 16 18 ALU Data access lw $2, 200($0) 8ns fetch ALU Data access
More informationComputer and Information Sciences College / Computer Science Department The Processor: Datapath and Control
Computer and Information Sciences College / Computer Science Department The Processor: Datapath and Control Chapter 5 The Processor: Datapath and Control Big Picture: Where are We Now? Performance of a
More information4.13. An Introduction to Digital Design Using a Hardware Design Language to Describe and Model a Pipeline and More Pipelining Illustrations
.3 An Introdction to Digital Design Using a Hardware Design Langage to Describe and odel a Pipeline and ore Pipelining Illstrations This online section covers hardware description langages and then gives
More informationECE 313 Computer Organization FINAL EXAM December 14, This exam is open book and open notes. You have 2 hours.
This exam is open book and open notes. You have 2 hours. Problems 1-5 refer to the following: We wish to add a new R-Format instruction to the MIPS Instruction Set Architecture called l_inc (load and increment).
More informationCS 153 Design of Operating Systems Spring 18
CS 153 Design of Operating Systems Spring 18 Lectre 10: Lock Implementation Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Recap: Synchronization Race
More informationEC 413 Computer Organization - Fall 2017 Problem Set 3 Problem Set 3 Solution
EC 413 Computer Organization - Fall 2017 Problem Set 3 Problem Set 3 Solution Important guidelines: Always state your assumptions and clearly explain your answers. Please upload your solution document
More informationECE232: Hardware Organization and Design
ECE232: Harware Organization an Design ectre 11: Introction to IPs path apte from Compter Organization an Design, Patterson & Hennessy, CB IPS-lite processor Compter Want to bil a processor for a sbset
More informationCS 153 Design of Operating Systems Spring 18
CS 153 Design of Operating Systems Spring 18 Lectre 8: Threads Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Processes P1 P2 Recall that Bt OS A process
More informationCS 153 Design of Operating Systems
CS 153 Design of Operating Systems Spring 18 Lectre 25: Dynamic Memory (1) Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Some slides modified from originals
More informationCS 251, Winter 2019, Assignment % of course mark
CS 251, Winter 2019, Assignment 5.1.1 3% of course mark Due Wednesday, March 27th, 5:30PM Lates accepted until 1:00pm March 28th with a 15% penalty 1. (10 points) The code sequence below executes on a
More informationAnimating the Datapath. Animating the Datapath: R-type Instruction. Animating the Datapath: Load Instruction. MIPS Datapath I: Single-Cycle
nimating the atapath PS atapath : Single-Cycle npt is either (-type) or sign-etended lower half of instrction (load/store) op offset/immediate W egister File 6 6 + from instrction path beq,, offset if
More informationEMC ViPR. User Guide. Version
EMC ViPR Version 1.1.0 User Gide 302-000-481 01 Copyright 2013-2014 EMC Corporation. All rights reserved. Pblished in USA. Pblished Febrary, 2014 EMC believes the information in this pblication is accrate
More informationCS 251, Winter 2018, Assignment % of course mark
CS 251, Winter 2018, Assignment 5.0.4 3% of course mark Due Wednesday, March 21st, 4:30PM Lates accepted until 10:00am March 22nd with a 15% penalty 1. (10 points) The code sequence below executes on a
More informationFinal Exam Fall 2007
ICS 233 - Computer Architecture & Assembly Language Final Exam Fall 2007 Wednesday, January 23, 2007 7:30 am 10:00 am Computer Engineering Department College of Computer Sciences & Engineering King Fahd
More informationCS 153 Design of Operating Systems Spring 18
CS 53 Design of Operating Systems Spring 8 Lectre 2: Virtal Memory Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Recap: cache Well-written programs exhibit
More informationCOMPUTER ORGANIZATION AND DESIGN. The Hardware/Software Interface. Chapter 4. The Processor: A Based on P&H
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface Chapter 4 The Processor: A Based on P&H Introduction We will examine two MIPS implementations A simplified version A more realistic pipelined
More informationThe MIPS Processor Datapath
The MIPS Processor Datapath Module Outline MIPS datapath implementation Register File, Instruction memory, Data memory Instruction interpretation and execution. Combinational control Assignment: Datapath
More informationMIPS Coding Continued
MIPS Coding Continued Exercise 1 Suppose we have three arrays, A, B, C, all of size 10. Now we want to set C[i] = min(a[i], B[i]) for all 0
More informationCAPL Scripting Quickstart
CAPL Scripting Qickstart CAPL (Commnication Access Programming Langage) For CANalyzer and CANoe V1.01 2015-12-03 Agenda Important information before getting started 3 Visal Seqencer (GUI based programming
More informationMa Lesson 18 Section 1.7
Ma 15200 Lesson 18 Section 1.7 I Representing an Ineqality There are 3 ways to represent an ineqality. (1) Using the ineqality symbol (sometime within set-bilder notation), (2) sing interval notation,
More informationCS 351 Exam 2 Mon. 11/2/2015
CS 351 Exam 2 Mon. 11/2/2015 Name: Rules and Hints The MIPS cheat sheet and datapath diagram are attached at the end of this exam for your reference. You may use one handwritten 8.5 11 cheat sheet (front
More informationdss-ip Manual digitalstrom Server-IP Operation & Settings
dss-ip digitalstrom Server-IP Manal Operation & Settings Table of Contents digitalstrom Table of Contents 1 Fnction and Intended Use... 3 1.1 Setting p, Calling p and Operating... 3 1.2 Reqirements...
More informationCSE 378 Midterm 2/12/10 Sample Solution
Question 1. (6 points) (a) Rewrite the instruction sub $v0,$t8,$a2 using absolute register numbers instead of symbolic names (i.e., if the instruction contained $at, you would rewrite that as $1.) sub
More informationCS 153 Design of Operating Systems Spring 18
CS 153 Design of Operating Systems Spring 18 Lectre 9: Synchronization (1) Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Cooperation between Threads
More informationEECS 322 Computer Architecture Improving Memory Access: the Cache
EECS 322 Computer Architecture Improving emory Access: the Cache Instructor: Francis G. Wolff wolff@eecs.cwru.edu Case Western Reserve University This presentation uses powerpoint animation: please viewshow
More informationCS 230 Practice Final Exam & Actual Take-home Question. Part I: Assembly and Machine Languages (22 pts)
Part I: Assembly and Machine Languages (22 pts) 1. Assume that assembly code for the following variable definitions has already been generated (and initialization of A and length). int powerof2; /* powerof2
More informationCS 153 Design of Operating Systems
CS 153 Design of Operating Systems Spring 18 Lectre 23: File Systems (2) Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Last time Abstractions for the
More informationECE 313 Computer Organization FINAL EXAM December 14, This exam is open book and open notes. You have 2 hours.
This exam is open book and open notes. You have 2 hours. Problems 1-4 refer to a proposed MIPS instruction lwu (load word - update) which implements update addressing an addressing mode that is used in
More informationInstruction word R0 R1 R2 R3 R4 R5 R6 R8 R12 R31
4.16 Exercises 419 Exercise 4.11 In this exercise we examine in detail how an instruction is executed in a single-cycle datapath. Problems in this exercise refer to a clock cycle in which the processor
More informationComputer Organization and Structure
Computer Organization and Structure 1. Assuming the following repeating pattern (e.g., in a loop) of branch outcomes: Branch outcomes a. T, T, NT, T b. T, T, T, NT, NT Homework #4 Due: 2014/12/9 a. What
More informationDecoders. 3-Input Full Decoder
ecoders A fll decoder with n inpts has 2 n otpts. Let inpts be labeled In, In, In 2,..., In n, and let otpts be labeled Ot, Ot,..., Ot 2 n. A fll decoder fnctions as follows: Only one of otpts has vale
More informationThe Disciplined Flood Protocol in Sensor Networks
The Disciplined Flood Protocol in Sensor Networks Yong-ri Choi and Mohamed G. Goda Department of Compter Sciences The University of Texas at Astin, U.S.A. fyrchoi, godag@cs.texas.ed Hssein M. Abdel-Wahab
More informationThe Evolution of Microprocessors. Per Stenström
The Evolution of Microprocessors Per Stenström Processor (Core) Processor (Core) Processor (Core) L1 Cache L1 Cache L1 Cache L2 Cache Microprocessor Chip Memory Evolution of Microprocessors Multicycle
More information