A scalar pipeline has 4 pipeline stages A, B, C, D. An operand entering this pipeline must be processed by the four units A-> B -> C -> D. Suppose that units A, B , D takes 2 ns to process an operand, and unit C takes 3 ns to process an operand. How many ns does it take for this scalar pipeline to process 1000 independent operations?

Respuesta :

Answer:

The answer is "3006 ns"

Step-by-step explanation:

The time is taken by [tex]a,b, D = 2\ ns[/tex]

taking time [tex]= 3 \ ns[/tex]

first taking time [tex]= 2\times 3+3= 6+3=9[/tex]

Calculating the Rest taking 3 ns to process

For 1000:

[tex]= 9+ 3\times 999\\\\= 9+2997\\\\=3006\ ns[/tex]