Questions and answers for exam Preparation

MCQs

Total Questions : 34 | Page 2 of 4 pages

Question 11. Synchronous communications

It require some type of “handshaking” between tasks that are sharing dat(A) This can be explicitly structured in code by the programmer, or it may happen at a lower level unknown to the programmer.
It involves data sharing between more than two tasks, which are often specified as being members in a common group, or collective.
It involves two tasks with one task acting as the sender/producer of data, and the other acting as the receiver/consumer.
It allows tasks to transfer data independently from one another.

Discuss Question

Answer: Option A. -> It require some type of “handshaking” between tasks that are sharing dat(A) This can be explicitly structured in code by the programmer, or it may happen at a lower level unknown to the programmer.
Answer: (a)

Question 12. These computer uses the stored-program concept. Memory is used to store both program and data instructions and central processing unit (CPU) gets instructions and/ or data from memory. CPU, decodes the instructions and then sequentially performs them.

Single Program Multiple Data (SPMD)
Flynn’s taxonomy
Von Neumann Architecture
None of these

Discuss Question

Answer: Option C. -> Von Neumann Architecture
Answer: (c)

Question 13. Latency is

Partitioning in that the data associated with a problem is decompose(D) Each parallel task then works on a portion of the dat(A)
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.
It is the time it takes to send a minimal (0 byte) message from one point to other point
None of these

Discuss Question

Answer: Option C. -> It is the time it takes to send a minimal (0 byte) message from one point to other point
Answer: (c)

Question 14. Asynchronous communications

It involves data sharing between more than two tasks, which are often specified as being members in a common group, or collective.
It involves two tasks with one task acting as the sender/producer of data, and the other acting as the receiver/consumer.
It allows tasks to transfer data independently from one another.
None of these

Discuss Question

Answer: Option C. -> It allows tasks to transfer data independently from one another.
Answer: (c)

Question 15. Granularity is

In parallel computing, it is a qualitative measure of the ratio of computation to communication
Here relatively small amounts of computational work are done between communication events
Relatively large amounts of computational work are done between communication / synchronization events
None of these

Discuss Question

Answer: Option A. -> In parallel computing, it is a qualitative measure of the ratio of computation to communication
Answer: (a)

Question 16. Distributed Memory

A computer architecture where all processors have direct access to common physical memory
It refers to network based memory access for physical memory that is not common
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)
None of these

Discuss Question

Answer: Option B. -> It refers to network based memory access for physical memory that is not common
Answer: (b)

Question 17. Serial Execution

A sequential execution of a program, one statement at a time
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
A program or set of instructions that is executed by a processor.
None of these

Discuss Question

Answer: Option A. -> A sequential execution of a program, one statement at a time
Answer: (a)

Question 18. 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.

Single Program Multiple Data (SPMD)
Flynn’s taxonomy
Von Neumann Architecture
None of these

Discuss Question

Answer: Option B. -> Flynn’s taxonomy
Answer: (b)

Question 19. Functional Decomposition:

Partitioning in that the data associated with a problem is decompose(D) Each parallel task then works on a portion of the dat(A)
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.
It is the time it takes to send a minimal (0 byte) message from point A to point (B)
None of these

Discuss Question

Answer: Option 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.
Answer: (b)

Question 20. Massively Parallel

Observed speedup of a code which has been parallelized, defined as: wall-clock time of serial execution and wall-clock time of parallel execution
The amount of time required to coordinate parallel tasks. It includes factors such as: Task start-up time, Synchronizations, Data communications.
Refers to the hardware that comprises a given parallel system - having many processors
None of these

Discuss Question

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