ANAND INSTITUTE OF HIGHER TECHNOLOGY

KAZHIPATTUR – 603 103

Department of Computer Science and Engineering

Regulation 2017

Lecture Plan

Course Code & Title: CS8603 & Distributed System

Semester & Branch: V Semester B.E. Computer Science and Engineering

Name of the Faculty member: A.Malathi

Designation & Department: Assistant Professor- II & CSE

Course Objectives :

The students should be made:

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 :

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

1. Elucidate the foundations and issues of distributed systems

2. Understand the various synchronization issues and global state for
distributed systems
3. Understand the Mutual Exclusion and Deadlock detection algorithms in distributed
system
4. Describe the agreement protocols and fault tolerance mechanisms in distributed
systems

5. Describe the features of peer-to-peer and distributed shared memory systems

Assessment Methods followed:

     1. Internal Tests (Monthly Tests) are conducted to assess continuous learning.
     2. Assignments are given to encourage students’ self-learning.
     3. Mini Projects are given to enhance the experiential learning.
     4. End Semester Examination is conducted to assess overall learning by students.

Lecture Date Topic(s) to be covered Teaching aids Teaching

No. (Board / Methodology
LCD) (Lecture
Role play
Group
Discussion
Quiz
Debates
Gamefication)
UNIT I INTRODUCTION

Definition ,Relation to computer Lecture

1 Board
system components
Motivation –Relation to parallel Board Lecture
2
Message-passing systems versus Lecture
shared memory systems Board
3
Primitives for distributed
communication
Synchronous versus asynchronous Role play
4 executions ,Design issues and LCD
challenges.
A distributed program ,A model of LCD Role play
distributed executions
5
Models of communication
networks
Global state – Cuts –Past and future Lecture
6 cones of an event , LCD
Models of process communications
A framework for a system of LCD Lecture
7
logical clocks
Scalar time –Vector time Lecture
8 LCD
9 Unit Test -I

UNIT II MESSAGE ORDERING & SNAPSHOTS

10 Message ordering paradigms Board Role Play

Asynchronous execution with Lecture

11 LCD
synchronous communication
Synchronous program order on an
12 asynchronous system LCD Role Play

Lecture
13 Group communication Board

Lecture
14 Causal order (CO) LCD

Role Play
Global state and snapshot recording
15 LCD
algorithms: Introduction
16 System model and definitions LCD Lecture
17 LCD Lecture
Total order
Snapshot algorithms for FIFO Lecture
18
channels
Unit Test -II
UNIT – III DISTRIBUTED MUTEX & DEADLOCK

Distributed mutual exclusion Role Play

19 Board
algorithms: Introduction
Preliminaries – Lamport‘s Board Lecture
20
algorithm
Ricart-Agrawala algorithm LCD Role Play
21
Maekawa‘s algorithm – Suzuki– Board Role Play
22
Kasami‘s broadcast algorithm.
Deadlock detection in LCD Role Play
23
distributed
Distributed mutual exclusion Board Lecture
24
algorithms: Introduction
LCD Lecture
25 System model – Preliminaries
Models of deadlocks – Knapp‘s Board Lecture
26
classification
Algorithms for the single resource LCD Lecture
27
model
28 the AND model and the OR LCD Lecture
 model
29 Unit Test -III

UNIT IV RECOVERY & CONSENSUS

Checkpointing and rollback recovery: Board Lecture

30 Introduction

Background and definitions – Issues Board Lecture

31
in failure recovery
Checkpoint-based recovery – Log- based Lecture
32 Board
rollback recovery
Coordinated checkpointing Lecture
33 LCD
algorithm
Algorithm for asynchronous LCD Role Play
34
checkpointing and recovery.
Consensus and agreement algorithms: LCD Role Play
35
Problem definition
36 Unit Test - IV

UNIT V P2P & DISTRIBUTED SHARED MEMORY

Peer-to-peer computing and overlay Board Lecture

37
graphs: Introduction
Data indexing and overlays Board Lecture
38

39 Board Lecture
Content addressable networks
40 Distributed shared memory LCD Lecture

Abstraction and advantages LCD Group

41 Discussuion

42 LCD Role Model

Memory consistency models
Shared memory Mutual LCD Lecture
43
Exclusion
44 LCD Lecture
Chord
45 GUI Testing , OO System Testing Board Lecture

46 Unit Test - V
CONTENT BEYOND THE SYLLABUS

Stream oriented Communication LCD Lecture

47
 Hadoop Installation LCD Lecture
48
MINI PROJECTS

DISTRIBUTED COMPUTING IN LCD Experiential

49 TRANSFERRING IMAGES USING Learning
JAVA

Assignments:

Assignment - I

1. Explain in detail about Message passing system

1. Explain in detail about Models of communication networks
2. Design issues and challenges

Assignment – II
1. Ricart-Agrawala algorithm
1. Models of deadlocks
2. Distributed mutual exclusion algorithms

Text books:

1.Kshemkalyani, Ajay D., and Mukesh Singhal. Distributed computing: principles,

algorithms, and systems. Cambridge University Press, 2011
2. George Coulouris, Jean Dollimore and Tim Kindberg, ―Distributed Systems
Concepts and Design‖, Fifth Edition, Pearson Education, 2012.
References Books:
1. Pradeep K Sinha, “Distributed Operating Systems: Concepts and Design”, Prentice
Hall of India, 2007.
2. Mukesh Singhal and Niranjan G. Shivaratri. Advanced concepts in operating
systems. McGraw-Hill, Inc., 1994.
3.Tanenbaum A.S., Van Steen M., ―Distributed Systems: Principles and
Paradigms‖, Pearson Education, 2007
4. Liu M.L., ―Distributed Computing, Principles and Applications‖, Pearson
Education, 2004.
5. Nancy A Lynch, ―Distributed Algorithms‖, Morgan Kaufman Publishers, USA,
2003.
Prepared by: Approved by:

A.Malathi Dr.S.Roselin Mary

(Name & Signature of Faculty member) (Name & Signature of HOD)