Multiple Choice
The length of the longest path in a task dependency graph is called?
A) the critical path length
B) the critical data length
C) the critical bit length
D) none of above
Correct Answer:
Verified
Correct Answer:
Verified
Q9: _ is a method for inducing concurrency
Q10: Speculative Decomposition consist of _?<br>A)conservative approaches<br>B)optimistic approaches<br>C)both
Q11: Parallel Algorithm Models?<br>A)data parallel model<br>B)bit model<br>C)data model<br>D)network
Q12: Multiprocessor is systems with multiple CPUs, which
Q13: Writing parallel programs is referred to as?<br>A)parallel
Q15: task characteristics include?<br>A)task generation.<br>B)task sizes.<br>C)size of data
Q16: The number of tasks into which a
Q17: Mappings are determined by?<br>A)task dependency<br>B)task interaction graphs<br>C)both
Q18: The number and size of tasks into
Q19: Speed up is defined as a ratio