Top 250+ Solved High Performance Computing (HPC) MCQ Questions Answer
Q. Writing parallel programs is referred to as?
a. parallel computation
b. parallel processes
c. parallel development
d. parallel programming
Q. The number and size of tasks into which a problem is decomposed determines the?
a. fine-granularity
b. coarse-granularity
c. sub task
d. granularity
Q. A feature of a task-dependency graph that determines the average degree of concurrency for a given granularity is its ___________ path?
a. critical
b. easy
c. difficult
d. ambiguous
Q. The pattern of___________ among tasks is captured by what is known as a task-interaction graph?
a. interaction
b. communication
c. optmization
d. flow
Q. Interaction overheads can be minimized by____?
a. maximize data locality
b. maximize volume of data exchange
c. increase bandwidth
d. minimize social media contents
Q. Type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism?
a. task
b. instruction
c. data
d. program
Q. Parallel computing means to divide the job into several __________?
a. bit
b. data
c. instruction
d. task
Q. _________ is a method for inducing concurrency in problems that can be solved using the divide-and-conquer strategy?
a. exploratory decomposition
b. speculative decomposition
c. data-decomposition
d. recursive decomposition
Q. The___ time collectively spent by all the processing elements Tall = p TP?
a. total
b. average
c. mean
d. sum
Q. The dual of one-to-all broadcast is ?
a. all-to-one reduction
b. all-to-one receiver
c. all-to-one sum
d. none of above
Q. The Prefix Sum Operation can be implemented using the ?
a. all-to-all broadcast kernel.
b. all-to-one broadcast kernel.
c. one-to-all broadcast kernel
d. scatter kernel
Q. In the scatter operation ?
a. single node send a unique message of size m to every other node
b. single node send a same message of size m to every other node
c. single node send a unique message of size m to next node
d. none of above