parallel computing set 2 Detailed Explanation And More Example

Question : 1

Synchronous communication operations referred to

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

Question : 2

Parallel Overhead is

a) Observed speedup of a code which has been parallelized, defined as: wall-clock time of serial execution and wall-clock time of parallel execution

b) The amount of time required to coordinate parallel tasks. It includes factors such as: Task start-up time, Synchronizations, Data communications.

c) Refers to the hardware that comprises a given parallel system - having many processors

d) None of these

Question : 3

Domain 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

Here a single program is executed by all tasks simultaneously. At any moment in time, tasks can be executing the same or different instructions within the same program. These programs usually have the necessary logic programmed into them to allow different tasks to branch or conditionally execute only those parts of the program they are designed to execute.

a) Single Program Multiple Data (SPMD)

b) Multiple Program Multiple Data (MPMD)

c) Von Neumann Architecture

d) None of these

Question : 5

In the threads model of parallel programming

a) A single process can have multiple, concurrent execution paths

b) A single process can have single, concurrent execution paths.

c) A multiple process can have single concurrent execution paths.

d) None of these

Question : 6

Non-Uniform Memory Access (NUMA) is

a) Here all processors have equal access and access times to memory

b) Here if one processor updates a location in shared memory, all the other processors know about the update.

c) Here one SMP can directly access memory of another SMP and not all processors have equal access time to all memories

d) None of these