High Performance Computing MCQs with answers Page - 19

Here, you will find a collection of MCQ questions on High Performance Computing. Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 833.24K Points
Coach

Q. subsets of processes in ______ interaction.

  • (A) global
  • (B) local
  • (C) wide
  • (D) variable

A

Admin • 833.24K Points
Coach

Q. Goal of good algorithm is to implement commonly used _____ pattern.

  • (A) communication
  • (B) interaction
  • (C) parallel
  • (D) regular

A

Admin • 833.24K Points
Coach

Q. Reduction can be used to find the sum, product, maximum, minimum of _____ of numbers.

  • (A) tuple
  • (B) list
  • (C) sets
  • (D) all of above

A

Admin • 833.24K Points
Coach

Q. source ____ is bottleneck.

  • (A) process
  • (B) algorithm
  • (C) list
  • (D) tuple

A

Admin • 833.24K Points
Coach

Q. only connections between single pairs of nodes are used at a time is

  • (A) good utilization
  • (B) poor utilization
  • (C) massive utilization
  • (D) medium utilization

A

Admin • 833.24K Points
Coach

Q. all processes that have the data can send it again is

  • (A) recursive doubling
  • (B) naive approach
  • (C) reduction
  • (D) all

A

Admin • 833.24K Points
Coach

Q. The ____ do not snoop the messages going through them.

  • (A) nodes
  • (B) variables
  • (C) tuple
  • (D) list

A

Admin • 833.24K Points
Coach

Q. accumulate results and send with the same pattern is...

  • (A) broadcast
  • (B) naive approach
  • (C) recursive doubling
  • (D) reduction symmetric

A

Admin • 833.24K Points
Coach

Q. every node on the linear array has the data and broadcast on the columns with the linear array algorithm in _____

  • (A) parallel
  • (B) vertical
  • (C) horizontal
  • (D) all

A

Admin • 833.24K Points
Coach

Q. using different links every time and forwarding in parallel again is

  • (A) better for congestion
  • (B) better for reduction
  • (C) better for communication
  • (D) better for algorithm