Speedup obtained when the problem size is _______ linearly with the number of processing elements.
A) increase
B) constant
C) decreases
D) depend on problem size
Correct Answer:
Verified
Q1: Scaling Characteristics of Parallel Programs Ts is
A)increase
B)constant
C)decreases
D)none
Q2: Speedup tends to saturate and efficiency _
Q4: The n × n matrix is partitioned
Q5: cost-optimal parallel systems have an efficiency of
Q6: The n × n matrix is partitioned
Q7: how many basic communication operations are used
Q8: In DNS algorithm of matrix multiplication it
Q9: In the Pipelined Execution, steps contain
A)normalization
B)communication
C)elimination
D)all
Q10: the cost of the parallel algorithm is
Q11: The load imbalance problem in Parallel Gaussian
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents