Number of stages in pipeline = 6
branch decision is known in stage S5
(1)Stall-on-branch;outcome is taken = 4
(2)Stall-on-branch;outcome is untaken = 4
(3)Predict branch untaken;outcome is taken = 4
(4)Predict branch untaken;outcome is untaken = 0
Computer architecture Question 14 A pipelined datapath has 6 stages shown below. The branch decision is...
Computer architecture n Question 37 The pipelined datapath we studied is called the rigid pipeline. What are its shortcomings? (check all that are true) It is limited to IPC-1 (Instruction Per Cycle) There's only one instruction in the datapath at any moment It cannot do out-of-order execution O Data dependences must be resolved by the compiler A stall propagates to earlier stages
Computer architecture n Question 11 This code runs on the five-stage pipelined datapath we studied. add to, ti, t3 sub t3, te, t4 or ts, to, t6 Forwarding is available: MEM->EX and WB->EX. Analyze the following dependences and determine the action needed. add/sub on t3 [Choose) Forward MEM-->ID Forward WB-->ID Forward WB-->EX Forward MEM-->EX No forwarding needed add/sub on to add/or on to Choose)
Computer Architecture 14. Fill in the blanks below with the most appropriate term or concept discussed in this chapter: A. ---------------The time required for the first result in a series of computations to emerge from a pipeline. B. ---------------This is used to separate one stage of a pipeline from the next. C. ---------------Over time, this tells the mean number of operations completed by a pipeline per clock cycle. D. ---------------The clock cycles that are wasted by an instruction-pipelined processor due...