High Performance Computing MCQs with answers Page - 28

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. 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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

Q. Which is alternative options for latency hiding?

  • (A) increase cpu frequency
  • (B) multithreading
  • (C) increase bandwidth
  • (D) increase memory

A

Admin • 833.24K Points
Coach

Q. ______ Communication model is generally seen in tightly coupled system.

  • (A) message passing
  • (B) shared-address space
  • (C) client-server
  • (D) distributed network

A

Admin • 833.24K Points
Coach

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)

A

Admin • 833.24K Points
Coach

Q. The number and size of tasks into which a problem is decomposed determines the __

  • (A) granularity
  • (B) task
  • (C) dependency graph
  • (D) decomposition

A

Admin • 833.24K Points
Coach

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.

A

Admin • 833.24K Points
Coach

Q. Which task decomposition technique is suitable for the 15-puzzle problem?

  • (A) data decomposition
  • (B) exploratory decomposition
  • (C) speculative decomposition
  • (D) recursive decomposition

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.