Scribd
Upload
5 views3 pages

QP HPC Final

The document outlines the exam structure and content for the M.Tech course in High-Performance Computing at The Oxford College of Engineering, Bangalore. It includes various questions related to parallel computing concepts, architectures, communication costs, and algorithms. The exam consists of multiple modules covering topics such as message-passing programming, thread management, and graph theory.

Uploaded by

Thendral
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views3 pages

QP HPC Final

The document outlines the exam structure and content for the M.Tech course in High-Performance Computing at The Oxford College of Engineering, Bangalore. It includes various questions related to parallel computing concepts, architectures, communication costs, and algorithms. The exam consists of multiple modules covering topics such as message-passing programming, thread management, and graph theory.

Uploaded by

Thendral
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Children’s Education Society

THE OXFORD COLLEGE OF ENGINEERING, BANGALORE -560 068


(Approved by AICTE, New Delhi, Accredited by NBA,& NAAC ‘A’ Grade,Affiliated to VTU,
Belagavi-590 018)
Department of Computer Science & Engineering
Outcome Based Education (OBE) and Choice Based Credit System (CBCS), VTU
M.Tech

Subject Code: 22SAM31 Marks: 100 MARKS


Subject Title: High-Performance Computing Exam Hrs: 3 Hours
Mar
Q.No Questions
ks
Q.1 A Discuss the recent trends observed in microprocessor architectures with 10

respect to implicit parallelism.

Q.1 B i. ) What is the scope of parallel computing in addressing


5
computational challenges?

Explain the concept of Routing Mechanisms for


Interconnection Networks.. 5
Q2. A i) Explain the Architecture of an Ideal Parallel 4
Computer Platforms.

ii) Discuss the limitations of memory system performance. 6

Q2. B Explain the Concept of communication costs in parallel machines, 10


and why is minimizing these costs crucial for achieving optimal
parallelism?

Module -2
Q.3 A i. Define the key preliminaries in parallel algorithm design. 10

Q.3 B Explain the characteristics and applications of all-to-all broadcast and


reduction operations. 10

Q.4 A i) Define scatter and gather operations in the context of parallel 5


computing.

iii) Explain the concept of basic communication operations in 5


parallel computing.

Q.4 B Define circular shift as a communication operation in parallel computing. 10

Module-3
Q.5A i). Define the sources of overhead in parallel programs. 4 CO:3 L2
PO:1,2,3,4

ii) Discuss the effect of granularity on the performance of parallel


programs.. 6
CO:3 L2
PO:1,2,3,4

Q.5 B
ii) Discuss the concept of overlapping communication with
computation in parallel programming.
Q.6 A i) Outline the principles of message-passing programming.

ii) Define scalability in the context of parallel systems.

Q.6 B i) Discuss the building blocks of MPI, including send and receive
operations.

Module-4
Q.7 A i) Define the basics of threads in the context of parallel programming.

ii) Explain the fundamental concepts of thread creation and


termination.
Q.7 B Explain the concept of OpenMP and its role in directive-based parallel
programming.
Q.8 A Describe the dense matrix algorithms including matrix-vector 10
multiplication, matrix-matrix multiplication, and solving systems of
linear equations.

Q.8 B Explain the concept of a sorting network and how it functions to 5


achieve parallel sorting.

5
Module-5
Q.9 A i) Explain the concept of Minimum Spanning Tree (MST) in graph 5
theory.

ii) Define the problem of finding single-source shortest paths in a 5


graph.
Q.9 B Discuss how speedup Anomalies is measured and evaluated in the
parallel search algorithms 10

Q.10 Discuss the algorithms for computing all-pairs shortest paths and transitive 10
A
closure.

Q.10 i) Define graph algorithms and discuss the various representations of 5


B graphs.
ii) Discuss the considerations for parallelizing best-first search. 5

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy