Question 1

In message passing, send and receive message between?

Accepted Answer

A) task or processes 
B) task and execution 
C) processor and instruction 
D) instruction and decode 
A) task or processes 
B) task and execution 
C) processor and instruction 
D) instruction and decode A

Question 2

Type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism?

Accepted Answer

A) task 
B) instruction 
C) data 
D) program 
A) task 
B) instruction 
C) data 
D) program A

Question 3

A simple application of exploratory decomposition is_?

Accepted Answer

A) the solution to a 15 puzzle 
B) the solution to 20 puzzle 
C) the solution to any puzzle 
D) none of above 
A) the solution to a 15 puzzle 
B) the solution to 20 puzzle 
C) the solution to any puzzle 
D) none of above A

Question 4

NUMA architecture uses _______in design?

Accepted Answer

A) cache 
B) shared memory 
C) message passing 
D) distributed memory 
A) cache 
B) shared memory 
C) message passing 
D) distributed memory

Question 5

A multiprocessor machine which is capable of executing multiple instructions on multiple data sets?

Accepted Answer

A) sisd 
B) simd 
C) mimd 
D) misd 
A) sisd 
B) simd 
C) mimd 
D) misd

Question 6

The Owner Computes Rule generally states that the process assigned a particular data item is responsible for?

Accepted Answer

A) all computation associated with it 
B) only one computation 
C) only two computation 
D) only occasionally computation 
A) all computation associated with it 
B) only one computation 
C) only two computation 
D) only occasionally computation

Question 7

For inter processor communication the miss arises are called?

Accepted Answer

A) hit rate 
B) coherence misses 
C) comitt misses 
D) parallel processing 
A) hit rate 
B) coherence misses 
C) comitt misses 
D) parallel processing

Question 8

A feature of a task-dependency graph that determines the average degree of concurrency for a given granularity is its ___________ path?

Accepted Answer

A) critical 
B) easy 
C) difficult 
D) ambiguous 
A) critical 
B) easy 
C) difficult 
D) ambiguous

Question 9

_________ is a method for inducing concurrency in problems that can be solved using the divide-and-conquer strategy?

Accepted Answer

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

Question 10

Speculative Decomposition consist of _?

Accepted Answer

A) conservative approaches 
B) optimistic approaches 
C) both a and b 
D) only b 
A) conservative approaches 
B) optimistic approaches 
C) both a and b 
D) only b

Question 11

Parallel Algorithm Models?

Accepted Answer

A) data parallel model 
B) bit model 
C) data model 
D) network model 
A) data parallel model 
B) bit model 
C) data model 
D) network model

Question 12

Multiprocessor is systems with multiple CPUs, which are capable of independently executing different tasks in parallel. In this category every processor and memory module has similar access time?

Accepted Answer

A) uma 
B) microprocessor 
C) multiprocessor 
D) numa 
A) uma 
B) microprocessor 
C) multiprocessor 
D) numa

Question 13

Writing parallel programs is referred to as?

Accepted Answer

A) parallel computation 
B) parallel processes 
C) parallel development 
D) parallel programming 
A) parallel computation 
B) parallel processes 
C) parallel development 
D) parallel programming

Question 14

The length of the longest path in a task dependency graph is called?

Accepted Answer

A) the critical path length 
B) the critical data length 
C) the critical bit length 
D) none of above 
A) the critical path length 
B) the critical data length 
C) the critical bit length 
D) none of above

Question 15

task characteristics include?

Accepted Answer

A) task generation. 
B) task sizes. 
C) size of data associated with tasks. 
D) all of above 
A) task generation. 
B) task sizes. 
C) size of data associated with tasks. 
D) all of above

Question 16

The number of tasks into which a problem is decomposed determines its?

Accepted Answer

A) granularity 
B) priority 
C) modernity 
D) none of above 
A) granularity 
B) priority 
C) modernity 
D) none of above

Question 17

Mappings are determined by?

Accepted Answer

A) task dependency 
B) task interaction graphs 
C) both a and b 
D) none of above 
A) task dependency 
B) task interaction graphs 
C) both a and b 
D) none of above

Question 18

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

Accepted Answer

A) fine-granularity 
B) coarse-granularity 
C) sub task 
D) granularity 
A) fine-granularity 
B) coarse-granularity 
C) sub task 
D) granularity

Question 19

Speed up is defined as a ratio of?

Accepted Answer

A) s=ts/tp 
B) s= tp/ts 
C) ts=s/tp 
D) tp=s /ts 
A) s=ts/tp 
B) s= tp/ts 
C) ts=s/tp 
D) tp=s /ts

Question 20

Parallel computing means to divide the job into several __________?

Accepted Answer

A) bit 
B) data 
C) instruction 
D) task 
A) bit 
B) data 
C) instruction 
D) task

In message passing, send and receive message between?

Type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism?

A simple application of exploratory decomposition is_?

NUMA architecture uses _______in design?

A multiprocessor machine which is capable of executing multiple instructions on multiple data sets?

The Owner Computes Rule generally states that the process assigned a particular data item is responsible for?

For inter processor communication the miss arises are called?

A feature of a task-dependency graph that determines the average degree of concurrency for a given granularity is its ___________ path?

_________ is a method for inducing concurrency in problems that can be solved using the divide-and-conquer strategy?

Speculative Decomposition consist of _?

Parallel Algorithm Models?

Multiprocessor is systems with multiple CPUs, which are capable of independently executing different tasks in parallel. In this category every processor and memory module has similar access time?

Writing parallel programs is referred to as?

The length of the longest path in a task dependency graph is called?

task characteristics include?

The number of tasks into which a problem is decomposed determines its?

Mappings are determined by?

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

Speed up is defined as a ratio of?

Parallel computing means to divide the job into several __________?

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 Communication and Runtime Analysis

Parallel Computing and GPU Architecture

Parallel Processing and Algorithms

Distributed Systems and Computing

Filters

Exam 15: Exploring Multiprocessor Systems and Parallel Algorithms

In message passing, send and receive message between?

Type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism?

A simple application of exploratory decomposition is_?

NUMA architecture uses _______in design?

A multiprocessor machine which is capable of executing multiple instructions on multiple data sets?

The Owner Computes Rule generally states that the process assigned a particular data item is responsible for?

For inter processor communication the miss arises are called?

A feature of a task-dependency graph that determines the average degree of concurrency for a given granularity is its ___________ path?

_________ is a method for inducing concurrency in problems that can be solved using the divide-and-conquer strategy?

Speculative Decomposition consist of _?

Parallel Algorithm Models?

Multiprocessor is systems with multiple CPUs, which are capable of independently executing different tasks in parallel. In this category every processor and memory module has similar access time?

Writing parallel programs is referred to as?

The length of the longest path in a task dependency graph is called?

task characteristics include?

The number of tasks into which a problem is decomposed determines its?

Mappings are determined by?

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

Speed up is defined as a ratio of?

Parallel computing means to divide the job into several __________?

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 Communication and Runtime Analysis

Parallel Computing and GPU Architecture

Parallel Processing and Algorithms

Distributed Systems and Computing

Filters