This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 2 years, 6 months ago.

• Author
Posts
EduGorilla
Keymaster
Select Question Language :

Consider the instruction sequence of length n is executing in a pipelined processor with k stages. Let µrepresent the stage delay in microseconds for each of the k stages. Let p be the probability that an instruction is branch instruction, either conditional or unconditional and q be the probability that execution of a particular branch instruction causes jump to non-consecutive address. Then what will be the time required to execute the following instruction sequence using pipelined processor?

### Options :-

1. T= pqnk µ+ (1- pq)(k+ n-1) µ
2. T= pqn µ+ (1- pq)(k+ n-1) µ
3. T= pqn µ+ (1-pq)(k+ n) µ
4. None of these.
Are You looking institutes / coaching center for
• IIT-JEE, NEET, CAT
• Bank PO, SSC, Railways
Select your Training / Study category
Reply To: Consider the instruction sequence of length n is executing in a pipelined processor with k stages. L….

Verify Yourself