• closed by
601 views
0 0 votes
closed with the note: Answer satisfactory
Given 100 instructions executed on a 5 stage pipeline . probability (p) that an instruction is branch is p. Branch penalty 4.Assuming that each stage of pipeline takes 1 cycle.Calculate total execution time. My query is since first instruction will  take 5 clk so how  to calculate ?  is 5+ 99[(1-p)*1 + p*4] the correct approach ?
Position:
Show:

Related questions

1 1 vote
4 answers 4 answers
5.3k
5.3k views
Hemant Parihar asked Nov 15, 2017
5,345 views
Suppose that a task makes extensive use of floating point operations with 40% of the time is consumed by floating point operations. With a new hardware design, the floati...
79 79 votes
11 answers 11 answers
33.9k
33.9k views
go_editor asked Sep 28, 2014
33,886 views
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is exec...
199 199 votes
9 answers 9 answers
78.7k
78.7k views
Kathleen asked Sep 22, 2014
78,742 views
A $5$ stage pipelined CPU has the following sequence of stages:IF – instruction fetch from instruction memoryRD – Instruction decode and register readEX – Execute: ALU op...
74 74 votes
4 answers 4 answers
35.9k
35.9k views
Kathleen asked Sep 12, 2014
35,860 views
Which of the following are NOT true in a pipelined processor?Bypassing can handle all RAW hazardsRegister renaming can eliminate all register carried WAR hazardsControl h...