166
85.2k

110+ Parallel Computing Solved MCQs

These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Master of Science in Computer Science (MSc CS) , Common Topics in Competitive and Entrance exams .

101.

Granularity 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 computa- tional work are done between communication / synchronization events
D. None of these
Answer» A. In parallel computing, it is a qualitative measure of the ratio of computation to communication
102.

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 computa- tional work are done between communication / synchronization events
D. None of these
Answer» C. Relatively large amounts of computa- tional work are done between communication / synchronization events
103.

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
Answer» B. Here if one processor updates a location in shared memory, all the other processors know about the update.
104.

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
Answer» C. Here one SMP can directly access memory of another SMP and not all processors have equal access time to all memories
105.

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
Answer» B. Flynn’s taxonomy
106.

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
Answer» A. A single process can have multiple, concurrent execution paths
107.

These applications typically have multiple executable object files (programs). While the application is being run in parallel, each task can be executing the same or different program as other tasks. All tasks may use different data

A. Single Program Multiple Data (SPMD)
B. Multiple Program Multiple Data (MPMD)
C. Von Neumann Architecture
D. None of these
Answer» B. Multiple Program Multiple Data (MPMD)
108.

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
Answer» A. Single Program Multiple Data (SPMD)
109.

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.

A. Single Program Multiple Data (SPMD)
B. Flynn’s taxonomy
C. Von Neumann Architecture
D. None of these
Answer» C. Von Neumann Architecture
110.

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
Answer» 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.
111.

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
Answer» A. Involves only those tasks executing a communication operation
112.

Data dependence 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
Answer» B. It exists between program statements when the order of statement execution affects the results of the program.

Done Studing? Take A Test.

Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.