Scribd
Upload
367 views2 pages

3710213

This document outlines the course details for the Distributed Systems elective course. The course introduces traditional and distributed computing systems, covering key topics like communication models, synchronization, remote method invocation, common object request broker architecture, distributed file systems, and distributed shared memory. Students will learn how to design distributed systems and address issues like concurrency, fault tolerance, and attacks. The course aims to help students understand distributed architectures and implement applications using sockets, RMI, and CORBA. Experiments include concurrent client-server programs, distributed counter programs, and distributed computing algorithms.

Uploaded by

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

3710213

This document outlines the course details for the Distributed Systems elective course. The course introduces traditional and distributed computing systems, covering key topics like communication models, synchronization, remote method invocation, common object request broker architecture, distributed file systems, and distributed shared memory. Students will learn how to design distributed systems and address issues like concurrency, fault tolerance, and attacks. The course aims to help students understand distributed architectures and implement applications using sockets, RMI, and CORBA. Experiments include concurrent client-server programs, distributed counter programs, and distributed computing algorithms.

Uploaded by

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

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.

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