proof of Amdahl’s Law
Suppose an algorithm needs operations to compute the result. With 1 processor, the algorithm will take time units. With processors, the parallelizable operations will take time units and the remaining non parallelizable operations will take time units for a total running time of time units. So the speedup is .
|Title||proof of Amdahl’s Law|
|Date of creation||2013-03-22 13:10:36|
|Last modified on||2013-03-22 13:10:36|
|Last modified by||lieven (1075)|