High Performance Computing (HPC) MCQ's




Question 121 :
binary tree in which processors are (logically) at the leaves and internal nodes are routing nodes.

  1. TRUE
  2.  False
  

Question 122 :
Each of the clock cycle from the previous section of execution becomes

  1. Previous stage
  2. stall
  3. previous cycle
  4. pipe stage
  

Question 123 :
The instructions which copy information from one location to another either in the processor’s internal register set or in the external main memory are called

  1. Data transfer instructions
  2. Program control instructions
  3. Input-output instructions
  4. Logical instructions
  

Question 124 :
A feature of a task-dependency graph that determines the average degree of concurrency for a given granularity is its ___________ path

  1. critical
  2. easy
  3. difficult
  4. ambiguous
  

Question 125 :
 Data intensive applications utilize_

  1. High aggregate throughput
  2. High aggregate network bandwidth
  3. High processing and memory system performance.
  4. None of above
  

Question 126 :
In vector processor a single instruction, can ask for ____________ data operations

  1. multiple
  2. single
  3. two
  4. four
  

Question 127 :
Private data that is used by a single processor then shared data are used

  1. Single processor
  2. Multi processor
  3. Single tasking
  4. Multi tasking
  

Question 128 :
The number and size of tasks into which a problem is decomposed determines the

  1. fine-grainularity
  2. coarse-grainularity
  3. sub Task
  4. granularity
  

Question 129 :
The___ time collectively spent by all the processing elements Tall = p TP

  1. total
  2. Average
  3. mean
  4. sum
  

Question 130 :
 The dual of one-to-all broadcast is_

  1. All-to-one reduction
  2.  All-to-one receiver
  3.  All-to-one Sum
  4. None of Above
  

Question 131 :
The instuction execution sequence ,that holds the instruction result known as

  1. Data buffer
  2. control buffer
  3. reorder buffer
  4. ordered buffer
  

Question 132 :
Which Algorithm is better choice for pipelining

  1. Small Algorithm
  2. Hash Algorithm
  3. Merge-Sort Algorithm
  4. Quick-Sort Algorithm
  

Question 133 :
In All-to-All Personalized Communication Each node has a distinct message of size m for every other node

  1. TRUE
  2.  False
  

Question 134 :
The cost of dynamic networks is often determined by the number of ____________ nodes in the network.

  1. Packet
  2. Ring
  3. Static
  4. Switching
  

Question 135 :
type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism.

  1. Task
  2. Instruction
  3. Data
  4. Program
  

Question 136 :
  task characteristics include:

  1. Task generation.
  2.  Task sizes.
  3.  Size of data associated with tasks.
  4. All of Above
  

Question 137 :
A microprogram sequencer

  1. generates the address of next micro instruction to be executed.
  2. generates the control signals to execute a microinstruction.
  3. sequentially averages all microinstructions in the control memory.
  4. enables the efficient handling of a micro program subroutine.
  

Question 138 :
Which of the following interrupt is non maskable

  1. INTR
  2. RST 7.5
  3. RST 6.5
  4. TRAP
  

Question 139 :
The tighhtly copuled set of threads execution working on a single task is called

  1. Serial processing
  2. parallel processing
  3. Multithreading
  4. Recurrent
  

Question 140 :
The straight-forward model used for the memory consistency, is called

  1. Sequential consistency
  2. Random consistency
  3. Remote node
  4. Host node
  

Question 141 :
_________ gives the theoretical speedup in latency of the execution of a task at fixed execution time

  1. Amdahl's
  2. Moor's
  3. metcalfe's
  4. Gustafson's law
  

Question 142 :
A processor that continuously tries to acquire the locks, spinning around a loop till it reaches its success, is known as

  1. Spin locks
  2. Store locks
  3. Link locks
  4. Store operational
  

Question 143 :
 The First step in developing a parallel algorithm is_

  1. To Decompose the problem into tasks that can be executed concurrently
  2.  Execute directly
  3.  Execute indirectly
  4. None of Above
  
Pages