Top 250+ Solved High Performance Computing (HPC) MCQ Questions Answer
Q. Select alternate approaches for Hiding Memory Latency
a. multithreading
b. spatial locality
c. all of the above
d. prefeching
Q. Select which clause in OpenMP is similar to the private, except values of variables are initialized to corresponding values before the
a. firstprivate
b. shared
c. all of the above
d. private
Q. Which of the following projects of Blue Gene is not in development?
a. blue gene / m
b. blue gene / p
c. blue gene / q
d. blue gene / l
Q. A decomposition can be illustrated in the form of a directed graph with nodes corresponding to tasks and edges indicating that the result of one task is required for processing the next. Such graph is called as
a. task dependency graph
b. task interaction graph
c. process interaction graph
d. process dependency graph
Q. In which case, the owner computes rule implies that the output is computed by the process to which the output data is assigned?
a. output data decomposition
b. both of the above
c. none of the above
d. input data decomposition
Q. Select relevant task characteristics from the options given below:
a. task sizes
b. size of data associated with tasks
c. all of the above
d. task generation
Q. A classic example of game playing - each 15 puzzle board is the example of
a. dynamic task generation
b. none of the above
c. all of the above
d. static task generation
Q. Which model is equally suitable to shared-address- space or message- passing paradigms, since the interaction is naturally two ways.
a. master slave model
b. data parallel model
c. producer consumer or pipeline model
d. work pool model
Q. In which type of the model, tasks are dynamically assigned to the processes for balancing the load?
a. master slave model
b. data parallel model
c. producer consumer or pipeline model
d. work pool model
Q. Select the appropriate stage of GPU Pipeline which receives commands from CPU and also pulls geometry information from system memory.
a. vertex processing
b. memory interface
c. host interface
d. pixel processing
Q. In all-to-one reduction, data items must be combined piece-wise and the result made available at a processor.
a. last
b. target
c. n-1
d. first
Q. Analyze the Cost of Scatter and Gather .
a. t=ts log p + tw m (p-1)
b. t=ts log p - tw m (p-1)
c. t=tw log p - ts m (p-1)
d. t=tw log p + ts m (p-1)
Q. All-to-all personalized communication is also known as .
a. total exchange
b. both of the above
c. none of the above
d. partial exchange
Q. All-to-All Broadcast and Reduction algorithm on a Ring terminates in steps.
a. p+1
b. p-1
c. p*p
d. p