Scribd
Upload
180 views

Distributed Systems

The document describes a distributed systems course with the following key details: - The course is 3 credits with no practical component and focuses on theory. Prerequisites include data communication and computer networks. - The course objectives are to understand networking protocols in distributed environments, distributed systems principles and practices, evaluating memory impact on parallel algorithms, and designing/implementing distributed algorithms. - Upon completing the course, students will be able to identify distributed system design issues, understand client-server communication models and clock synchronization needs, and apply knowledge of deadlock methods and distributed algorithms.

Uploaded by

Suma Sara Jacob
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
180 views

Distributed Systems

The document describes a distributed systems course with the following key details: - The course is 3 credits with no practical component and focuses on theory. Prerequisites include data communication and computer networks. - The course objectives are to understand networking protocols in distributed environments, distributed systems principles and practices, evaluating memory impact on parallel algorithms, and designing/implementing distributed algorithms. - Upon completing the course, students will be able to identify distributed system design issues, understand client-server communication models and clock synchronization needs, and apply knowledge of deadlock methods and distributed algorithms.

Uploaded by

Suma Sara Jacob
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

20IT701 DISTRIBUTED SYSTEMS 3/0/0/3

Nature of Course Theory


Pre requisites Data Communication and Computer Networks / Computer Networks
Course Objectives:
To understand the basics of networking and the protocols used in distributed
1.
environment.
To have a basic understanding of the principles and practice in the area of
2.
Distributed Systems.
To evaluate the impact of memory on parallel/distributed algorithm
3.
formulations and validate their performance.
4. To gain knowledge on deadlock and how it is resolved in distributed system.
5. To gain knowledge of how to design and implement distributed algorithms.
Course Outcomes
Upon completion of the course, students shall have ability to
Identify various issues in the design and implementation of distributed
CO1 [AP]
systems.
Understand various system models, communication between client
CO2 [U]
and server
Understand issues related to clock Synchronization and the need for
CO3 [U]
global state in distributed systems.
CO4 Apply the knowledge of deadlock methods and its algorithms. [AP]
Infer the architecture, design and implementation of distributed
CO5 [U]
shared memory.
CO6 Apply the various distributed algorithms with its real time applications. [AP]
Course Contents:
Module I Introduction 15
Hours
Definition of a distributed systems, Examples, Resource sharing and the Web, Challenges,
System models, Architectural and fundamental models, Networking Interprocess
communication, External data representation and marshalling, Client-server and Group
communication. Communication -Introduction to Message Passing, Advantages and
features of message passing, Message format, Message Buffering, Remote Procedure
Call, Extended RPC Models, Remote Object Invocation, Message Oriented
Communication.

Module II Processes and Synchronization 15


Hours
Threads, code migration, clock synchronization, logical clocks, global state, Election
algorithms, mutual exclusion, Distributed transaction. Distributed Deadlock Detection
System model, Resources vs. communication deadlocks, deadlock prevention, avoidance,
detection and resolution, Centralized deadlock detection, distributed deadlock detection,
path pushing and edge chasing algorithm. Case Study: Hadoop Distributed File System
(HDFS)

Module III Distributed Shared Memory 15


Hours
Introduction, General architecture of distributed shared memory, Design and
implementation, Issues of DSM, Granularity, structure of shared memory space,
consistency models, thrashing, advantages of DSM Distributed Coordination: Importance,
Ordering of Events, Logical clock, Vector clock, protocols for ordering of messages.
Distributed Algorithms - Synchronous network model - Algorithms: leader election, -
Asynchronous network model - Asynchronous network algorithms: leader election in a ring
and an arbitrary network. Case Study: CORBA (CORBA RMI and Services).
Total Hours 45

Text Books:
Andrew Tanenbaum, Maarten Van Steen, "Distributed System- Principals
1.
Paradigm", Maarten van Steen Publication, 2nd Edition, 2016.
Singhal and Shivratri, "Advanced Concept in Operating Systems", McGraw Hill, 1 st
2.
Edition, 2017.
Reference Books:
Sunita Mahajan, Seema Shah, “Distributed Computing”, Oxford University Press,
1.
2nd Edition, 2013.
Pradeep K. Sinha “Distributed Operating Systems: Concepts and Design”, Prentice
2.
Hall of India Private, 2012.
Web References:
1. https://nptel.ac.in/courses/106/106/106106107/
2. https://onlinecourses.nptel.ac.in/noc21_cs87/preview
3. https://online.stanford.edu/courses/cs244b-distributed-systems

Online Resources:
1. https://www.wiziq.com/tutorials/distributed-computing
2. https://www.youtube.com/watch?v=Y6Ev8GIlbxc
3. https://www.youtube.com/watch?v=Azyizl9w2xo
4. https://www.youtube.com/watch?v=dX2PSA0si5g
5. https://blog.stackpath.com/distributed-system
6. https://www.geeksforgeeks.org/introduction-to-distributed-computing-environment-
dce

Course Articulation Matrix


Course Programme
Programme Outcomes (PO)
Outcome Specific
(CO) Outcomes(PSO)
1 2 3 4 5 6 7 8 9 10 11 12 1 2
1 2 3 2 3 3 3 2 3 3
2 2 2 2 2 3 2 2 2 2
3 2 3 1 3 2 3 2 2 2
4 3 2 2 2 3 2 3 3 2
5 2 2 1 3 2 2 2 2 2
6 2 2 1 2 3 2 2 3 3
Reasonably Moderately
1 2 3 Strongly agreed
agreed agreed

You might also like