Scribd
Upload
4 views

Computer Architecture_Lect 6

Amdahl's law describes the limitations of performance enhancement based on the usage of improved features, particularly in parallel computing. It provides a formula to calculate the theoretical speedup of a system when certain resources are enhanced, factoring in the fraction of the task that can utilize the improvement. The law emphasizes that the overall speedup is constrained by the portion of the task that can benefit from the enhancement.

Uploaded by

s.z.elahimodelschool
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views

Computer Architecture_Lect 6

Amdahl's law describes the limitations of performance enhancement based on the usage of improved features, particularly in parallel computing. It provides a formula to calculate the theoretical speedup of a system when certain resources are enhanced, factoring in the fraction of the task that can utilize the improvement. The law emphasizes that the overall speedup is constrained by the portion of the task that can benefit from the enhancement.

Uploaded by

s.z.elahimodelschool
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

COMPUTER

ARCHITECTURE
CS-353
Lecture 6
Amdahl’s law
◦ A rule stating that the performance enhancement possible with a given
improvement is limited by the amount that the improved feature is used. It is a
quantitative version of the law of diminishing returns.
Amdahl’s law
◦ It is a formula that gives the theoretical speedup in latency of the execution of a
task at a fixed workload that can be expected of a system whose resources are
improved.
◦ In other words, it is a formula used to find the maximum improvement possible by
just improving a particular part of a system. It is often used in parallel computing to
predict the theoretical speedup when using multiple processors.
◦ Speedup- Speedup is defined as the ratio of performance for the entire task using
the enhancement and performance for the entire task without using the
enhancement or speedup can be defined as the ratio of execution time for the
entire task without using the enhancement and execution time for the entire task
using the enhancement.
Amdahl’s law
◦ If Pe is the performance for the entire task using the enhancement when
possible, Pw is the performance for the entire task without using the
enhancement, Ew is the execution time for the entire task without using the
enhancement and Ee is the execution time for the entire task using the
enhancement when possible then, Speedup = Pe/Pw or Speedup =
Ew/Ee Amdahl’s law uses two factors to find speedup from some enhancement:
Amdahl’s law
◦ Fraction enhanced – The fraction of the computation time in the original
computer that can be converted to take advantage of the enhancement. For
example- if 10 seconds of the execution time of a program that takes 40 seconds in
total can use an enhancement, the fraction is 10/40. This obtained value is Fraction
Enhanced. Fraction enhanced is always less than 1.
◦ Speedup enhanced – The improvement gained by the enhanced execution mode;
that is, how much faster the task would run if the enhanced mode were used for the
entire program. For example – If the enhanced mode takes, say 3 seconds for a
portion of the program, while it is 6 seconds in the original mode, the improvement
is 6/3. This value is Speedup enhanced. Speedup Enhanced is always greater than
1.
Amdahl’s law
Problem

You might also like