Question: Derive the formula for the total execution time of Problem 10.13 using a pipeline of M stages, with each stage requiring T ns.
Assume that the arrays have N elements each.
Problem: It is required to compute Ci = Ai + Bi (i = 1- 50), where A, B, and C are arrays of floating-point numbers, using a six-stage add pipeline.
- Assume that each stage requires 15 ns. What is the total computation time?