Question 1

Scaling Characteristics of Parallel Programs Ts is

Accepted Answer

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

Question 2

cost-optimal parallel systems have an efficiency of ___

Accepted Answer

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

Question 3

efficient implementation of basic communication operation can improve

Accepted Answer

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

Question 4

Group communication operations are built using_____ Messenging primitives.

Accepted Answer

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

Question 5

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

Accepted Answer

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

Question 6

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

Accepted Answer

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

Question 7

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

Accepted Answer

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

Question 8

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

Accepted Answer

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

Question 9

In the Pipelined Execution, steps contain

Accepted Answer

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

Question 10

efficient use of basic communication operations can reduce

Accepted Answer

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

Question 11

how many basic communication operations are used in matrix vector multiplication

Accepted Answer

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

Question 12

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

Accepted Answer

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

Question 13

A parallel algorithm is evaluated by its runtime in function of

Accepted Answer

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

Question 14

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

Accepted Answer

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

Question 15

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

Accepted Answer

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

Question 16

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

Accepted Answer

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

Question 17

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

Accepted Answer

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

Question 18

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

Accepted Answer

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

Question 19

the dual of one -to-all is

Accepted Answer

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

Question 20

one to all broadcast use

Accepted Answer

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

Scaling Characteristics of Parallel Programs Ts is

cost-optimal parallel systems have an efficiency of ___

efficient implementation of basic communication operation can improve

Group communication operations are built using_____ Messenging primitives.

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

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

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

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

In the Pipelined Execution, steps contain

efficient use of basic communication operations can reduce

how many basic communication operations are used in matrix vector multiplication

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

A parallel algorithm is evaluated by its runtime in function of

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

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

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

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

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

the dual of one -to-all is

one to all broadcast use

Understanding Cuda Kernel Code and Host GPU Interactions

Nvidia CUDA and GPU Programming

Parallel Execution in CUDA, Sorting Algorithms, and Search Techniques

Communication Patterns and Algorithms in Distributed Systems

Communication Operations and Algorithms in Parallel Computing

Parallel Computing and Graph Algorithms

Parallel Processing and GPU Architecture

Computer Architecture and Multiprocessor Systems

Sorting Algorithms and Pipelined Systems

Algorithms and Parallel Formulations

Cuda Model, Parallelism, Memory System, and Communication Models

Parallel Communication and Runtime Analysis

Parallel Computing and GPU Architecture

Exploring Multiprocessor Systems and Parallel Algorithms

Parallel Processing and Algorithms

Distributed Systems and Computing

Filters

Exam 4: Characteristics and Operations in Parallel Programming

Scaling Characteristics of Parallel Programs Ts is

cost-optimal parallel systems have an efficiency of ___

efficient implementation of basic communication operation can improve

Group communication operations are built using_____ Messenging primitives.

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

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

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

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

In the Pipelined Execution, steps contain

efficient use of basic communication operations can reduce

how many basic communication operations are used in matrix vector multiplication

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

A parallel algorithm is evaluated by its runtime in function of

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

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

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

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

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

the dual of one -to-all is

one to all broadcast use

Understanding Cuda Kernel Code and Host GPU Interactions

Nvidia CUDA and GPU Programming

Parallel Execution in CUDA, Sorting Algorithms, and Search Techniques

Communication Patterns and Algorithms in Distributed Systems

Communication Operations and Algorithms in Parallel Computing

Parallel Computing and Graph Algorithms

Parallel Processing and GPU Architecture

Computer Architecture and Multiprocessor Systems

Sorting Algorithms and Pipelined Systems

Algorithms and Parallel Formulations

Cuda Model, Parallelism, Memory System, and Communication Models

Parallel Communication and Runtime Analysis

Parallel Computing and GPU Architecture

Exploring Multiprocessor Systems and Parallel Algorithms

Parallel Processing and Algorithms

Distributed Systems and Computing

Filters