High Performance Computing MCQ

Question 91 : A multiprocessor machine which is capable of executing multiple instructions on multiple data sets

1. SISD
2. SIMD
3. MIMD
4. MISD

Question 92 : Tree networks suffer from a communication bottleneck at higher levels of the tree. This network, also called a _________ tree.

1. fat
2. binary
3. order static
4. heap tree

Question 93 : Multiple application independently running are typically called

1. Multiprograming
2. multiithreading
3. Multitasking
4. Synchronization

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

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

Question 95 : 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 96 : Wating until there is no data hazards then

1. stall
2. write operand
3. Read operand
4. Branching

Question 97 : 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 98 : We denote the serial runtime by TS and the parallel____by TP

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

Question 99 : Uniprocessor computing devices is called__________.

1. Grid computing
2. Centralized computing
3. Parallel computing
4. Distributed computing

Question 100 : 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 101 : what is WAR

1. Write before read
2. write after write
3. write after read
4. write with read

Question 102 : Partitioning refer to decomposing of the computational activity as

1. Small Task
2. Large Task
3. Full program
4. group of program

Question 103 : Speed up is defined as a ratio of

1. s=Ts/Tp
2. S= Tp/Ts
3. Ts=S/Tp
4. Tp=S /Ts

Question 104 : 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 105 : Pipelining strategy is called implement

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

Question 106 : Parallel computing means to divide the job into several __________

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

Question 107 : if a piece of data is repeatedly used, the effective latency of this memory system can be reduced by the __________.

1. RAM
2. ROM
3. Cache
4. HDD

Question 108 : Processing of multiple tasks simultaneously on multiple processors is called

1. Parallel processong
2. Distributed processing
3. Uni- processing
4. Multi-processing

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

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

Question 110 : A multiprocessor operating system must take care of

1. authorized data access and data protection
2. unauthorized data access and data protection
3. authorized data access
4. data protection

Question 111 : The expression 'delayed load' is used in context of

1. prefetching
2. pipelining
3. processor-printer communication
4. memory-monitor communication

Question 112 : _________ 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 113 : If no node having a copy of a cache block, this technique is known as

1. Uniform memory access
2. Cached
3. Un-cached
4. Commit