Abstract
The author examines Amdahl's law in the context of parallel processing and provides some arguments as to what the applicability of this law really is. Amdahl's law establishes an upper bound on the available parallelism given the fraction of sequential code present in an application. In this paper, Amdahl's law is revisited to derive a formulation which allows one to carry out some quantitative analysis. The claim that MPPs (massively parallel processors) are special-purpose systems is also addressed. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
