parallel computing set 1 Detailed Explanation And More Example

Question : 1

In shared Memory:

a) Here all processors access, all memory as global address space

b) Here all processors have individual memory

c) Here some processors access, all memory as global address space and some not

d) None of these

Question : 2

Massively Parallel

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

Cache Coherent UMA (CC-UMA) 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

Question : 4

Coarse-grain Parallelism

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

It distinguishes multi-processor computer architectures according to how they can be classified along the two independent dimensions of Instruction and Dat(A) Each of these dimensions can have only one of two possible states: Single or Multiple.

a) Single Program Multiple Data (SPMD)

b) Flynn’s taxonomy

c) Von Neumann Architecture

d) None of these

Question : 6

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