1. Home
  2. Back Today Date :- Friday 4th of July 2025 07:14:10 AM

High Performance Computing (HPC) - Online Exam Test Papers | High Performance Computing (HPC) - MCQs[multiple choice questions and answers ] | High Performance Computing (HPC) - Mock Test Papers | High Performance Computing (HPC) - Practice Papers | High Performance Computing (HPC) - Sample Test Papers |

Question:
source ____ is bottleneck.

1.process

2.algorithm

3.list

4.tuple

Posted Date:-2022-07-15 08:21:13

More MCQS Questions and answers

  1. A good mapping does not depends on which following factor
  2. All nodes collects _____ message corresponding to √p nodes to their respectively
  3. All-to-all personalized communication can be used in ____
  4. All-to-one communication (reduction) is the dual of ______ broadcast.
  5. Cost Analysis on a mesh is
  6. Goal of good algorithm is to implement commonly used _____ pattern.
  7. If we port algorithm to higher dimemsional network it would cause
  8. In ------------task are defined before starting the execution of the algorithmting?
  9. In a broadcast and reduction on a balanced binary tree reduction is done in ______
  10. In one -to- all broadcast there is
  11. In Scatter Operation on Hypercube, on each step, the size of the messages communicated is ____
  12. In the scatter operation ____ node send message to every other node
  13. In the second phase of 2D Mesh All to All, the message size is ___
  14. In this decomposition problem decomposition goes hand in hand with its execution
  15. It is not possible to port ____ for higher dimensional network
  16. Reduction can be used to find the sum, product, maximum, minimum of _____ of numbers.
  17. subsets of processes in ______ interaction.
  18. threads being block altogether and being executed in the sets of 32 threads called a
  19. When the topological sort of a graph is unique?
  20. Which of the following is not a form of parallelism supported by CUDA
  21. which of the following is not a granularity type
  22. which of the following is not an example of explorative decomposition
  23. accumulate results and send with the same pattern is...
  24. All processes participate in a single ______ interaction operation.
  25. all processes that have the data can send it again is
  26. All-to-all broadcast algorithm for the 2D mesh is based on the
  27. blocking optimization is used to improve temmporal locality for reduce
  28. Broadcast and reduction operations on a mesh is performed
  29. Communication between two directly link nodes
  30. Cost Analysis on a ring is
  31. CUDA thought that 'unifying theme' of every form of parallelism is
  32. Each node first sends to one of its neighbours the data it need to....
  33. efficiency of data parallel algorithm depends on the
  34. every node has to know when to communicate that is
  35. every node on the linear array has the data and broadcast on the columns with the linear array algorithm in _____
  36. For sake of simplicity, the number of nodes is a power of
  37. Generalization of broadcast in Which each processor is
  38. Group communication operations are built using which primitives?
  39. if "X" is the message to broadcast it initially resides at the source node
  40. In a balanced binary tree processing nodes is equal to
  41. In a eight node ring, node ____ is source of broadcast
  42. In All to All on Hypercube, The size of the message to be transmitted at the next step is ____ by concatenating the received message with their current data
  43. In collective communication operations, collective means
  44. In task dependency graph longest directed path between any pair of start and finish node is called as --------------
  45. In the first phase of 2D Mesh All to All, the message size is ___
  46. kernel may contain only host code
  47. logical operators used in algorithm are
  48. Nides with zero in i least significant bits participate in _______
  49. one to all broadcast use
  50. One-to-All Personalized Communication operation is commonly called ___
  51. only connections between single pairs of nodes are used at a time is
  52. Renaming relative to the source is _____ the source.
  53. Renaming relative to the source is _____ the source.
  54. Similar communication pattern to all-to-all broadcast except in the_____
  55. source ____ is bottleneck.
  56. Task dependency graph is ------------------
  57. The algorithm terminates in _____ steps
  58. The all-to-all broadcast on Hypercube needs ____ steps
  59. The dual of all-to-all broadcast is
  60. The dual of the scatter operation is the
  61. The gather Operation is exactly the inverse of _____
  62. the procedure is disturbed and require only point-to-point _______
  63. the procedure is disturbed and require only point-to-point _______
  64. The processors compute ______ product of the vector element and the loval matrix
  65. The second communication phase is a columnwise ______ broadcast of consolidated
  66. The style of parallelism supported on GPUs is best described as
  67. The ____ do not snoop the messages going through them.
  68. using different links every time and forwarding in parallel again is
  69. What is a high performance multi-core processor that can be used to accelerate a wide variety of applications using parallel computing.
  70. Which is also called "Total Exchange" ?
  71. Which is known as Broadcast?
  72. Which is known as Reduction?
  73. Which of the following correctly describes a GPU kernel
  74. which of the following is a an example of data decomposition
  75. which of the following is not a granularity type
  76. which of the following is not an parallel algorithm model
  77. which of the following is not the array distribution method of data partitioning
  78. which problems can be handled by recursive decomposition
  79. wimpleat way to send p-1 messages from source to the other p-1 processors
  80. __ can be performed in an identical fashion by inverting the process.
Search