Deck 4: Characteristics and Operations in Parallel Programming

Question 1

Scaling Characteristics of Parallel Programs Ts is

A)increase
B)constant
C)decreases
D)none

Answer 1

constant

Question 2

Speedup tends to saturate and efficiency _____ as a consequence of Amdahl's law.

A)increase
B)constant
C)decreases
D)none

Answer 2

decreases

Question 3

Speedup obtained when the problem size is _______ linearly with the number of processing elements.

A)increase
B)constant
C)decreases
D)depend on problem size

Answer 3

increase

Question 4

The n × n matrix is partitioned among n processors, with each processor storing complete ___ of the matrix.

A)row
B)column
C)both
D)depend on processor

Question 5

cost-optimal parallel systems have an efficiency of ___

A)1
B)n
C)logn
D)complex

Question 6

The n × n matrix is partitioned among n2 processors such that each processor owns a _____ element.

A)n
B)2n
C)single
D)double

Question 7

how many basic communication operations are used in matrix vector multiplication

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

Question 8

In DNS algorithm of matrix multiplication it used

A)1d partition
B)2d partition
C)3d partition
D)both a,b

Question 9

In the Pipelined Execution, steps contain

A)normalization
B)communication
C)elimination
D)all

Question 10

the cost of the parallel algorithm is higher than the sequential run time by a factor of __

A)2020-03-02 00:00:00
B)2020-02-03 00:00:00
C)3*2
D)2/3+3/2

Question 11

The load imbalance problem in Parallel Gaussian Elimination: can be alleviated by using a ____ mapping

A)acyclic
B)cyclic
C)both
D)none

Question 12

A parallel algorithm is evaluated by its runtime in function of

A)the input size,
B)the number of processors,
C)the communication parameters.
D)all

Question 13

For a problem consisting of W units of work, p__W processors can be used optimally.

A)<=
B)>=
C)<
D)>

Question 14

many interactions in oractical parallel programs occur in _____ pattern

A)well defined
B)zig-zac
C)reverse
D)straight

Question 15

efficient implementation of basic communication operation can improve

A)performance
B)communication
C)algorithm
D)all

Question 16

efficient use of basic communication operations can reduce

A)development effort and
B)software quality
C)both
D)none

Question 17

Group communication operations are built using_____ Messenging primitives.

A)point-to-point
B)one-to-all
C)all-to-one
D)none

Question 18

one processor has a piece of data and it need to send to everyone is

A)one -to-all
B)all-to-one
C)point -to-point
D)all of above

Question 19

the dual of one -to-all is

A)all-to-one reduction
B)one -to-all reduction
C)pnoint -to-point reducntion
D)none

Question 20

Data items must be combined piece-wise and the result made available at

A)target processor finally
B)target variable finatlalyrget receiver finally

Question 21

wimpleat way to send p-1 messages from source to the other p-1 processors

A)algorithm
B)communication
C)concurrency
D)receiver

Question 22

In a eight node ring, node ____ is source of broadcast

A)1
B)2
C)8
D)0

Question 23

The processors compute ______ product of the vector element and the loval matrix

A)local
B)global
C)both
D)none

Question 24

one to all broadcast use

A)recursive doubling
B)simple algorithm
C)both
D)none