On This Page

This set of High Performance Computing HPC Multiple Choice Questions & Answers (MCQs) focuses on High Performance Computing Set 4

Q1 | Scaling Characteristics of Parallel Programs Ts is
  • increase
  • constant
  • decreases
  • none
Q2 | Speedup tends to saturate and efficiency _____ as a consequence of Amdahl’s law.
  • increase
  • constant
  • decreases
  • none
Q3 | Speedup obtained when the problem size is _______ linearlywith the number of processing elements.
  • increase
  • constant
  • decreases
  • depend on problem size
Q4 | The n × n matrix is partitioned among n processors, with each processor storing complete ___ of the matrix.
  • row
  • column
  • both
  • depend on processor
Q5 | cost-optimal parallel systems have an efficiency of ___
  • 1
  • n
  • logn
  • complex
Q6 | The n × n matrix is partitioned among n2 processors such that each processor owns a _____ element.
  • n
  • 2n
  • single
  • double
Q7 | how many basic communication operations are used in matrix vector multiplication
  • 1
  • 2
  • 3
  • 4
Q8 | In DNS algorithm of matrix multiplication it used
  • 1d partition
  • 2d partition
  • 3d partition
  • both a,b
Q9 | In the Pipelined Execution, steps contain
  • normalization
  • communication
  • elimination
  • all
Q10 | the cost of the parallel algorithm is higher than the sequential run time by a factor of __
  • 2020-03-02 00:00:00
  • 2020-02-03 00:00:00
  • 3*2
  • 2/3+3/2
Q11 | The load imbalance problem in Parallel Gaussian Elimination: can be alleviated by using a ____ mapping
  • acyclic
  • cyclic
  • both
  • none
Q12 | A parallel algorithm is evaluated by its runtime in function of
  • the input size,
  • the number of processors,
  • the communication parameters.
  • all
Q13 | For a problem consisting of W units of work, p__W processors can be used optimally.
  • <=
  • >=
  • <
  • >
Q14 | C(W)__Θ(W) for optimality (necessary condition).
  • >
  • <
  • <=
  • equals
Q15 | many interactions in oractical parallel programs occur in _____ pattern
  • well defined
  • zig-zac
  • reverse
  • straight
Q16 | efficient implementation of basic communication operation can improve
  • performance
  • communication
  • algorithm
  • all
Q17 | efficient use of basic communication operations can reduce
  • development effort and
  • software quality
  • both
  • none
Q18 | Group communication operations are built using_____ Messenging primitives.
  • point-to-point
  • one-to-all
  • all-to-one
  • none
Q19 | one processor has a piece of data and it need to send to everyone is
  • one -to-all
  • all-to-one
  • point -to-point
  • all of above
Q20 | the dual of one -to-all is
  • all-to-one reduction
  • one -to-all reduction
  • pnoint -to-point reducntion
  • none
Q21 | Data items must be combined piece-wise and the result made available at
  • target processor finally
  • target variable finatlalyrget receiver finally
Q22 | wimpleat way to send p-1 messages from source to the other p-1 processors
  • algorithm
  • communication
  • concurrency
  • receiver
Q23 | In a eight node ring, node ____ is source of broadcast
  • 1
  • 2
  • 8
Q24 | The processors compute ______ product of the vector element and the loval matrix
  • local
  • global
  • both
  • none
Q25 | one to all broadcast use
  • recursive doubling
  • simple algorithm
  • both
  • none