Question 1

Which of the following is not parallel algorithm model

Accepted Answer

A) the data parallel model 
B) the work pool model 
C) the task graph model 
D) the speculative model 
A) the data parallel model 
B) the work pool model 
C) the task graph model 
D) the speculative model D

Question 2

______ Communication model is generally seen in tightly coupled system.

Accepted Answer

A) message passing 
B) shared-address space 
C) client-server 
D) distributed network 
A) message passing 
B) shared-address space 
C) client-server 
D) distributed network B

Question 3

Which task decomposition technique is suitable for the 15-puzzle problem?

Accepted Answer

A) data decomposition 
B) exploratory decomposition 
C) speculative decomposition 
D) recursive decomposition 
A) data decomposition 
B) exploratory decomposition 
C) speculative decomposition 
D) recursive decomposition B

Question 4

The prefix-sum operation can be implemented using the kernel

Accepted Answer

A) all-to-all broadcast 
B) one-to-all broadcast 
C) all-to-one broadcast 
D) all-to-all reduction 
A) all-to-all broadcast 
B) one-to-all broadcast 
C) all-to-one broadcast 
D) all-to-all reduction

Question 5

The time taken by all-to- all broadcast on a ring is .

Accepted Answer

A) t= (ts + twm)(p-1) 
B) t= ts logp + twm(p-1) 
C) t= 2ts(?p - 1) - twm(p-1) 
D) t= 2ts(?p - 1) + twm(p-1) 
A) t= (ts + twm)(p-1) 
B) t= ts logp + twm(p-1) 
C) t= 2ts(?p - 1) - twm(p-1) 
D) t= 2ts(?p - 1) + twm(p-1)

Question 6

Select how the overhead function (To) is calculated.

Accepted Answer

A) to = p*n tp - ts 
B) to = p tp - ts 
C) to = tp - pts 
D) to = tp - ts 
A) to = p*n tp - ts 
B) to = p tp - ts 
C) to = tp - pts 
D) to = tp - ts

Question 7

Messages get smaller in and stay constant in .

Accepted Answer

A) gather, broadcast 
B) scatter , broadcast 
C) scatter, gather 
D) broadcast, gather 
A) gather, broadcast 
B) scatter , broadcast 
C) scatter, gather 
D) broadcast, gather

Question 8

Consider Hypercube topology with 8 nodes then how many message passing cycles will require in all to all broadcast operation?

Accepted Answer

A) the longest path between any pair of finish nodes. 
B) the longest directed path between any pair of start & finish node. 
C) the shortest path between any pair of finish nodes. 
D) the number of maximum nodes level in graph. 
A) the longest path between any pair of finish nodes. 
B) the longest directed path between any pair of start & finish node. 
C) the shortest path between any pair of finish nodes. 
D) the number of maximum nodes level in graph.

Question 9

The time taken by all-to- all broadcast on a hypercube is .

Accepted Answer

A) t= (ts + twm)(p-1) 
B) t= ts logp + twm(p-1) 
C) t= 2ts(?p - 1) - twm(p-1) 
D) t= 2ts(?p - 1) + twm(p-1) 
A) t= (ts + twm)(p-1) 
B) t= ts logp + twm(p-1) 
C) t= 2ts(?p - 1) - twm(p-1) 
D) t= 2ts(?p - 1) + twm(p-1)

Question 10

The number and size of tasks into which a problem is decomposed determines the __

Accepted Answer

A) granularity 
B) task 
C) dependency graph 
D) decomposition 
A) granularity 
B) task 
C) dependency graph 
D) decomposition

Question 11

In All-to-All Personalized Communication on a Ring, the size of the message reduces by___________      at each step

Accepted Answer

A) p 
B) m-1 
C) p-1 
D) m 
A) p 
B) m-1 
C) p-1 
D) m

Question 12

Which of the following method is used to avoid Interaction Overheads?

Accepted Answer

A) maximizing data locality 
B) minimizing data locality 
C) increase memory size 
D) none of the above. 
A) maximizing data locality 
B) minimizing data locality 
C) increase memory size 
D) none of the above.

Question 13

Which is alternative options for latency hiding?

Accepted Answer

A) increase cpu frequency 
B) multithreading 
C) increase bandwidth 
D) increase memory 
A) increase cpu frequency 
B) multithreading 
C) increase bandwidth 
D) increase memory

Question 14

What is Critical Path?

Accepted Answer

A) the length of the longest path in a task dependency graph is called the critical path length. 
B) the length of the smallest path in a task dependency graph is called the critical path length. 
C) path with loop 
D) none of the mentioned. 
A) the length of the longest path in a task dependency graph is called the critical path length. 
B) the length of the smallest path in a task dependency graph is called the critical path length. 
C) path with loop 
D) none of the mentioned.

Question 15

The time taken by all-to- all broadcast on a mesh is .

Accepted Answer

A) t= (ts + twm)(p-1) 
B) t= ts logp + twm(p-1) 
C) t= 2ts(?p - 1) - twm(p-1) 
D) t= 2ts(?p - 1) + twm(p-1) 
A) t= (ts + twm)(p-1) 
B) t= ts logp + twm(p-1) 
C) t= 2ts(?p - 1) - twm(p-1) 
D) t= 2ts(?p - 1) + twm(p-1)

Question 16

Which decompositioin technique uses divide-andconquer strategy?

Accepted Answer

A) recursive decomposition 
B) sdata decomposition 
C) exploratory decomposition 
D) speculative decomposition 
A) recursive decomposition 
B) sdata decomposition 
C) exploratory decomposition 
D) speculative decomposition

Question 17

Scatter is ____________.

Accepted Answer

A) one to all broadcast communication 
B) all to all broadcast communication 
C) one to all personalised communication 
D) node of the above. 
A) one to all broadcast communication 
B) all to all broadcast communication 
C) one to all personalised communication 
D) node of the above.

Question 18

In All-to-all Broadcast on a Mesh, operation performs in which sequence?

Accepted Answer

A) rowwise, columnwise 
B) columnwise, rowwise 
C) columnwise, columnwise 
D) rowwise, rowwise 
A) rowwise, columnwise 
B) columnwise, rowwise 
C) columnwise, columnwise 
D) rowwise, rowwise

Question 19

All-to-All Broadcast and Reduction algorithm on a Ring terminates in___________           steps.

Accepted Answer

A) p+1 
B) p-1 
C) p*p 
D) p 
A) p+1 
B) p-1 
C) p*p 
D) p

Question 20

The time that elapses from the moment the first processor starts to the moment the last processor finishes execution is called as___________               .

Accepted Answer

A) parallel runtime 
B) overhead runtime 
C) excess runtime 
D) serial runtime 
A) parallel runtime 
B) overhead runtime 
C) excess runtime 
D) serial runtime

Which of the following is not parallel algorithm model

______ Communication model is generally seen in tightly coupled system.

Which task decomposition technique is suitable for the 15-puzzle problem?

The prefix-sum operation can be implemented using the kernel

The time taken by all-to- all broadcast on a ring is .

Select how the overhead function (To) is calculated.

Messages get smaller in and stay constant in .

Consider Hypercube topology with 8 nodes then how many message passing cycles will require in all to all broadcast operation?

The time taken by all-to- all broadcast on a hypercube is .

The number and size of tasks into which a problem is decomposed determines the __

In All-to-All Personalized Communication on a Ring, the size of the message reduces by___________ at each step

Which of the following method is used to avoid Interaction Overheads?

Which is alternative options for latency hiding?

What is Critical Path?

The time taken by all-to- all broadcast on a mesh is .

Which decompositioin technique uses divide-andconquer strategy?

Scatter is ____________.

In All-to-all Broadcast on a Mesh, operation performs in which sequence?

All-to-All Broadcast and Reduction algorithm on a Ring terminates in___________ steps.

The time that elapses from the moment the first processor starts to the moment the last processor finishes execution is called as___________ .

Understanding Cuda Kernel Code and Host GPU Interactions

Nvidia CUDA and GPU Programming

Parallel Execution in CUDA, Sorting Algorithms, and Search Techniques

Characteristics and Operations in Parallel Programming

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 Computing and GPU Architecture

Exploring Multiprocessor Systems and Parallel Algorithms

Parallel Processing and Algorithms

Distributed Systems and Computing

Filters

Exam 13: Parallel Communication and Runtime Analysis

Which of the following is not parallel algorithm model

______ Communication model is generally seen in tightly coupled system.

Which task decomposition technique is suitable for the 15-puzzle problem?

The prefix-sum operation can be implemented using the kernel

The time taken by all-to- all broadcast on a ring is .

Select how the overhead function (To) is calculated.

Messages get smaller in and stay constant in .

Consider Hypercube topology with 8 nodes then how many message passing cycles will require in all to all broadcast operation?

The time taken by all-to- all broadcast on a hypercube is .

The number and size of tasks into which a problem is decomposed determines the __

In All-to-All Personalized Communication on a Ring, the size of the message reduces by___________ at each step

Which of the following method is used to avoid Interaction Overheads?

Which is alternative options for latency hiding?

What is Critical Path?

The time taken by all-to- all broadcast on a mesh is .

Which decompositioin technique uses divide-andconquer strategy?

Scatter is ____________.

In All-to-all Broadcast on a Mesh, operation performs in which sequence?

All-to-All Broadcast and Reduction algorithm on a Ring terminates in___________ steps.

The time that elapses from the moment the first processor starts to the moment the last processor finishes execution is called as___________ .

Understanding Cuda Kernel Code and Host GPU Interactions

Nvidia CUDA and GPU Programming

Parallel Execution in CUDA, Sorting Algorithms, and Search Techniques

Characteristics and Operations in Parallel Programming

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 Computing and GPU Architecture

Exploring Multiprocessor Systems and Parallel Algorithms

Parallel Processing and Algorithms

Distributed Systems and Computing

Filters