COMPUTER SCIENCE AND ENGINEERING
COMPUTER ARCHITECTURE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Speedup is limited by sequential fraction of the program
|
|
|
There are no any speedup limitation
|
|
|
Speedup increase linearly with the numbers of used processors
|
|
|
No correct answer
|
Detailed explanation-1: -Gustafson’s law argues that a fourfold increase in computing power would instead lead to a similar increase in expectations of what the system will be capable of. If the one-minute load time is acceptable to most users, then that is a starting point from which to increase the features and functions of the system.
Detailed explanation-2: -Gustafson’s law and weak scaling If a problem only requires a small amount of resources, it is not beneficial to use a large amount of resources to carry out the computation. A more reasonable choice is to use small amounts of resources for small problems and larger quantities of resources for big problems.
Detailed explanation-3: -The theoretical speedup of the latency of the execution of a program as a function of the number of processors executing it, according to Amdahl’s law. The speedup is limited by the serial part of the program.
Detailed explanation-4: -b) Now assume that the parallel work per processor is fixed. Compute the speed-up when using 2 and 4 processors according to Gustafson’s law. Answer: Gustafson’s Law says: Sp = p − f(p − 1)