High Performance Computing MCQs with answers Page - 36

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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)

A

Admin • 833.24K Points
Coach

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

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.