Multiple Choice
What is Critical Path?
A) the length of the longest path in a task dependency graph is called the critical path length.
B) the length of the smallest path in a task dependency graph is called the critical path length.
C) path with loop
D) none of the mentioned.
Correct Answer:
Verified
Correct Answer:
Verified
Q9: The time taken by all-to- all broadcast
Q10: The number and size of tasks into
Q11: In All-to-All Personalized Communication on a Ring,
Q12: Which of the following method is used
Q13: Which is alternative options for latency hiding?<br>A)increase
Q15: The time taken by all-to- all broadcast
Q16: Which decompositioin technique uses divide-andconquer strategy?<br>A)recursive decomposition<br>B)sdata
Q17: Scatter is _.<br>A)one to all broadcast communication<br>B)all
Q18: In All-to-all Broadcast on a Mesh, operation
Q19: All-to-All Broadcast and Reduction algorithm on a