Which of these is not a source of overhead in parallel computing? – McqOptions

MCQOPTIONS

1.	Which of these is not a source of overhead in parallel computing?
A.	non-uniform load distribution
B.	less local memory requirement in distributed computing
C.	synchronization among threads in shared memory computing
D.	none of the above
Answer» C. synchronization among threads in shared memory computing

Discussion

No Comment Found

Related MCQs

Which of following is NOT A WAY of mapping the input wires of the bitonicsorting network to a MESH of processes
The time taken by all-to- all broadcast on a mesh is.
The n × n matrix is partitioned among n2 processors such that each processor owns a _____ element.
In all-to-one reduction, data items must be combined piece-wise and the result made available at a processor.
All-to-All Broadcast and Reduction algorithm on a Ring terminates in steps.
The time taken by all-to- all broadcast on a ring is.
The complexity of bubble sort is Θ(n2).
In All-to-All Personalized Communication on a Ring, the size of the message reduces by at each step
The n × n matrix is partitioned among n processors, with each processor storing complete ___ of the matrix.
Systems that do not have parallel processing capabilities are