Top 250+ Solved High Performance Computing (HPC) MCQ Questions Answer
Q. In All-to-all Broadcast on a Mesh, operation performs in which sequence?
a. rowwise, columnwise
b. columnwise, rowwise
c. columnwise, columnwise
d. rowwise, rowwise
Q. Messages get smaller inand stay constant in .
a. gather, broadcast
b. scatter , broadcast
c. scatter, gather
d. broadcast, gather
Q. The prefix-sum operation can be implemented using the kernel
a. all-to-all broadcast
b. one-to-all broadcast
c. all-to-one broadcast
d. all-to-all reduction
Q. Select the parameters on which the parallel runtime of a program depends.
a. number of processors
b. communication parameters of the machine
c. all of the above
d. input size
Q. The time that elapses from the moment the first processor starts to the moment the last processor finishes execution is called as .
a. parallel runtime
b. overhead runtime
c. excess runtime
d. serial runtime
Q. Select how the overhead function (To) is calculated.
a. to = p*n tp - ts
b. to = p tp - ts
c. to = tp - pts
d. to = tp - ts
Q. What is is the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements?
a. overall time
b. speedup
c. scaleup
d. efficiency
Q. Which is alternative options for latency hiding?
a. increase cpu frequency
b. multithreading
c. increase bandwidth
d. increase memory
Q. ______ Communication model is generally seen in tightly coupled system.
a. message passing
b. shared-address space
c. client-server
d. distributed network
Q. The principal parameters that determine the communication latency are as follows:
a. startup time (ts) per-hop time (th) per-word transfer time (tw)
b. startup time (ts) per-word transfer time (tw)
c. startup time (ts) per-hop time (th)
d. startup time (ts) message-packet-size(w)
Q. The number and size of tasks into which a problem is decomposed determines the __
a. granularity
b. task
c. dependency graph
d. decomposition
Q. Average Degree of Concurrency is...
a. the average number of tasks that can run concurrently over the entire duration of execution of the process.
b. the average time that can run concurrently over the entire duration of execution of the process.
c. the average in degree of task dependency graph.
d. the average out degree of task dependency graph.
Q. Which task decomposition technique is suitable for the 15-puzzle problem?
a. data decomposition
b. exploratory decomposition
c. speculative decomposition
d. recursive decomposition
Q. Which of the following method is used to avoid Interaction Overheads?
a. maximizing data locality
b. minimizing data locality
c. increase memory size
d. none of the above.
Q. Which of the following is not parallel algorithm model
a. the data parallel model
b. the work pool model
c. the task graph model
d. the speculative model