Q.

Domain Decomposition

A. Partitioning in that the data associated with a problem is decompose(D) Each parallel task then works on a portion of the dat(A)
B. Partitioning in that, the focus is on the computation that is to be performed rather than on the data manipulated by the computation. The problem is decomposed according to the work that must be done. Each task then performs a portion of the overall work.
C. It is the time it takes to send a minimal (0 byte) message from point A to point (B)
D. None of these
Answer» A. Partitioning in that the data associated with a problem is decompose(D) Each parallel task then works on a portion of the dat(A)
601
0
Do you find this helpful?
2

View all MCQs in

Parallel Computing

Discussion

No comments yet