QUESTION BANK

Programme : B. Tech Programme : Winter 2023-24

Course : Parallel and Distributed Computing Course : CSE4019
S. No Questions
Unit-1
1. List and explain the Key Concepts and Challenges in parallel computing.
2. Identify the need for Parallelism. Explain with neat sketch for serial and parallel computing in details.
3. Classify the Types of parallel computing and its applications.
4. Describe the advantages and disadvantages of parallel computing.
5. Demonstrate with neat sketch for Shared memory and Distributed memory in details.
6. Describe with sketch for Flynn’s Taxonomy. Explain the features, advantages and disadvantages.
7. Discuss with neat diagram for Multicore Processor Architecture and its advantages in details.
8. Summarize the Performance Metrics for Processors.
9. Classify the seven types of parallel programming models and its neat sketch in details.
10. Identify the need for Parallel Algorithms and its types.
11. Identify the need for OpenMP. Implement the Vector addition and Dot Product using OpenMP with
sample output.
12. Implement the Loop work sharing and sections work sharing using OpenMP with sample output.
Unit-2
1. Identify the Nontrivial parallel algorithm features. Explain the parallel algorithms and their design
considerations in details.
2. Summarize the preliminaries in parallel algorithm design. Describe the concepts of Decomposition,
Tasks, and Dependency Graphs.
3. Discuss the concepts of Granularity, Concurrency, and Task-Interaction in details.
4. Classify the seven types of decomposition techniques with neat sketch in details.
5. Demonstrate with neat sketch for Mapping Techniques for Load balancing.
6. Differentiate static and dynamic mapping. Explain the Schemes for Dynamic Mapping in details.
7. Discuss with neat sketch for Synchronous Parallel Processing.
8. Explain with neat sketch for Vector Supercomputers and SIMD Computers in details.
9. Describe with neat diagram for SIMD Architecture and its SIMD Parallel Process.
10. Summarize with neat diagram for programming principles and its common programming principles.
11. Implement the combined parallel loop reduction and orphaned parallel loop reduction using OpenMP
with sample output.
12. Implement the Matrix multiply operations using OpenMP with sample output.
Unit-3
1. Describe with neat sketch for Distributed Systems and its types.
2. Discuss the Characteristics of Distributed System and its Challenges in details.
3. Classify the Types of Distributed Computing System Models with neat diagram.
4. Demonstrate with neat sketch for Remote Procedure Call (RPC)
5. Discuss in details about Distributed Systems Hardware and Software.
6. Summarize the Design Issues of Distributed System in details.
7. Demonstrate with neat sketch for Layered Protocols in details.

Question Bank Parallel and Distributed Computing Page 1 of 2

8. Discuss the steps involved to implement Remote Procedure call with neat diagram.
9. Describe with neat sketch for Remote Object Invocation in details.
10. Demonstrate with neat sketch for Message Oriented Communication.
11. Summarize with neat sketch for stream oriented communication.
12. Describe with neat sketch for Parallel Random Access Machine model with architecture.
Unit-4
1. Classify and explain the distributed systems resource management techniques with neat sketch.
2. Demonstrate the desirable features for load balancing algorithm in details.
3. Illustrate and explain the process management in distributed system and its tasks involved.
4. Describe how the process management is done in distributed systems.
5. Demonstrate with neat sketch for process migration in distributed system and its methods involved.
6. Describe with neat sketch for threads in distributed systems with details. Summarize with neat sketch
for virtualization in details.
7. Discuss with neat sketch for clients and servers in distributed systems in details.
8. Summarize with neat sketch for code migration in distributed systems.
9. Classify the types of synchronization algorithms and explain each.
10. Summarize the concept of Election algorithms, Consensus and Related Problems in details.
Unit-5
1. Discuss with neat sketch for nested distributed transactions in details.
2. Classify and explain the types of concurrency control mechanisms in details.
3. Describe the need for optimistic concurrency control methods.
4. Demonstrate the timestamp ordering distributed transactions mention the advantages and
disadvantages.
5. Discuss with neat sketch for atomic commit protocol and two phase commit protocol in distributed
system.
6. Demonstrate with neat sketch for working of distributed file system and its features, applications in
details.
7. Classify and explain the types file models and file accessing models in distributed system. Summarize
the types of File Replication in Distributed File Systems.
8. Discuss with neat sketch for file caching in distributed file systems and its advantages, disadvantages in
details.
9. Demonstrate with neat sketch for network file system and andrew file system in details. Compare
network file system and andrew file system.
10. Discuss with neat sketch for Hadoop distributed file system and map reduce in details. Differentiate
Hadoop distributed file system and map reduce.
HAPPY LEARNING

Question Bank Parallel and Distributed Computing Page 2 of 2