Top 250+ Solved High Performance Computing (HPC) MCQ Questions Answer
Q. all processes that have the data can send it again is
a. recursive doubling
b. naive approach
c. reduction
d. all
Q. accumulate results and send with the same pattern is...
a. broadcast
b. naive approach
c. recursive doubling
d. reduction symmetric
Q. every node on the linear array has the data and broadcast on the columns with the linear array algorithm in _____
a. parallel
b. vertical
c. horizontal
d. all
Q. using different links every time and forwarding in parallel again is
a. better for congestion
b. better for reduction
c. better for communication
d. better for algorithm
Q. In a balanced binary tree processing nodes is equal to
a. leaves
b. number of elemnts
c. branch
d. none
Q. In one -to- all broadcast there is
a. divide and conquer type algorithm
b. sorting type algorithm
c. searching type algorithm
d. simple algorithm
Q. Nides with zero in i least significant bits participate in _______
a. algorithm
b. broadcast
c. communication
d. searching
Q. every node has to know when to communicate that is
a. call the procedure
b. call for broadcast
c. call for communication
d. call the congestion
Q. the procedure is disturbed and require only point-to-point _______
a. synchronization
b. communication
c. both
d. none
Q. Task dependency graph is ------------------
a. directed
b. undirected
c. directed acyclic
d. undirected acyclic
Q. In task dependency graph longest directed path between any pair of start and finish node is called as --------------
a. total work
b. critical path
c. task path
d. task length
Q. which of the following is not a granularity type
a. course grain
b. large grain
c. medium grain
d. fine grain