On This Page

This set of High Performance Computing HPC Multiple Choice Questions & Answers (MCQs) focuses on High Performance Computing Set 5

Q1 | In a broadcast and reduction on a balanced binary tree reduction is done in ______
  • recursive order
  • straight order
  • vertical order
  • parallel order
Q2 | if "X" is the message to broadcast it initially resides at the source node
  • 1
  • 2
  • 8
Q3 | logical operators used in algorithm are
  • xor
  • and
  • both
  • none
Q4 | Generalization of broadcast in Which each processor is
  • source as well as destination
  • only source
  • only destination
  • none
Q5 | The algorithm terminates in _____ steps
  • p
  • p+1
  • p+2
  • p-1
Q6 | Each node first sends to one of its neighbours the data it need to....
  • broadcast
  • identify
  • verify
  • none
Q7 | The second communication phase is a columnwise ______ broadcast of consolidated
  • all-to-all
  • one -to-all
  • all-to-one
  • point-to-point
Q8 | All nodes collects _____ message corresponding to √p nodes to their respectively
  • √p
  • p
  • p+1
  • p-1
Q9 | It is not possible to port ____ for higher dimensional network
  • algorithm
  • hypercube
  • both
  • none
Q10 | If we port algorithm to higher dimemsional network it would cause
  • error
  • contention
  • recursion
  • none
Q11 | In the scatter operation ____ node send message to every other node
  • single
  • double
  • triple
  • none
Q12 | The gather Operation is exactly the inverse of _____
  • scatter operation
  • recursion operation
  • execution
  • none
Q13 | Similar communication pattern to all-to-all broadcast except in the_____
  • reverse order
  • parallel order
  • straight order
  • vertical order
Q14 | Group communication operations are built using which primitives?
  • one to all
  • all to all
  • point to point
  • none of these
Q15 | ___ can be performed in an identical fashion by inverting the process.
  • recursive doubling
  • reduction
  • broadcast
  • none of these
Q16 | Broadcast and reduction operations on a mesh is performed
  • along the rows
  • along the columns
  • both a and b concurrently
  • none of these
Q17 | Cost Analysis on a ring is
  • (ts + twm)(p - 1)
  • (ts - twm)(p + 1)
  • (tw + tsm)(p - 1)
  • (tw - tsm)(p + 1)
Q18 | Cost Analysis on a mesh is
  • 2ts(sqrt(p) + 1) + twm(p - 1)
  • 2tw(sqrt(p) + 1) + tsm(p - 1)
  • 2tw(sqrt(p) - 1) + tsm(p - 1)
  • 2ts(sqrt(p) - 1) + twm(p - 1)
Q19 | Communication between two directly link nodes
  • cut-through routing
  • store-and-forward routing
  • nearest neighbour communication
  • none
Q20 | All-to-one communication (reduction) is the dual of ______ broadcast.
  • all-to-all
  • one-to-all
  • one-to-one
  • all-to-one
Q21 | Which is known as Reduction?
  • all-to-one
  • all-to-all
  • one-to-one
  • one-to-all
Q22 | Which is known as Broadcast?
  • one-to-one
  • one-to-all
  • all-to-all
  • all-to-one
Q23 | The dual of all-to-all broadcast is
  • all-to-all reduction
  • all-to-one reduction
  • both
  • none
Q24 | All-to-all broadcast algorithm for the 2D mesh is based on the
  • linear array algorithm
  • ring algorithm
  • both
  • none
Q25 | In the first phase of 2D Mesh All to All, the message size is ___
  • p
  • m*sqrt(p)
  • m
  • p*sqrt(m)