Exam 7: Parallel Computing and Graph Algorithms

every node has to know when to communicate that is

Topological sort can be applied to which of the following graphs?

threads being block altogether and being executed in the sets of 32 threads called a

In most of the cases, topological sort starts from a node which has __________

In this decomposition problem decomposition goes hand in hand with its execution

A good mapping does not depends on which following factor

he threads in a thread block are distributed across SM units so that each thread is executed by one SM unit.

What is a high performance multi-core processor that can be used to accelerate a wide variety of applications using parallel computing.

which of the following is not the array distribution method of data partitioning

When the topological sort of a graph is unique?

CUDA is a parallel computing platform and programming model 

Renaming relative to the source is _____ the source.

Task dependency graph is ------------------

blocking optimization is used to improve temmporal locality for reduce

which of the following is a an example of data decomposition

which of the following is not a granularity type

In ------------task are defined before starting the execution of the algorithm

Topological sort of a Directed Acyclic graph is?

which problems can be handled by recursive decomposition

the procedure is disturbed and require only point-to-point _______