Suppose that a big, sequential program requires 1,688 seconds to execute on a uniprocessor. A team of programmers partitions the computation into 15 separate computations (called C₀, C₁, ?, C₁₄). In this partition, C₀ has to run by itself to initialize the computation. C₁₃ is error handling code. C_14?prints the results, deallocates dynamic data structures, and then terminates the computation. The others all run at the same time. Using the same data set as was processed by the big, sequential program, the distributed computation was executed on a collection of 16 machines on a network. The resulting execution times are shown in the following table. What is the speedup for this computation?

Transcribed Image Text:

Computation Execution Time Co 22 C1 161 C2 153 Сз 99 C4 100 Cs 133 Св 151 Ст 164 Св 159 C9 196 Cio 142 Си 131 C12 163 С1з C14 36