3710213_merged

Download as pdf or txt
Download as pdf or txt
You are on page 1of 7

GUJARAT TECHNOLOGICAL UNIVERSITY

Computer Engineering (Software Engineering)


Distributed Systems
SUBJECT CODE: 3710213

Type of course: Elective

Prerequisite: Operating System, Computer Network,Data Structures and Algorithms

Rationale: This subject will give introduction to traditional and distributed computing system. Students
will be introduced to various issues in design of distributed system. They will also learn how to mitigate
those risks and attacks.

Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks Total


L T P C Theory Marks Practical Marks Marks
ESE(E) PA (M) PA (V) PA (I)
3 0 2 4 70 30 30 20 150

Content:

Sr. Content Total % Weightage


No Hrs

1 Introduction to DS: Introduction to Distributed Systems, 3 8%


Distributed system models, Design issues in DS

2 Communication in Distributed System:Inter process 7 15%


communication: Message passing model, Remote procedure call
and implementation issues, Point to point and Group communication
, Client Server model & its implementation, Socket programming,
Case Studies: SUN RPC, DEC RPC

3 Synchronization in distributed systems: Introduction, Temporal 8 15%


ordering of events, Clock synchronization, mutual exclusion,
Deadlock in distributed systems, Election algorithms

4 Remote Method Invocation: Introduction, Java RMI Architecture, 3 8%


API for Java RMI, Client Callback, Stub downloading

5 Common Object Request Broker Architecture: Introduction, 4 10%


Interface, Inter-ORB Protocol, Object server and object client,
Naming service, Object service,

6 Processes and processors in distributed systems: Threads, system 8 15%


model, processor allocation, scheduling in distributed systems: Load
balancing and sharing approach, fault tolerance, Real time
distributed systems, Process migration and related issues
7 Distributed File Systems: Introduction, features & goal of 8 15%
distributed file system, file models, file accessing models, file
sharing semantics, file caching scheme, file replication, fault
tolerance, trends in distributed file system, case study- HDFS.

8 Distributed Shared Memory: Introduction, general architecture of 5 10%


DSM systems, design and implementation issues of DSM,
granularity, structure of shared memory space, consistency models,
replacement strategy, thrashing

9 Advanced Topics: Simple Object Access Protocol, Distributed 2 4%


Computing Paradigm (Message queue system, mobile agent, object
spaces)

Reference Books:

1. “Distributed Computing – Principles and Applications”, M. L. Liu, Pearson.


2. “Distributed Operating Systems Concepts and Design” , Pradeep K Sinha, PHI
3. “Distributed Systems Concepts and Design “ George Colouris, Jean Dollimore, Tim Kindberg, Pearson

Course Outcome:

After learning the course the students should be able to:


 Understand the difference between traditional client server architecture and distributed architecture
 Understand the importance and issues of distributed system
 Implement socket programing, RMI and CORBA

List of Experiments:
1. Write a Program to implement Concurrent Echo Client Server Application.
2. Write a Program to implement Concurrent Day Time Server Application.
3. Write a program to solve Producer-Consumer Problem using thread.
4. Write a program to implement Calculator using Socket in java.
5. Implement RPC Programming.
6. Implementation of Server that adds given two values by the clients using Java RMI.
7. Write a program to create CORBA based client server application
8. Implementing Bully Election algorithm for synchronization
9. Implementing Ring Election algorithm for synchronization
10. Write a Program to Increment a Counter in Shared Memory.
ssSeat No./Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY


ME - SEMESTER– 1 • EXAMINATION – SUMMER - 2024

Subject Code:3710213 Date: 24 Jun 2024


Subject Name:Distributed Systems
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questiossns.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) Explain all forms of transparency parameter in distributed operating 07


systems.
(b) Briefly explain the concept of stateful and stateless servers with diagram 07

Q.2 (a) Explain IPC Synchronization in detail. 07


(b) Explain circuit switching and packet switching. Mention the differences 07
between circuit switching and packet switching.
OR
(b) Differentiate between monolithic kernel and microkernel approaches for 07
designing distributed operating system.

Q.3 (a) Explain the significance of wait-for graph with respect to 07


deadlock.
(b) Explain Berkley clock Synchronization algorithm with an example. 07
OR
Q.3 (a) What will happen in a bully algorithm for electing a coordinator 07
when two or more process almost simultaneously discover that the
coordinator has crashed? Suggest some suitable mechanism.
(b) What is a RPC? Explain RPC Execution process in detail with 07
diagram.

Q.4 (a) Differentiate RMI and RPC with example in detail. 07

(b) What is the role of “binding agent” in client server binding? Explain 07
types of binding in detail.
OR
Q.4 (a) Which are the different techniques to avoid deadlock in 07
Distributed Operating System?
(b) Explain name space and name server. 07

Q.5 (a) Which are the different types of process scheduling techniques? Explain 07
desirable features for good scheduling algorithm.
(b) Explain the technique to avoid the faults in distributed systems 07
OR
Q.5 (a) Explain the causal consistency model for a distributed shared memory 07
system.
(b) What is load balancing? List the load balancing techniques and discuss 07
any two of them.

*************

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY


ME - SEMESTER– 1 • EXAMINATION – WINTER - 2023

Subject Code:3710213 Date: 25 Jan 2024


Subject Name:Distributed Systems
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY


ME - SEMESTER– 1 EXAMINATION – SUMMER - 2023

Subject Code:3710213 Date:15 Jul 2023


Subject Name: Distributed Systems
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) List out the advantages & disadvantages of Distributed System (DS). 07
(b) Define Thread. Explain User Level Thread & Kernel Level Thread. 07
Q.2 (a) Briefly explain the concept of stateful and stateless servers with suitable diagram. 07
(b) Explain the various issues in designing Load Sharing Algorithms. 07
OR
(b) Explain Berkley clock Synchronization algorithm with an example. 07
Q.3 (a) What is process migration? List out the advantages of process migration. 07
(b) Explain how mutual exclusion is handled in distributed system. 07
OR
Q.3 (a) List out various types of Consistency Models in Distributed Shared Memory 07
(DSM) and explain any two of them with suitable diagram.
(b) Write a short note on Hadoop Distributed File System (HDFS). 07
Q.4 (a) What is the need of Load Balancing in Distributed System? List out various load 07
balancing techniques.
(b) Describe the Distributed Deadlock Detection Algorithms. 07
OR
Q.4 (a) Define Thrashing. Explain various approaches to solve Thrashing in DSM. 07
(b) What is Stub? How a Stub can be generated? Also explain how stub helps user 07
in making RPC mechanism transparent.
Q.5 (a) What is the goal of Election Algorithms? Explain Bully Election Algorithm in 07
depth.
(b) Explain JAVA RMI Architecture. 07
OR
Q.5 (a) Explain File Caching. Compare it with File Replication. List out the advantages 07
of file replication in Distributed File System (DFS).
(b) Write a short note on CORBA – ORB Architecture. 07

*************

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY


ME - SEMESTER– 1• EXAMINATION – WINTER - 2022

Subject Code: 3710213 Date: 27 Feb 2023


Subject Name: Distributed Systems
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) Define distributed system. What is main motivation of distributed system? 07
Explain advantages and disadvantages of distributed systems.
(b) Explain IPC Synchronization in detail. 07
Q.2 (a) What is RMI? What are the main features of Java RMI? Discuss the various 07
components and the process of RMI execution.
(b) What is threading? Explain Thread model in distributed System. 07
OR
(b) Explain CORBA – ORB Architecture. 07
Q.3 (a) What is ordered message delivery? Discus different types of message ordering 07
(b) Explain Berkley clock Synchronization algorithm with an example 07
OR
Q.3 (a) Differentiate between monolithic kernel and microkernel approaches for 07
designing distributed operating system.
(b) Why mutual exclusion is more complex in distributed systems? Categorize and 07
compare mutual exclusion algorithms.
Q.4 (a) List file Accessing models. Discuss any two of them. 07
(b) Explain the general architecture of DSM. 07
OR
Q.4 (a) What is process migration? Explain address transport mechanism with freezing 07
technique.
(b) Which are the different techniques to avoid deadlock in Distributed Operating 07
System.
Q.5 (a) What is the main cause of threshing in a DSM system? Discuss the methods to 07
resolve threshing problem in DSM system
(b) Explain various file sharing semantics. 07
OR
Q.5 (a) Write the advantages of distributed shared memory. Define HDSM and explain 07
Ring based multi-processor.
(b) Explain the technique to avoid the faults in distributed systems. 07

*************

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY


ME - SEMESTER– 1 (NEW) • EXAMINATION – SUMMER - 2022

Subject Code:3710213 Date: 28 Jul 2022


Subject Name:Distributed Systems
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) List out the Design issues in Distributed System. Explain Scalability in 07
detail.
(b) Compare Centralized and Distributed System and Discuss real time 07
applications of distributed system.
Q.2 (a) Differentiate between monolithic kernel and microkernel approaches for 07
designing distributed operating system.
(b) Explain IPC Synchronization in detail. 07
OR
(b) Explain Election Algorithm for Synchronization in Distributed System. 07

Q.3 (a) Explain RPC implementation. Also explain various methods of 07


generating stubs.
(b) Which are the different techniques to avoid deadlock in Distributed 07
Operating System?
OR
Q.3 (a) Differentiate between primitive and non primitive process migration. 07
What are their relative advantages and disadvantages?
(b) What is the role of “binding agent” in client server binding? Explain types 07
of binding in detail.

Q.4 (a) Explain the issues in designing load sharing algorithms. 07


(b) Explain the DSM system architecture. How does granularity affect DSM 07
system performance?
OR
Q.4 (a) What is ordered message delivery? Discus different types of message 07
ordering
(b) Explain the technique to avoid the faults in distributed systems 07

Q.5 (a) Define Thrashing in DSM. Explain methods for solving thrashing in 07
DSM.
(b) Explain various file sharing semantics. 07
OR
Q.5 (a) Explain SOAP with its architecture. 07
(b) Explain the causal consistency model for a distributed shared memory 07
system.
*************

You might also like