COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Parallel algorithms will only have portions of the algorithm that are parallel with no sequential portions
|
|
|
Running the algorithm on more computers can speed up the parallel portions
|
|
|
Sequential portions are not sped up by adding more computers
|
|
|
The sequential portion of the algorithm will eventually put a limit on the overall speedup
|
Detailed explanation-1: -The speedup of a parallel algorithm will eventually reach some limit because the speedup is never equal to the number of processors and eventually the parallel algorithm will not increase in time and the speedup will limit out. any algorithm whose efficacy grows at a constant amount.
Detailed explanation-2: -Speedup. The speedup of a parallel algorithm over a corresponding sequential algorithm is the ratio of the compute time for the sequential algorithm to the time for the parallel algorithm. If the speedup factor is n, then we say we have n-fold speedup.
Detailed explanation-3: -Which of the following is true about parallel computing performance? Computations use multiple processors. There is an increase in speed. The increase in speed is loosely tied to the number of processor or computers used.
Detailed explanation-4: -In computer architecture, Amdahl’s law (or Amdahl’s argument) is a formula which gives the theoretical speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved.