On This Page
This set of High Performance Computing HPC Multiple Choice Questions & Answers (MCQs) focuses on High Performance Computing Set 6
Q1 | In the second phase of 2D Mesh All to All, the message size is ___
- m
- p*sqrt(m)
- p
- m*sqrt(p)
Q2 | In All to All on Hypercube, The size of the message to be transmitted at the next step is ____ by concatenating the received message with their current data
- doubled
- tripled
- halfed
- no change
Q3 | The all-to-all broadcast on Hypercube needs ____ steps
- p
- sqrt(p) - 1
- log p
- none
Q4 | One-to-All Personalized Communication operation is commonly called ___
- gather operation
- concatenation
- scatter operation
- none
Q5 | The dual of the scatter operation is the
- concatenation
- gather operation
- both
- none
Q6 | In Scatter Operation on Hypercube, on each step, the size of the messages communicated is ____
- tripled
- halved
- doubled
- no change
Q7 | Which is also called "Total Exchange" ?
- all-to-all broadcast
- all-to-all personalized communication
- all-to-one reduction
- none
Q8 | All-to-all personalized communication can be used in ____
- fourier transform
- matrix transpose
- sample sort
- all of the above
Q9 | In collective communication operations, collective means
- involve group of processors
- involve group of algorithms
- involve group of variables
- none of these
Q10 | efficiency of data parallel algorithm depends on the
- efficient implementation of the algorithm
- efficient implementation of the operation
- both
- none
Q11 | All processes participate in a single ______ interaction operation.
- global
- local
- wide
- variable
Q12 | subsets of processes in ______ interaction.
- global
- local
- wide
- variable
Q13 | Goal of good algorithm is to implement commonly used _____ pattern.
- communication
- interaction
- parallel
- regular
Q14 | Reduction can be used to find the sum, product, maximum, minimum of _____ of numbers.
- tuple
- list
- sets
- all of above
Q15 | source ____ is bottleneck.
- process
- algorithm
- list
- tuple
Q16 | only connections between single pairs of nodes are used at a time is
- good utilization
- poor utilization
- massive utilization
- medium utilization
Q17 | all processes that have the data can send it again is
- recursive doubling
- naive approach
- reduction
- all
Q18 | The ____ do not snoop the messages going through them.
- nodes
- variables
- tuple
- list
Q19 | accumulate results and send with the same pattern is...
- broadcast
- naive approach
- recursive doubling
- reduction symmetric
Q20 | every node on the linear array has the data and broadcast on the columns with the linear array algorithm in _____
- parallel
- vertical
- horizontal
- all
Q21 | using different links every time and forwarding in parallel again is
- better for congestion
- better for reduction
- better for communication
- better for algorithm
Q22 | In a balanced binary tree processing nodes is equal to
- leaves
- number of elemnts
- branch
- none
Q23 | In one -to- all broadcast there is
- divide and conquer type algorithm
- sorting type algorithm
- searching type algorithm
- simple algorithm
Q24 | For sake of simplicity, the number of nodes is a power of
- 1
- 2
- 3
- 4
Q25 | Nides with zero in i least significant bits participate in _______
- algorithm
- broadcast
- communication
- searching