COURSE DATA SHEET

PROGRAM: COMPUTER SCIENCE AND ENGINEERING DEGREE: BE

COURSE: DISTRIBUTED SYSTEMS SEMESTER: III CREDITS: 3
COURSE CODE: CS8603 REGULATION: 2017 COURSE TYPE: CORE /ELECTIVE / BREADTH/ S&H
COURSE AREA/DOMAIN: CONTACT HOURS: 3 hours/Week.
CORRESPONDING LAB COURSE CODE (IF ANY): LAB COURSE NAME (IF ANY):

SYLLABUS:
UNIT DETAILS HOURS
INTRODUCTION 9 Introduction: Definition –Relation to computer system
components –Motivation –Relation to parallel systems – Message-passing
systems versus shared memory systems –Primitives for distributed
communication –Synchronous versus asynchronous executions –Design issues
I and challenges. A model of distributed computations: A distributed program –A 9

model of distributed executions –Models of communication networks –Global

state – Cuts –Past and future cones of an event –Models of process
communications. Logical Time: A framework for a system of logical clocks –Scalar
time –Vector time – Physical clock synchronization: NTP.
UNIT II MESSAGE ORDERING & SNAPSHOTS 9 Message ordering and group
communication: Message ordering paradigms –Asynchronous execution with
synchronous communication –Synchronous program order on an asynchronous
II 9
system –Group communication – Causal order (CO) - Total order. Global state and
snapshot recording algorithms: Introduction –System model and definitions –
Snapshot algorithms for FIFO channels
DISTRIBUTED MUTEX & DEADLOCK 9 Distributed mutual exclusion algorithms:
Introduction – Preliminaries – Lamport‘s algorithm – RicartAgrawala algorithm –
Maekawa‘s algorithm – Suzuki–Kasami‘s broadcast algorithm. Deadlock detection
III 9
in distributed systems: Introduction – System model – Preliminaries – Models of
deadlocks – Knapp‘s classification – Algorithms for the single resource model, the
AND model and the OR model.
RECOVERY & CONSENSUS 9 Checkpointing and rollback recovery: Introduction –
Background and definitions – Issues in failure recovery – Checkpoint-based
recovery – Log-based rollback recovery – Coordinated checkpointing algorithm –
IV 9
Algorithm for asynchronous checkpointing and recovery. Consensus and
agreement algorithms: Problem definition – Overview of results – Agreement in a
failure – free system – Agreement in synchronous systems
P2P & DISTRIBUTED SHARED MEMORY 9 Peer-to-peer computing and overlay
graphs: Introduction – Data indexing and overlays – Chord – Content addressable
V 9
networks – Tapestry. Distributed shared memory: Abstraction and advantages –
Memory consistency models –Shared memory Mutual Exclusion.
TOTAL HOURS 45

TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
TEXT BOOK: T1.Kshemkalyani, Ajay D., and Mukesh Singhal. Distributed
T
computing: principles, algorithms, and systems. Cambridge University Press,
2011 T2. George Coulouris, Jean Dollimore and Tim Kindberg, ―Distributed
Systems Concepts and Design‖, Fifth Edition, Pearson Education, 2012
R REFERENCES: R1. Pradeep K Sinha, “Distributed Operating Systems:
Concepts and Design”, Prentice Hall of India, 2007. R2. Mukesh Singhal and
Niranjan G. Shivaratri. Advanced concepts in operating systems. McGraw-Hill,
 Inc., 1994. R3.Tanenbaum A.S., Van Steen M., ―Distributed Systems:
Principles and Paradigms‖, Pearson Education, 2007 R4. Liu M.L.,
―Distributed Computing, Principles and Applications‖, Pearson Education,
2004. R5. Nancy A Lynch, ―Distributed Algorithms‖, Morgan Kaufman
Publishers, USA, 2003.

COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
NIL NIL NIL NIL

COURSE OBJECTIVES:
1 To understand the foundations of distributed systems
2 To learn issues related to clock Synchronization and the need for global state in
distributed systems.
3 To learn distributed mutual exclusion and deadlock detection algorithms.
4 To understand the significance of agreement, fault tolerance and recovery
protocols in Distributed Systems.
5 To learn the characteristics of peer-to-peer and distributed shared memory
systems
COURSE OUTCOMES:
SNO DESCRIPTION PO(1..12) & PSO(1..2)
MAPPING
C311.1 Elucidate the foundations and issues of distributed systems PO1, PO2, PSO1

C311.2 Understand the various synchronization issues and global state for PO1, PO2, PSO1

distributed systems
C311.3 Understand the Mutual Exclusion and Deadlock detection algorithms in PO1, PO2, PO3, PSO1,
PSO2
distributed systems
C311.4 Describe the agreement protocols and fault tolerance mechanisms in PO1, PO2, PO3, PSO1,
PSO2
distributed systems.
C311.5 Describe the features of peer PO1, PO2, PSO1, PSO2

COURSE OUTCOMES VS POS MAPPING (DETAILED; HIGH:3; MEDIUM:2; LOW:1):

SNO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO PSO
1 2
C311.
2 1 2
1
C311.
2 1 3
2
C311.
3 2 1 3 2
3
C311.
3 2 1 3 2
4
C311.
3 2 3 2
5
C311* 3 2 1 3 2
* For Entire Course, PO /PSO Mapping; 1 (Low); 2(Medium); 3(High) Contribution to PO/PSO

JUSTIFICATION FOR MAPPING

SNO PO/PSO MAPPED JUSTIFICATION
Student will be able to understand the basic knowledge of distributed
C311.1 PO1 system
C311.1 PO2 Student will be able to analyze the challenges in distributed system
C311.1 PSO1
C311.2 Student will be able to understand the message ordering, global state,
PO1 cuts and algorithms involved.
C311.2 PO2 Student will be able to analyze the global state messages for consistency.
C311.2 PSO1
C311.3 Student will be able to understand the mutual exclusion and deadlock
PO1 detection algorithms
C311.3 PO2
Student will be able to analyze the system for mutual exclusion and
deadlock detection algorithms.
C311.3 PO3
Student will be able to evaluate the system for mutual exclusion and
deadlock detection algorithms.
C311.3 PSO1
C311.3 PSO2
C311.4 PO1
Student will be able to understand the failures and recovery algorithms
for failures in distributed systems.
C311.4 PO2
Student will be able to analyze the system for failure with the
algorithms.
C311.4 PSO1
C311.4 PSO2
C311.5 PO1
Student will be able to understand the features of peer systems and
shared memory distributed systems.
C311.5 PO2 Student will be able to analyze the peer systems
C311.5 PSO1
C311.5 PSO2

GAPES IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS, POs:

PROPOSED
SNO DESCRIPTION
ACTIONS
1 Performance evaluation of distributed systems Assignment
2 Distributed Operating system Assignment
3
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

1 Performance evaluation of distributed systems
2 Distributed Operating system
3

WEB SOURCE REFERENCES:

1 W1: http://nptel.ac.in
2 W2: http://www.cdk5.net/wp/references
3
4

DELIVERY/INSTRUCTIONAL METHODOLOGIES:
☐ CHALK & TALK ☐ STUD. ASSIGNMENT ☐ WEB RESOURCES ☐ NPTEL/OTHERS
☐ LCD/SMART BOARDS ☐ STUD. SEMINARS ☐ ADD-ON COURSES ☐ WEBNIARS

ASSESSMENT METHODOLOGIES-DIRECT
☐ ASSIGNMENTS ☐ STUD. SEMINARS ☐ TESTS/MODEL EXAMS ☐ UNIV. EXAMINATION
☐ STUD. LAB PRACTICES ☐ STUD. VIVA ☐ MINI/MAJOR PROJECTS ☐ CERTIFICATIONS
☐ ADD-ON COURSES ☐ OTHERS
ASSESSMENT METHODOLOGIES-INDIRECT
☐ ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ☐ STUDENT FEEDBACK ON FACULTY (TWICE)
ONCE)
☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS ☐ OTHERS

INNOVATIONS IN TEACHING/LEARNING/EVALUATION PROCESSES:

1. Google classroom
2. Video Lectures
3. Power point presentation with animation to improve student’s visualization
4. Weekly - Talk for a minute session on any distributed system topic
5. Assignment on content beyond the syllabus.

Prepared by Approved
by
(Faculty) (HOD)

COURSE FILE-CONTENTS

1. PREFACE OF THE SUBJECT

2. INSTITUTE V/M,DEPARTMENT V/M ,PSO, PEO & PO STATEMENTS
3. COURSE INFORMATION SHEET
4. TIME TABLE WITH INDIVIDUAL WORK LOAD
5. TENTATIVE LESSON PLAN
6. LESSON PLAN AND EXECUTION.(IF ANY DEVIATION MAKEUP
CLASS)
7. LECTURE NOTES
8. OHP/PPT/SUBJECT CDS
9. TOPIC BEYOND SYLLABUS WITH REFERENCE DETAILS.
10. GAP IN SYLLABUS – PLAN AND EXECUTION.
11. UNIVERSITY QUESTION PAPERS WITH ANSWER KEY.
12. INTERNAL QUESTION PAPER WITH ANSWER KEY.
 13. ASSIGNMENT TOPICS WITH SUBMISSION DATES.
14. INTERNAL ASSESMENT MARK RECORDS
15. STUDENTS NAME LIST-COMMON AND CATEGORYWISE
16. REMEDIAL CLASS PLAN AND CONTINOUS EVALUATION
RECORDS.
17. COURSE HAND OUT
18. DELIVERY MONITORING.
19. COURSE ASSESMENT SHEET
20. SAMPLE ASSIGNMENTS.
21. TUTORIAL SHEETS
22. SAMPLE ANSWER SHEETS.

LAB MANUAL…
1) Institute V/M; Department V/M/PEO; PO/PSO Statements (1st 3 Pages)
2) Lab Course Syllabus
3) Index page with
a. University prescribed lab experiments
b. 2 or more Advanced experiments (prescribed by the faculty)
c. 2 or more Design Experiments (prescribed by the faculty).
d. 5 or 10 or more Open-ended Experiments (Problem alone to be defined).
4) Students Lab Manual and Teachers Lab Manual Preferable!
5) 1 Lab Manual with Master Readings has to be maintained.
6) Properly corrected students’ 2 lab records along with students’ observation notes are
to be maintained.