High Performance Computing (HPC) MCQ's




Question 91 :
An interface between the user or an application program, and the system resources is

  1. Microprocessor
  2. Microcontroller
  3. Multimicroprocessor
  4. operating system
  

Question 92 :
_________ is a method for inducing concurrency in problems that can be solved using the divide-and-conquer strategy.

  1. exploratory decomposition
  2. speculative decomposition
  3. data-decomposition
  4. Recursive decomposition
  

Question 93 :
 A pipeline is like_

  1. Overlaps various stages of instruction execution to achieve performance.
  2. House pipeline
  3. Both a and b
  4. gas line
  

Question 94 :
In the scatter operation_

  1. Single node send a unique message of size m to every other node
  2.  Single node send a same message of size m to every other node
  3.  Single node send a unique message of size m to next node
  4. None of Above
  

Question 95 :
The number of tasks into which a problem is decomposed determines its_

  1. Granularity
  2.  Priority
  3.  Modernity
  4. None of above
  

Question 96 :
The problem where process concurrency becomes an issue is called as ___________

  1. Reader-write problem
  2. Bankers problem
  3. Bakery problem
  4. Philosophers problem
  

Question 97 :
Status bit is also called

  1. Binary bit
  2. Flag bit
  3. Signed bit
  4. Unsigned bit
  

Question 98 :
A distributed operating system must provide a mechanism for

  1. intraprocessor communication
  2. intraprocess and intraprocessor communication
  3. interprocess and interprocessor communication
  4. interprocessor communication
  

Question 99 :
CISC stands for

  1. Complete Instruction Sequential Compilation
  2. Complete Instruction Sequential Compiler
  3. Complete Instruction Serial Compilation
  4. Complex Instruction set computer
  

Question 100 :
Decomposition Techniques are_

  1. recursive decomposition
  2.  data decomposition
  3.  exploratory decomposition
  4. speculative decomposition
  

Question 101 :
The main objective in building the multi-microprocessor is

  1. greater throughput
  2. enhanced fault tolerance
  3. greater throughput and enhanced fault tolerance
  4. zero throughput
  

Question 102 :
Group communication operations are built using point-to-point messaging primitives

  1. TRUE
  2.  False
  

Question 103 :
The main objective in building the multimicroprocessor is

  1. greater throughput
  2. enhanced fault tolerance
  3. greater throughput and enhanced fault tolerance
  4. none of the mentioned
  

Question 104 :
We denote the serial runtime by TS and the parallel____by TP

  1. runtime
  2. clock time
  3. processor time
  4. clock frequency
  

Question 105 :
In MPI programing MPI_char is the instruction for

  1. Unsign Char
  2. Sign character
  3. Long Char
  4. unsign long char
  

Question 106 :
The graph of tasks (nodes) and their interactions/data exchange (edges)_

  1. Is referred to as a task interaction graph
  2.  Is referred to as a task Communication graph
  3.  Is referred to as a task interface graph
  4. None of Above
  

Question 107 :
In message passing, send and receive message between

  1. Task or processes
  2. Task and Execution
  3. Processor and Instruction
  4. Instruction and decode
  

Question 108 :
The time lost due to the branch instruction is often referred to as ____________

  1. Delay
  2. Branch penalty
  3. Latency
  4. control hazard
  

Question 109 :
  Conventional architectures coarsely comprise of a_

  1. processor
  2. Memory system
  3. Data path.
  4. All of Above
  

Question 110 :
What is usually regarded as the von Neumann Bottleneck

  1. Instruction set
  2. Arithmetic logical unit
  3. Processor/memory interface
  4. Control unit
  

Question 111 :
NUMA architecture uses _______in design

  1. cache
  2. shared memory
  3. message passing
  4. distributed memory
  

Question 112 :
. ______________ leads to concurrency

  1. Serialization
  2. cloud computing
  3. Distribution
  4. Parallelism
  

Question 113 :
Hazard are eliminated through renaming by renaming all

  1. Source register
  2. Memory
  3. Data
  4. Destination register
  

Question 114 :
Mappings are determined by_

  1. task dependency
  2.  task interaction graphs
  3. Both A - B
  4. None of Above
  

Question 115 :
Interaction overheads can be minimized by____

  1. Maximize Data Locality
  2. Maximize Volume of data exchange
  3. Increase Bandwidth
  4. Minimize social media contents
  

Question 116 :
Pipelining strategy is called implement

  1. Instruction execution
  2. Instruction prefetch
  3. Instruction manipulation
  4. instruction decoding
  

Question 117 :
In a multi-processor configuration two coprocessors are connected to host 8086 processor. The instruction sets of the two coprocessors

  1. must be same
  2. may overlap
  3. must be disjoint
  4. must be the same as that of host
  

Question 118 :
parallel computer is capable of

  1. Decentalized computing
  2. Parallel computing
  3. Distributed computing
  4. centralized computing
  

Question 119 :
Design of _______processor is complex

  1. parallel
  2. pipeline
  3. serial
  4. distributed
  

Question 120 :
 VLIW processors rely on_

  1. ACompile time analysis
  2. Initial time analysis
  3. Final time analysis
  4. Mid time analysis
  
Pages