Deck 6: Communication Operations and Algorithms in Parallel Computing

Question 1

In the second phase of 2D Mesh All to All, the message size is ___

A)m
B)p*sqrt(m)
C)p
D)m*sqrt(p)

Answer 1

m*sqrt(p)

Question 2

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

A)doubled
B)tripled
C)halfed
D)no change

Answer 2

doubled

Question 3

The all-to-all broadcast on Hypercube needs ____ steps

A)p
B)sqrt(p) - 1
C)log p
D)none

Answer 3

log p

Question 4

One-to-All Personalized Communication operation is commonly called ___

A)gather operation
B)concatenation
C)scatter operation
D)none

Question 5

The dual of the scatter operation is the

A)concatenation
B)gather operation
C)both
D)none

Question 6

In Scatter Operation on Hypercube, on each step, the size of the messages communicated is ____

A)tripled
B)halved
C)doubled
D)no change

Question 7

Which is also called "Total Exchange" ?

A)all-to-all broadcast
B)all-to-all personalized communication
C)all-to-one reduction
D)none

Question 8

All-to-all personalized communication can be used in ____

A)fourier transform
B)matrix transpose
C)sample sort
D)all of the above

Question 9

In collective communication operations, collective means

A)involve group of processors
B)involve group of algorithms
C)involve group of variables
D)none of these

Question 10

efficiency of data parallel algorithm depends on the

A)efficient implementation of the algorithm
B)efficient implementation of the operation
C)both
D)none

Question 11

All processes participate in a single ______ interaction operation.

A)global
B)local
C)wide
D)variable

Question 12

subsets of processes in ______ interaction.

A)global
B)local
C)wide
D)variable

Question 13

Goal of good algorithm is to implement commonly used _____ pattern.

A)communication
B)interaction
C)parallel
D)regular

Question 14

Reduction can be used to find the sum, product, maximum, minimum of _____ of numbers.

A)tuple
B)list
C)sets
D)all of above

Question 15

source ____ is bottleneck.

A)process
B)algorithm
C)list
D)tuple

Question 16

only connections between single pairs of nodes are used at a time is

A)good utilization
B)poor utilization
C)massive utilization
D)medium utilization

Question 17

all processes that have the data can send it again is

A)recursive doubling
B)naive approach
C)reduction
D)all

Question 18

The ____ do not snoop the messages going through them.

A)nodes
B)variables
C)tuple
D)list

Question 19

accumulate results and send with the same pattern is...

A)broadcast
B)naive approach
C)recursive doubling
D)reduction symmetric

Question 20

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

Question 21

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

Question 22

In a balanced binary tree processing nodes is equal to

A)leaves
B)number of elemnts
C)branch
D)none

Question 23

In one -to- all broadcast there is

A)divide and conquer type algorithm
B)sorting type algorithm
C)searching type algorithm
D)simple algorithm

Question 24

For sake of simplicity, the number of nodes is a power of

A)1
B)2
C)3
D)4

Question 25

Nides with zero in i least significant bits participate in _______

A)algorithm
B)broadcast
C)communication
D)searching