Pipeline and Vector Processing Q.6

  • Option : B
  • Explanation : Total execution time = (k + n – 1) * maximum clock cycle
    Where k = total number of stages and n = total number of instructions
    For D1 :
    k = 5 and n = 100
    Maximum clock cycle = 4ns
    Total execution time = (5 + 100 – 1) * 4 = 416
    For D2 :
    k = 8 and n = 100
    Each clock cycle = 2ns Total execution time = (8 + 100 – 1) * 2 = 214
    Thus, time saved using D2 over D1
    = 416 – 214
    = 202
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *