Solutions for Chapter 6 Exercises
|
|
- Clement Grant
- 6 years ago
- Views:
Transcription
1 Soltions for Chapter 6 Eercises Soltions for Chapter 6 Eercises a. Shortening the ALU operation will not affect the speedp obtained from pipelining. It wold not affect the clock cycle. b. If the ALU operation takes 25% more time, it becomes the bottleneck in the pipeline. The clock cycle needs to be 25 ps. The speedp wold be 2% less. a. It takes ps * 6 instrctions = microseconds to eecte on a nonpipelined processor (ignoring start and end transients in the pipeline). b. A perfect 2-stage pipeline wold speed p the eection by 2 times. c. Pipeline overhead impacts both latency and throghpt. 6.3 See the following figre: Program eection order Time (in instrctions) add $3, $4, $ IF ID EX E WB sb $5, $3, $2 IF ID EX E WB lw $7, ($5) IF ID EX E WB bbble bbble bbble bbble bbble add $8, $7, $2 IF ID EX E WB 6.4 There is a dependency throgh $3 between the first instrction and each sbseqent instrction. There is a dependency throgh $6 between the lw instrction and the last instrction. For a five-stage pipeline as shown in Figre 6.7, the dependencies between the first instrction and each sbseqent instrction can be resolved by sing forwarding. The dependency between the load and the last add instrction cannot be resolved by sing forwarding.
2 2 Soltions for Chapter 6 Eercises 6.6 Any part of the following figre not marked as active is inactive. PCSrc IF/ID ID/EX EX/E E/WB 4 Reg Shift left 2 reslt Branch PC ress register register 2 Registers register 2 ALUSrc Zero Zero ALU ALU reslt ress em Data emtoreg [5] 6 Sign 32 etend 6 ALU control em [26] [5] ALUOp RegDst Stage
3 Soltions for Chapter 6 Eercises 3 PCSrc IF/ID ID/EX EX/E E/WB 4 Reg Shift left 2 reslt Branch PC ress register register 2 Registers register 2 ALUSrc Zero Zero ALU ALU reslt ress em Data emtoreg [5] 6 Sign 32 etend 6 ALU control em [26 ] [5 ] ALUOp RegDst Stage 2
4 4 Soltions for Chapter 6 Eercises PCSrc IF/ID ID/EX EX/E E/WB 4 Reg Shift left 2 reslt Branch PC ress register register 2 Registers register 2 ALUSrc Zero Zero ALU ALU reslt ress em Data emtoreg [5] 6 Sign 32 etend 6 ALU control em [26 ] [5 ] ALUOp RegDst Stage 3
5 Soltions for Chapter 6 Eercises 5 PCSrc IF/ID ID/EX EX/E E/WB 4 Reg Shift left 2 reslt Branch PC ress register register 2 Registers register 2 ALUSrc Zero Zero ALU ALU reslt em ress Data emtoreg [5] 6 Sign 32 etend 6 ALU control em [26 ] [5 ] ALUOp RegDst Stage 4 Since this is an sw instrction, there is no work done in the WB stage. 6.2 No soltion provided. 6.3 No soltion provided. 6.4 No soltion provided.
6 6 Soltions for Chapter 6 Eercises 6.7 At the end of the first cycle, instrction is fetched. At the end of the second cycle, instrction reads registers. At the end of the third cycle, instrction 2 reads registers. At the end of the forth cycle, instrction 3 reads registers. At the end of the fifth cycle, instrction 4 reads registers, and instrction writes registers. Therefore, at the end of the fifth cycle of eection, registers $6 and $ are being read and register $2 will be written. 6.8 The forwarding nit is seeing if it needs to forward. It is looking at the instrctions in the forth and fifth stages and checking to see whether they intend to write to the register file and whether the register written is being sed as an ALU inpt. Ths, it is comparing 3 = 4? 3 = 2? 7 = 4? 7 = 2? 6.9 The hazard detection nit is checking to see whether the instrction in the ALU stage is an lw instrction and whether the instrction in the ID stage is reading the register that the lw will be writing. If it is, it needs to stall. If there is an lw instrction, it checks to see whether the destination is register 6 or (the registers being read). 6.2 a. There will be a bbble of cycle between a lw and the dependent add since the load vale is available after the E stage. There is no bbble between an add and the dependent lw since the add reslt is available after the EX stage and it can be forwarded to the EX stage for the dependent lw. Therefore, CPI = cycle/instrction.5. b. Withot forwarding, the vale being written into a register can only be read in the same cycle. As a reslt, there will be a bbble of 2 cycles between an lw and the dependent add since the load vale is written to the register after the E stage. Similarly, there will be a bbble of 2 cycles between an add and the dependent lw. Therefore, CPI 3.
7 Soltions for Chapter 6 Eercises It will take 8 cycles to eecte this code, inclding a bbble of cycle de to the dependency between the lw and sb instrctions. Time (in clock cycles) Program CC CC 2 CC 3 CC 4 CC 5 CC 6 eection order (in instrctions) lw $4, ($2) I Reg D Reg CC 7 sb $6, $4, $3 I Reg D Reg add $2, $3, $5 I Reg D Reg Program eection order (in instrctions) Time (in clock cycles) CC CC 2 CC 3 CC 4 CC 5 CC 6 CC 7 CC 8 lw $4, ($2) I Reg D Reg sb $6, $4, $3 I Reg Reg D Reg add $2, $3, $5 I I Reg D Reg bbble
8 8 Soltions for Chapter 6 Eercises 6.23 Inpt Nmber of bits Usage ID/EX.RegisterRs 5 operand reg nmber, compare to see if match ID/EX.RegisterRt 5 operand reg nmber, compare to see if match EX/E.RegisterRd 5 destination reg nmber, compare to see if match EX/E.Reg TRUE if writes to the destination reg E/WB.RegisterRd 5 destination reg nmber, compare to see if match E/WB.Reg TRUE if writes to the destination reg Otpt Nmber of bits Usage ForwardA 2 forwarding signal ForwardB 2 forwarding signal 6.29 No soltion provided. 6.3 The performance for the single-cycle design will not change since the clock cycle remains the same. For the mlticycle design, the nmber of cycles for each instrction class becomes the following: loads: 7, stores: 6, ALU instrctions: 5, branches: 4, jmps: 4. CPI =.25 * 7 +. * * 5 +. * * 4 = The cycle time for the mlticycle design is now ps. The average instrction becomes 5.47 * = 547 ps. Now the mlticycle design performs better than the single-cycle design See the following figre. IF IF2 ID EX E E2 WB when defined by lw sed in i => 2-cycle stall sed in i2 => -cycle stall sed in i3 => forward when defined by R-type sed in i => forward sed in i2 => forward sed in i3 => forward
9 Soltions for Chapter 6 Eercises Branches take cycle when predicted correctly, 3 cycles when not (inclding one more access cycle). So the average clock cycle per branch is.75 * +.25 * 3 =.5. For loads, if the instrction immediately following it is dependent on the load, the load takes 3 cycles. If the net instrction is not dependent on the load bt the second following instrction is dependent on the load, the load takes two cycles. If neither two following instrctions are dependent on the load, the load takes one cycle. The probability that the net instrction is dependent on the load is.5. The probability that the net instrction is not dependent on the load, bt the second following instrction is dependent, is.5 *.25 =.25. The probability that neither of the two following instrctions is dependent on the load is.375. Ths the effective CPI for loads is.5 * * * = Using the date from the eample on page 425, the average CPI is.25 * * +.52 * +. * * 3 =.47. Average instrction time is.47 * ps = 47 ps. The relative performance of the restrctred pipeline to the single-cycle design is 6/47 = The opportnity for both forwarding and hazards that cannot be resolved by forwarding eists when a branch is dependent on one or more reslts that are still in the pipeline. Following is an eample: lw $, $2() add $, $, beq $, $2, Prediction accracy = % * PredictRight/TotalBranches a. Branch : prediction: T-T-T, right: 3, wrong: Branch 2: prediction: T-T-T-T, right:, wrong: 4 Branch 3: prediction: T-T-T-T-T-T, right: 3, wrong: 3 Branch 4: prediction: T-T-T-T-T, right: 4, wrong: Branch 5: prediction: T-T-T-T-T-T-T, right: 5, wrong: 2 Total: right: 5, wrong: Accracy = % * 5/25 = 6%
10 Soltions for Chapter 6 Eercises b. Branch : prediction: N-N-N, right:, wrong: 3 Branch 2: prediction: N-N-N-N, right: 4, wrong: Branch 3: prediction: N-N-N-N-N-N, right: 3, wrong: 3 Branch 4: prediction: N-N-N-N-N, right:, wrong: 4 Branch 5: prediction: N-N-N-N-N-N-N, right: 2, wrong: 5 Total: right:, wrong: 5 Accracy = % * /25 = 4% c. Branch : prediction: T-T-T, right: 3, wrong: Branch 2: prediction: T-N-N-N, right: 3, wrong: Branch 3: prediction: T-T-N-T-N-T, right:, wrong: 5 Branch 4: prediction: T-T-T-T-N, right: 3, wrong: 2 Branch 5: prediction: T-T-T-N-T-T-N, right: 3, wrong: 4 Total: right: 3, wrong: 2 Accracy = % * 3/25 = 52% d. Branch : prediction: T-T-T, right: 3, wrong: Branch 2: prediction: T-N-N-N, right: 3, wrong: Branch 3: prediction: T-T-T-T-T-T, right: 3, wrong: 3 Branch 4: prediction: T-T-T-T-T, right: 4, wrong: Branch 5: prediction: T-T-T-T-T-T-T, right: 5, wrong: 2 Total: right: 8, wrong: 7 Accracy = % * 8/25 = 72% 6.37 No soltion provided No soltion provided Rearrange the instrction seqence sch that the instrction reading a vale prodced by a load instrction is right after the load. In this way, there will be a stall after the load since the load vale is not available till after its E stage. lw $2, ($6) add $4, $2, $3 lw $3, 2($7) add $6, $3, $5 sb $8, $4, $6 lw $7, 3($8) beq $7, $8, Loop
11 Soltions for Chapter 6 Eercises 6.4 Yes. When it is determined that the branch is taken (in WB), the pipeline will be flshed. At the same time, the lw instrction will stall the pipeline since the load vale is not available for add. Both flsh and stall will zero the control signals. The flsh shold take priority since the lw stall shold not have occrred. They are on the wrong path. One soltion is to add the flsh pipeline signal to the Hazard Detection Unit. If the pipeline needs to be flshed, no stall will take place. 6.4 The store instrction can read the vale from the register if it is prodced at least 3 cycles earlier. Therefore, we only need to consider forwarding the reslts prodced by the two instrctions right before the store. When the store is in EX stage, the instrction 2 cycles ahead is in WB stage. The instrction can be either a lw or an ALU instrction. assign EXErt = EXEIR[2:6]; assign bypassvfromwb = (IDEXop == SW) & (IDEXrt!= ) & ( ((EWBop == LW) & (IDEXrt == EWBrt)) ((EWBop ==ALUop) & (IDEXrt == EWBrd)) ); This signal controls the store vale that goes into EX/E register. The vale prodced by the instrction cycle ahead of the store can be bypassed from the E/WB register. Thogh the vale from an ALU instrction is available cycle earlier, we need to wait for the load instrction anyway. assign bypassvfromwb2 = (EXEop == SW) & (EXErt!= ) & (!bypassvfromwb) & ( ((EWBop == LW) & (EXErt == EWBrt)) ((EWBop == ALUop) & (EXErt == EWBrd)) ); This signal controls the store vale that goes into the and E/WB register assign bypassafrome = (IDEXrs!= ) & ( ((EXEop ==LW) & (IDEXrs == EXErt)) ((EXEop == ALUop) & (IDEXrs == EXErd)) ); assign bypassafromwb = (IDEXrs!= ) & (!bypassafrome) & ( ((EWBop == LW) & (IDEXrs == EBrt)) ((EWBop == ALUop) & (IDEXrs == EBrd)) ):
12 2 Soltions for Chapter 6 Eercises 6.43 The branch cannot be resolved in ID stage if one branch operand is being calclated in EX stage (assme there is no dmb branch having two identical operands; if so, it is a jmp), or to be loaded (in EX and E). assign branchstallinid = (IFIDop == BEQ) & ( ((IDEXop == ALUop) & ((IFIDrs == IDEXrd) (IFIDrt == IDEXrd)) ) // al in EX ((IDEXop == LW) & ((IFIDrs == IDEXrt) (IFIDrt == IDEXrt)) ) // lw in EX ((EXEop == LW) & ((IFIDrs == EXErt) (IFIDrt == EXErt)) ) ); // lw in E Therefore, we can forward the reslt from an ALU instrction in E stage, and an ALU or lw in WB stage. assign bypassida = (EXEop == ALUop) & (IFIDrs == EXErd); assign bypassidb = (EXEop == ALUop) & (IFIDrt == EXErd); Ths, the operands of the branch become the following: assign IDAin = bypassida? EXEALUot : Regs[IFIDrs]; assign IDBin = bypassidb? EXEALUot : Regs[IFIDrt]; And the branch otcome becomes: assign takebranch = (IFIDop == BEQ) & (IDAin == IDBin); 6.44 For a delayed branch, the instrction following the branch will always be eected. We only need to pdate the PC after fetching this instrction. if(~stall) begin IFIDIR <= Iemory[PC]; PC <= PC+4; end; if(takebranch) PC <= PC + {6{IFIDIR[5]} +4; end;
13 Soltions for Chapter 6 Eercises modle PredictPC(crrentPC, netpc, miss, pdate, destination); inpt crrentpc, pdate, destination; otpt netpc, miss; integer inde, tag; //52 entries, direct-map reg[3:] brtargetbf[:5], brtargetbftag[:5]; inde = (crrentpc>>2) & 5; tag = crrentpc>>(2+9); if(pdate) begin //pdate the destination and tag brtargetbf[inde]=destination; brtargetbftag[inde]=tag; end; else if(tag==brtargetbftag[inde]) begin //a hit! netpc=brtargetbf[inde]; miss=false; end; else miss=true; endmodle; 6.46 No soltion provided Loop: lw $2, ($) lw $5, 4($) sb $4, $2, $3 sb $6, $5, $3 sw $4, ($) sw $6, 4($) addi $, $, 8 bne $, $3, Loop
14 4 Soltions for Chapter 6 Eercises 6.48 The code can be nrolled twice and reschedled. The leftover part of the code can be handled at the end. We will need to test at the beginning to see if it has reached the leftover part (other soltions are possible. Loop: addi $, $, 2 bgt $, $3, Leftover lw $2, 2($) lw $5, 8($) lw $7, 4($) sb $4, $2, $3 sb $6, $5, $3 sb $8, $7, $3 sw $4, 2($) sw $6, 8($) sw $8, 4($) bne $, $3, Loop jmp Finish Leftover: lw $2, 2($) sb $4, $2, $3 sw $4, 2($) addi $, $, 8 beq $, $3, Finish lw $5, 4($) sb $6, $5, $3 sw $6, 4($) Finish: al or branch lw/sw Loop: addi $2, $, lw $2, ($) lw $5, 4($) sb $4, $2, $3 lw $7, 8($) sb $6, $5, $3 lw $8, 2($) sb $, $7, $3 sw $4, ($) sb $2, $8, $3 sw $6, 4($) addi $, $, 6 sw $, 8($2) bne $, $3, Loop sw $2, 2($2) 6.5 The pipe stages added for wire delays do not prodce any sefl work. With imperfect pipelining de to pipeline overhead, the overhead associated with these stages redces throghpt. These etra stages increase the control logic compleity since more pipe stages need to be covered. When considering penalties for branches mispredictions, etc., adding more pipe stages increase penalties and eection latency. 6.5 No soltion provided.
TDT4255 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationPipelined Datapath. Reading. Sections Practice Problems: 1, 3, 8, 12
Pipelined Datapath Lecture notes from KP, H. H. Lee and S. Yalamanchili Sections 4.5 4. Practice Problems:, 3, 8, 2 ing Note: Appendices A-E in the hardcopy text correspond to chapters 7- in the online
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 informationPART I: Adding Instructions to the Datapath. (2 nd Edition):
EE57 Instrctor: G. Pvvada ===================================================================== Homework #5b De: check on the blackboard =====================================================================
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 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 informationEXAMINATIONS 2010 END OF YEAR NWEN 242 COMPUTER ORGANIZATION
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
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 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 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 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 informationPipelined Datapath. Reading. Sections Practice Problems: 1, 3, 8, 12 (2) Lecture notes from MKP, H. H. Lee and S.
Pipelined Datapath Lecture notes from KP, H. H. Lee and S. Yalamanchili Sections 4.5 4. Practice Problems:, 3, 8, 2 ing (2) Pipeline Performance Assume time for stages is ps for register read or write
More informationEXAMINATIONS 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 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 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 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 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 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 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 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 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 informationPipelining. Ideal speedup is number of stages in the pipeline. Do we achieve this? 2. Improve performance by increasing instruction throughput ...
CHAPTER 6 1 Pipelining Instruction class Instruction memory ister read ALU Data memory ister write Total (in ps) Load word 200 100 200 200 100 800 Store word 200 100 200 200 700 R-format 200 100 200 100
More informationLECTURE 9. Pipeline Hazards
LECTURE 9 Pipeline Hazards PIPELINED DATAPATH AND CONTROL In the previous lecture, we finalized the pipelined datapath for instruction sequences which do not include hazards of any kind. Remember that
More informationCS/CoE 1541 Exam 1 (Spring 2019).
CS/CoE 1541 Exam 1 (Spring 2019). Name: Question 1 (8+2+2+3=15 points): In this problem, consider the execution of the following code segment on a 5-stage pipeline with forwarding/stalling hardware and
More informationPipelined datapath Staging data. CS2504, Spring'2007 Dimitris Nikolopoulos
Pipelined datapath Staging data b 55 Life of a load in the MIPS pipeline Note: both the instruction and the incremented PC value need to be forwarded in the next stage (in case the instruction is a beq)
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 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 informationChapter 4. The Processor
Chapter 4 The Processor Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle time Determined by CPU hardware We will examine two MIPS implementations A simplified
More informationProcessor (II) - pipelining. Hwansoo Han
Processor (II) - pipelining Hwansoo Han Pipelining Analogy Pipelined laundry: overlapping execution Parallelism improves performance Four loads: Speedup = 8/3.5 =2.3 Non-stop: 2n/0.5n + 1.5 4 = number
More informationCOMP2611: Computer Organization. The Pipelined Processor
COMP2611: Computer Organization The 1 2 Background 2 High-Performance Processors 3 Two techniques for designing high-performance processors by exploiting parallelism: Multiprocessing: parallelism among
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 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 informationCOMPUTER ORGANIZATION AND DESIGN
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 4 The Processor Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle
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 informationPipelining Analogy. Pipelined laundry: overlapping execution. Parallelism improves performance. Four loads: Non-stop: Speedup = 8/3.5 = 2.3.
Pipelining Analogy Pipelined laundry: overlapping execution Parallelism improves performance Four loads: Speedup = 8/3.5 = 2.3 Non-stop: Speedup =2n/05n+15 2n/0.5n 1.5 4 = number of stages 4.5 An Overview
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. 5 th. Edition. Chapter 4. The Processor
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 4 The Processor Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle
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 informationProcessor Design Pipelined Processor (II) Hung-Wei Tseng
Processor Design Pipelined Processor (II) Hung-Wei Tseng Recap: Pipelining Break up the logic with pipeline registers into pipeline stages Each pipeline registers is clocked Each pipeline stage takes one
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 informationThe Processor (3) Jinkyu Jeong Computer Systems Laboratory Sungkyunkwan University
The Processor (3) Jinkyu Jeong (jinkyu@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu EEE3050: Theory on Computer Architectures, Spring 2017, Jinkyu Jeong (jinkyu@skku.edu)
More informationPipelining: Basic Concepts
Pipelining: Basic Concepts Prof. Cristina Silvano Dipartimento di Elettronica e Informazione Politecnico di ilano email: silvano@elet.polimi.it Outline Reduced Instruction Set of IPS Processor Implementation
More informationFull Datapath. Chapter 4 The Processor 2
Pipelining Full Datapath Chapter 4 The Processor 2 Datapath With Control Chapter 4 The Processor 3 Performance Issues Longest delay determines clock period Critical path: load instruction Instruction memory
More informationChapter 4 The Processor 1. Chapter 4B. The Processor
Chapter 4 The Processor 1 Chapter 4B The Processor Chapter 4 The Processor 2 Control Hazards Branch determines flow of control Fetching next instruction depends on branch outcome Pipeline can t always
More informationPipeline Hazards. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University
Pipeline Hazards Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Hazards What are hazards? Situations that prevent starting the next instruction
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 informationLecture 8: Data Hazard and Resolution. James C. Hoe Department of ECE Carnegie Mellon University
18 447 Lecture 8: Data Hazard and Resolution James C. Hoe Department of ECE Carnegie ellon University 18 447 S18 L08 S1, James C. Hoe, CU/ECE/CALC, 2018 Your goal today Housekeeping detect and resolve
More informationECEC 355: Pipelining
ECEC 355: Pipelining November 8, 2007 What is Pipelining Pipelining is an implementation technique whereby multiple instructions are overlapped in execution. A pipeline is similar in concept to an assembly
More informationLecture Topics. Announcements. Today: Data and Control Hazards (P&H ) Next: continued. Exam #1 returned. Milestone #5 (due 2/27)
Lecture Topics Today: Data and Control Hazards (P&H 4.7-4.8) Next: continued 1 Announcements Exam #1 returned Milestone #5 (due 2/27) Milestone #6 (due 3/13) 2 1 Review: Pipelined Implementations Pipelining
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 informationCOMPUTER ORGANIZATION AND DESIGN
COMPUTER ORGANIZATION AND DESIGN 5 Edition th The Hardware/Software Interface Chapter 4 The Processor 4.1 Introduction Introduction CPU performance factors Instruction count CPI and Cycle time Determined
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 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 Lecture 13/14 In Class Handout For all of these problems: HAS NOT CANNOT Add Add Add must wait until $5 written by previous add;
CSE 30321 Lecture 13/14 In Class Handout For the sequence of instructions shown below, show how they would progress through the pipeline. For all of these problems: - Stalls are indicated by placing the
More informationCSEE 3827: Fundamentals of Computer Systems
CSEE 3827: Fundamentals of Computer Systems Lecture 21 and 22 April 22 and 27, 2009 martha@cs.columbia.edu Amdahl s Law Be aware when optimizing... T = improved Taffected improvement factor + T unaffected
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 informationAssignment 1 solutions
Assignment solutions. The jal instruction does a jump identical to the j instruction (i.e., replacing the low order 28 bits of the with the ress in the instruction) and also writes the value of the + 4
More informationQuestion 1: (20 points) For this question, refer to the following pipeline architecture.
This is the Mid Term exam given in Fall 2018. Note that Question 2(a) was a homework problem this term (was not a homework problem in Fall 2018). Also, Questions 6, 7 and half of 5 are from Chapter 5,
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 informationLecture 3: The Processor (Chapter 4 of textbook) Chapter 4.1
Lecture 3: The Processor (Chapter 4 of textbook) Chapter 4.1 Introduction Chapter 4.1 Chapter 4.2 Review: MIPS (RISC) Design Principles Simplicity favors regularity fixed size instructions small number
More informationSI232 Set #20: Laundry, Co-dependency, and other Hazards of Modern (Architecture) Life. Chapter 6 ADMIN. Reading for Chapter 6: 6.1,
SI232 Set #20: Laundry, Co-dependency, and other Hazards of Modern (Architecture) Life Chapter 6 ADMIN ing for Chapter 6: 6., 6.9-6.2 2 Midnight Laundry Task order A 6 PM 7 8 9 0 2 2 AM B C D 3 Smarty
More informationLECTURE 3: THE PROCESSOR
LECTURE 3: THE PROCESSOR Abridged version of Patterson & Hennessy (2013):Ch.4 Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle time Determined by CPU
More informationCS232 Final Exam May 5, 2001
CS232 Final Exam May 5, 2 Name: This exam has 4 pages, including this cover. There are six questions, worth a total of 5 points. You have 3 hours. Budget your time! Write clearly and show your work. State
More informationCS/CoE 1541 Mid Term Exam (Fall 2018).
CS/CoE 1541 Mid Term Exam (Fall 2018). Name: Question 1: (6+3+3+4+4=20 points) For this question, refer to the following pipeline architecture. a) Consider the execution of the following code (5 instructions)
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 informationFull Datapath. Chapter 4 The Processor 2
Pipelining Full Datapath Chapter 4 The Processor 2 Datapath With Control Chapter 4 The Processor 3 Performance Issues Longest delay determines clock period Critical path: load instruction Instruction memory
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 informationCSE 2021 Computer Organization. Hugh Chesser, CSEB 1012U W12-M
CSE 22 Computer Organization Hugh Chesser, CSEB 2U W2- Graphical Representation Time 2 6 8 add $s, $t, $t IF ID E E Decode / Execute emory Back fetch from / stage into the instruction register file. Shading
More informationStatic, multiple-issue (superscaler) pipelines
Static, multiple-issue (superscaler) pipelines Start more than one instruction in the same cycle Instruction Register file EX + MEM + WB PC Instruction Register file EX + MEM + WB 79 A static two-issue
More informationComputer Organization and Structure. Bing-Yu Chen National Taiwan University
Computer Organization and Structure Bing-Yu Chen National Taiwan University The Processor Logic Design Conventions Building a Datapath A Simple Implementation Scheme An Overview of Pipelining Pipelined
More informationDEE 1053 Computer Organization Lecture 6: Pipelining
Dept. Electronics Engineering, National Chiao Tung University DEE 1053 Computer Organization Lecture 6: Pipelining Dr. Tian-Sheuan Chang tschang@twins.ee.nctu.edu.tw Dept. Electronics Engineering National
More informationProcessor Design CSCE Instructor: Saraju P. Mohanty, Ph. D. NOTE: The figures, text etc included in slides are borrowed
Lecture 3: General Purpose Processor Design CSCE 665 Advanced VLSI Systems Instructor: Saraju P. ohanty, Ph. D. NOTE: The figures, tet etc included in slides are borrowed from various books, websites,
More information1 Hazards COMP2611 Fall 2015 Pipelined Processor
1 Hazards Dependences in Programs 2 Data dependence Example: lw $1, 200($2) add $3, $4, $1 add can t do ID (i.e., read register $1) until lw updates $1 Control dependence Example: bne $1, $2, target add
More informationCSEN 601: Computer System Architecture Summer 2014
CSEN 601: Computer System Architecture Summer 2014 Practice Assignment 5 Solutions Exercise 5-1: (Midterm Spring 2013) a. What are the values of the control signals (except ALUOp) for each of the following
More informationCOMPUTER ORGANIZATION AND DESIGN. 5 th Edition. The Hardware/Software Interface. Chapter 4. The Processor
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 4 The Processor Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle
More informationDepartment of Computer and IT Engineering University of Kurdistan. Computer Architecture Pipelining. By: Dr. Alireza Abdollahpouri
Department of Computer and IT Engineering University of Kurdistan Computer Architecture Pipelining By: Dr. Alireza Abdollahpouri Pipelined MIPS processor Any instruction set can be implemented in many
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 informationECE260: Fundamentals of Computer Engineering
Data Hazards in a Pipelined Datapath James Moscola Dept. of Engineering & Computer Science York College of Pennsylvania Based on Computer Organization and Design, 5th Edition by Patterson & Hennessy Data
More information