Deck 15: Exploring Multiprocessor Systems and Parallel Algorithms

Question 1

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?

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

Answer 1

uma

Question 2

For inter processor communication the miss arises are called?

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

Answer 2

coherence misses

Question 3

NUMA architecture uses _______in design?

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

Answer 3

distributed memory

Question 4

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

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

Question 5

In message passing, send and receive message between?

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

Question 6

The First step in developing a parallel algorithm is_________?

A)to decompose the problem into tasks that can be executed concurrently
B)execute directly
C)execute indirectly
D)none of above

Question 7

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

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

Question 8

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

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

Question 9

The graph of tasks (nodes) and their interactions/data exchange (edges)?

A)is referred to as a task interaction graph
B)is referred to as a task communication graph
C)is referred to as a task interface graph
D)none of above

Question 10

Mappings are determined by?

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

Question 11

Decomposition Techniques are?

A)recursive decomposition
B)data decomposition
C)exploratory decomposition
D)all of above

Question 12

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

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

Question 13

A simple application of exploratory decomposition is_?

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

Question 14

Speculative Decomposition consist of _?

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

Question 15

task characteristics include?

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

Question 16

Writing parallel programs is referred to as?

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

Question 17

Parallel Algorithm Models?

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

Question 18

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

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

Question 19

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

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

Question 20

The pattern of___________ among tasks is captured by what is known as a task-interaction graph?

A)interaction
B)communication
C)optmization
D)flow

Question 21

Interaction overheads can be minimized by____?

A)maximize data locality
B)maximize volume of data exchange
C)increase bandwidth
D)minimize social media contents

Question 22

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

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

Question 23

Speed up is defined as a ratio of?

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

Question 24

Parallel computing means to divide the job into several __________?

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

Question 25

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

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