Speedup in A Sequential Program
The maximum speedup in an improved sequential program, where some part was sped up times is limited by inequality
where is the fraction of time (before the improvement) spent in the part that was not improved. For example (see picture on right):
- If part B is made five times faster, and, then
- If part A is made to run twice as fast, and, then
Therefore, making A twice as fast is better than making B five times faster. The percentage improvement in speed can be calculated as
- Improving part A by a factor of two will increase overall program speed by a factor of 1.6, which makes it 37.5% faster than the original computation.
- However, improving part B by a factor of five, which presumably requires more effort, will only achieve an overall speedup factor of 1.25, which makes it 20% faster.
Read more about this topic: Amdahl's Law
Famous quotes containing the word program:
“Hast ever ben in Omaha
Where rolls the dark Missouri down,
Where four strong horses scarce can draw
An empty wagon through the town?
Where sand is blown from every mound
To fill your eyes and ears and throat;
Where all the steamboats are aground,
And all the houses are afloat?...
If not, take heed to what I say,
You’ll find it just as I have found it;
And if it lies upon your way
For God’s sake, reader, go around it!”
—For the State of Nebraska, U.S. public relief program (1935-1943)