Amdahl's Law
A law in computer science describing the speedup achievable through parallel computation, stating that the sequential portion of a program imposes an upper bound on the performance gains attainable through parallelization.
Timeline (last 90 days)
The two researchers use Amdahl's law to judge the speedup limits of RSI: if the digitalized portion accounts for only 20% of the overall process, then even optimizing it to zero makes the whole only 20% faster; fields such as drug discovery and robotics are constrained by wet labs and the physical world, and RSI speedups get stuck on the slowest serial component.
Amdahl's law was proposed by Gene Amdahl in 1967 to describe the theoretical upper limit of speedup in parallel computing: if a portion of a program has proportion p and cannot be accelerated, the overall speedup is at most 1/(p+(1-p)/s), where s is the speedup factor achievable for that portion.
Amdahl's Law was proposed by computer scientist Gene Amdahl in 1967, stating that the speedup gained from parallelization is limited by the proportion of the task that cannot be parallelized.
If 80% of the work in a project can be parallelized, the theoretical maximum speedup according to Amdahl's Law is only 5x.
Amdahl's Law states that the speedup from parallelization is limited by the proportion of the task that cannot be parallelized; if 80% of the work can be parallelized, the theoretical maximum speedup is only 5×.
All Facts (5)
Amdahl's Law states that the speedup from parallelization is limited by the proportion of the task that cannot be parallelized; if 80% of the work can be parallelized, the theoretical maximum speedup is only 5×.
60%UnverifiedThe two researchers use Amdahl's law to judge the speedup limits of RSI: if the digitalized portion accounts for only 20% of the overall process, then even optimizing it to zero makes the whole only 20% faster; fields such as drug discovery and robotics are constrained by wet labs and the physical world, and RSI speedups get stuck on the slowest serial component.
50%UnverifiedAmdahl's law was proposed by Gene Amdahl in 1967 to describe the theoretical upper limit of speedup in parallel computing: if a portion of a program has proportion p and cannot be accelerated, the overall speedup is at most 1/(p+(1-p)/s), where s is the speedup factor achievable for that portion.
50%UnverifiedAmdahl's Law was proposed by computer scientist Gene Amdahl in 1967, stating that the speedup gained from parallelization is limited by the proportion of the task that cannot be parallelized.
50%UnverifiedIf 80% of the work in a project can be parallelized, the theoretical maximum speedup according to Amdahl's Law is only 5x.
50%