Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
7 views2 pages

CS 703 DistributedSystems Syllabus

The course 'Distributed Systems' (CS 703) offers a comprehensive understanding of the principles and models of distributed computing, focusing on scalability, fault tolerance, and communication protocols. It includes assessments through a combination of semester-end examinations and continuous assessments, with a total of 3 credits. Students will learn to define key concepts, apply distributed mutual exclusion approaches, and evaluate performance in distributed systems upon completion of the course.

Uploaded by

anishpujari25
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
7 views2 pages

CS 703 DistributedSystems Syllabus

The course 'Distributed Systems' (CS 703) offers a comprehensive understanding of the principles and models of distributed computing, focusing on scalability, fault tolerance, and communication protocols. It includes assessments through a combination of semester-end examinations and continuous assessments, with a total of 3 credits. Students will learn to define key concepts, apply distributed mutual exclusion approaches, and evaluate performance in distributed systems upon completion of the course.

Uploaded by

anishpujari25
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/ 2

COURSE TITLE Distributed systems CREDITS 3

COURSE
COURSE CODE CS 703 Core L-T-P 1-0-0-8
CATEGORY
LEARNING
Version 2.0 Approval Details BTL-3
LEVEL
ASSESSMENT SCHEME
Semester End
During Semester Assessment (DSA)
Examination
MSE DSA Components Attendance SEE
10% 35% 5% 50%
This course provides an in-depth understanding of fundamental principles and models underlying
the theory, algorithms, and systems aspects of distributed computing. Distributed applications
Course Description
(distributed apps) are applications or software that runs on multiple computers within a network at
the same time and can be stored on servers or with cloud computing.
The Objectives of the course are to:

1. Gain a comprehensive understanding of fundamental concepts in distributed systems,


including scalability, fault tolerance, concurrency, and consistency.
2. Learn about different principles used in designing distributed systems, such as Logical
Time, logical clock framework.
Course Objective 3. Analyses various communication protocols and distributed mutual Exclusion mechanisms
4. Able to apply inter-process communication in distributed systems, deadlock handling,
message passing.
5. Analyze techniques for managing concurrency and achieving parallelism in distributed
systems and Fault Tolerance algorithms.

Upon completion of this course, the students will be able to:


1. Define and explain fundamental concepts of distributed systems
2. Understanding logical clock, global state system model
Course Outcome
3. Applying the different distributed mutual Exclusion approaches
4. Evaluate the performance and scalability of rollback and checkpoint recovery
5. Understanding the concepts of Fault tolerance
Prerequisites:

CO, PO AND PSO MAPPING


CO PO -1 PO-2 PO-3 PO-4 PO- PO-6 PO- PO-8 PO-9 PO -10 PO-11 PO- PSO-
5 7 12 PSO-2 PSO-3
1
CO-1 3 2 2 2 - - - - - - - 3 2 -
CO-2 3 3 - - - - - - - - - 3 3 - -
CO-3 3 2 2 - - - - - - - - 3 3 2 -
CO-4 3 3 2 2 - - - 3 - - - 3 3 1 3
CO-5 3 3 2 2 - - - - 2 2 - - 3 2 3
1: Weakly related, 2: Moderately related and 3: Strongly related

MODULE 1 (9hrs)
Introduction to Distributed Systems - Applications - Message Passing: Models – Events – Types.
Message passing algorithm- Leader Election in rings: Ring Networks - The LeLann-Chang-Robert’s CO-1
algorithm - The Hirschberg-Sinclair algorithm-Distributed Models-Communication Network models:
FIFO - non-FIFO - causal ordering
MODULE 2 (9 hrs)

Logical Time: Logical clock- Frameworks-Types- Implementation - Size of vector clock- matrix
CO-2
clock- virtual time- Physical clock synchronization- Global State: System model- Consistent global
state – Issues – Models of Communication-Snapshot algorithms: Chandy-Lamport algorithm
Name Of the Faculty Handling the Course:

Dr Manoj Kumar Rawat

Dr. K Sasi Kala Rani

You might also like