: A theoretical "Parallel Random Access Machine" used to design and analyze algorithms in an idealized environment. Practical Algorithm Design
To counter the pessimism of Amdahl, Quinn introduces Gustafson’s Law. $$ S(n) = n - (1-n)(1-f) $$ Instead of keeping the problem size fixed and adding processors, Gustafson suggests keeping the time fixed and increasing the problem size. Quinn’s Analysis: This is the theoretical justification for supercomputing. As we add processors, we should solve larger problems, not just solve the same problem faster. This makes high parallel efficiency achievable. Parallel Computing Theory And Practice Michael J Quinn Pdf