In a 1967 paper in the AFIPS Conference Proceedings, Gene Amdahl analyzed how much faster a computer system can become when some work remains sequential. The result, later labeled Amdahl's Law, shows that overall speedup is bounded by the fraction of work that cannot be parallelized, even if the parallel portion becomes arbitrarily fast, as documented in the reprint hosted by
Stony Brook University.