What are the algorithms for identifying which subtrees we assign to th – McqOptions

MCQOPTIONS

1.	What are the algorithms for identifying which subtrees we assign to the processes or threads __________
A.	breadth-first search
B.	depth-first search
C.	depth-first search breadth-first search
D.	None of the above
Answer» D. None of the above

Discussion

No Comment Found

Related MCQs

When number of switch ports is equal to or larger than number of devices, this simple network is referred to as ______________
Which MIMD systems are best scalable with respect to the number of processors?
Alternative way of a snooping-based coherence protocol, is called a ____________
Requesting node sending the requested data starting from the memory, and the requestor which has made the only sharing node, known as ________.
A processor performing fetch or decoding of different instruction during the execution of another instruction is called ______.
MPI provides a function ________, for packing data into a buffer of contiguous memory.
Which of the following is not valid with reference to Message Passing Interface (MPI)?
Each node of the tree has an_________________ , that is, the cost of the partial tour.
An _____________ is a program that finds the solution to an n-body problem by simulating the behavior of the particles.
Parallelizing the two n-body solvers using _______________ is very similar to parallelizing them using OpenMP.