High Performance Computing MCQ Questions and Answers UNIT – 4 What is High performance computing ? HPC – High Performance Computing is the use of parallel processing for running advanced application programs efficiently, reliably and quickly. The term applies especially to systems that function above a teraflop or 1012 floating-point operations per second. The term HPC is occasionally used as a synonym for supercomputing, although technically a supercomputer is a system that performs at or near the currently highest operational rate for computers. Some supercomputers work at more than a petaflop or 1015 floating-point operations per second.

Table of Contents

## High Performance Computing MCQ UNIT – 4

high performance computing mcq questions and answers

- mathematically efficiency is

e=s/p

e=p/s

e*s=p/2

e=p+e/e

Answer: e=s/p

- Cost of a parallel system is sometimes referred to____ of product

work

processor time

both

none

Answer: both

- Scaling Characteristics of Parallel Programs Ts is

increase

constant

decreases

none

Answer: constant

- Speedup tends to saturate and efficiency _ as a consequence of Amdahl’s law.

increase

constant

decreases

none

Answer: decreases

- Speedup obtained when the problem size is
**__**linearly with the number of processing elements.

increase

constant

decreases

depend on problem size

Answer: increase

- The n × n matrix is partitioned among n processors, with each processor storing complete
*_*_ of the matrix.

row

column

both

depend on processor

Answer: row

- cost-optimal parallel systems have an efficiency of
**_**

1

n

logn

complex

Answer: 1

- The n × n matrix is partitioned among n2 processors such that each processor owns a _ element

n

2n

single

double

Answer: single

- how many basic communication operations are used in matrix vector multiplication

1

2

3

4

Answer: 3

- In DNS algorithm of matrix multiplication it used

1d partition

2d partition

3d partition

both a,b

Answer: 3d partition

high performance computing mcq sppu

- In the Pipelined Execution, steps contain

normalization

communication

elimination

all

Answer: all

- the cost of the parallel algorithm is higher than the sequential run time by a factor of __

3/2

2/3

3*2

2/3+3/2

Answer: 3/2

- The load imbalance problem in Parallel Gaussian Elimination: can be alleviated by using a __

mapping

acyclic

cyclic

both

none

Answer: acyclic

- A parallel algorithm is evaluated by its runtime in function of

the input size,

the number of processors,

the communication parameters.

all

Answer: all

- For a problem consisting of W units of work, p__W processors can be used optimally

a)<=

b)>=

c)<

d)>

Answer: a)<=

- C(W)__Θ(W) for optimality (necessary condition).

>

<

<=

equals

Answer: equals

- many interactions in oractical parallel programs occur in
*__*pattern

well defined

zig-zac

reverse

straight

Answer :well defined

- efficient implementation of basic communication operation can improve

performance

communication

algorithm

all

Answer: performance

- efficient use of basic communication operations can reduce

development effort

software quality

both

none

Answer: development effort

high performance computing mcq questions

- Group communication operations are built using
**_**Messenging primitives.

point-to-point

one-to-all

all-to-one

none

Answer: point-to-point

- one processor has a piece of data and it need to send to everyone is

one -to-all

all-to-one

point -to-point

all of above

Answer: one -to-all

- wimpleat way to send p-1 messages from source to the other p-1 processors

Algorithm

communication

concurrency

receiver

Answer: concurrency

- In a eight node ring, node __ is source of broadcast

1

2

8

0

Answer: 0

- The processors compute __ product of the vector element and the local matrix

local

global

both

none

Answer: local

- one to all broadcast use

recursive doubling

simple algorithm

both

none

Answer: recursive doubling

- In a broadcast and reduction on a balanced binary tree reduction is done in __

recursive order

straight order

vertical order

parallel order

Answer: recursive order

- if “X” is the message to broadcast it initially resides at the source node

1

2

8

0

Answer: 0

- logical operators used in algorithm are

XOR

AND

both

none

Answer: both

- Generalization of broadcast in Which each processor is

Source as well as destination

only source

only destination

none

Answer: Source as well as destination

- The algorithm terminates in _ steps

p

p+1

p+2

p-1

Answer: p-1

- Each node first sends to one of its neighbours the data it need to….

broadcast

identify

verify

none

Answer: broadcast

- The second communication phase is a columnwise __ broadcast of consolidated

All-to-all

one -to-all

all-to-one

point-to-point

Answer: All-to-all

- All nodes collects _ message corresponding to √p nodes to their respectively

√p

p

p+1

p-1

Answer: √p

- It is not possible to port __ for higher dimensional network

Algorithm

hypercube

both

none

Answer: Algorithm

- If we port algorithm to higher dimemsional network it would cause

error

contention

recursion

none

Answer: contention

- In the scatter operation __ node send message to every other node

single

double

triple

none

Answer: single

- The gather Operation is exactly the inverse of _

scatter operation

recursion operation

execution

none

Answer: scatter operation

- Similar communication pattern to all-to-all broadcast except in the_____

reverse order

parallel order

straight order

vertical order

Answer: reverse order

Data analytics mcqs with answers for SPPU

Digital Image Processing MCQ | Basics Of Image Sampling & Quantization

Basic of Digital Image Processing

ALL unite digital Image Processing MCQ

#### HPC MCQ UNIT – 1

**HPC MCQ UNIT -2 **

#### HPC MCQ UNIT – 3

#### HPC MCQ UNIT – 5

#### HPC MCQ UNIT – 6

## READ MORE…

If you found this post useful, don’t forget to share this with your friends, and if you have any query feel free to comment it in the comment section.

Thank you 🙂 Keep Learning !