parallel computing set 1 Detailed Explanation And More Example

Question : 1

Distributed Memory

a) A computer architecture where all processors have direct access to common physical memory

b) It refers to network based memory access for physical memory that is not common

c) Parallel tasks typically need to exchange dat(A) There are several ways this can be accomplished, such as through, a shared memory bus or over a network, however the actual event of data exchange is commonly referred to as communications regardless of the method employe(D)

d) None of these

Question : 2

Serial Execution

a) A sequential execution of a program, one statement at a time

b) Execution of a program by more than one task, with each task being able to execute the same or different statement at the same moment in time

c) A program or set of instructions that is executed by a processor.

d) None of these

Question : 3

Functional Decomposition:

a) Partitioning in that the data associated with a problem is decompose(D) Each parallel task then works on a portion of the dat(A)

b) Partitioning in that, the focus is on the computation that is to be performed rather than on the data manipulated by the computation. The problem is decomposed according to the work that must be done. Each task then performs a portion of the overall work.

c) It is the time it takes to send a minimal (0 byte) message from point A to point (B)

d) None of these

Question : 4

Fine-grain Parallelism is

a) In parallel computing, it is a qualitative measure of the ratio of computation to communication

b) Here relatively small amounts of computational work are done between communication events

c) Relatively large amounts of computational work are done between communication / synchronization events

d) None of these

Question : 5

In designing a parallel program, one has to break the problem into discreet chunks of work that can be distributed to multiple tasks. This is known as

a) Decomposition

b) Partitioning

c) Compounding

d) Both A and B

Question : 6

Load balancing is

a) Involves only those tasks executing a communication operation

b) It exists between program statements when the order of statement execution affects the results of the program.

c) It refers to the practice of distributing work among tasks so that all tasks are kept busy all of the time. It can be considered as minimization of task idle time.

d) None of these