DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

CS8603 DISTRIBUTED SYSTEMS

(R2017)

UNIT NOTES

[ I to V Units ]

(FOR VI SEM CSE)

PREPARED BY

K.ASHOK KUMAR
Associate Professor/CSE

FACU LTY INCHARGE ACADEMIC COORDINATOR HoD

DEAN ACADEMICS PRINCIPAL

1
CS8603 DISTRIBUTED SYSTEMS LT PC
3 00 3

OBJECTIVES:
 To understand the foundations of distributed systems.
 To learn issues related to clock Synchronization and the need for global state in
distributed systems.
 To learn distributed mutual exclusion and deadlock detection algorithms.
 To understand the significance of agreement, fault tolerance and recovery protocols
in Distributed Systems.
 To learn the characteristics of peer-to-peer and distributed shared memory systems.

UNIT I 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 and challenges. A model of distributed computations: A distributed program –A
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 system –Group communication – Causal order (CO) - Total order. Global
state and snapshot recording algorithms: Introduction –System model and definitions –
Snapshot algorithms for FIFO channels

UNIT III DISTRIBUTED MUTEX & DEADLOCK 9

Distributed mutual exclusion algorithms: Introduction – Preliminaries – Lamport‘s
algorithm – Ricart-Agrawala algorithm – Maekawa‘s algorithm – Suzuki–Kasami‘s broadcast
algorithm. Deadlock detection 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.

UNIT IV 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 – 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 with failures.

2
UNIT V P2P & DISTRIBUTED SHARED MEMORY 9
Peer-to-peer computing and overlay graphs: Introduction – Data indexing and overlays –
Chord – Content addressable networks – Tapestry. Distributed shared memory:
Abstraction and advantages – Memory consistency models –Shared memory Mutual
Exclusion.
TOTAL: 45 PERIODS
OUTCOMES: At the end of this course, the students will be able to:
 Elucidate the foundations and issues of distributed systems
 Understand the various synchronization issues and global state for distributed
systems.
 Understand the Mutual Exclusion and Deadlock detection algorithms in distributed
systems
 Describe the agreement protocols and fault tolerance mechanisms in distributed
systems.
 Describe the features of peer-to-peer and distributed shared memory systems

TEXTBOOK:
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:
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

3
 SENGUNTHAR ENGINEERING COLLEGE-TIRUCHENGODE
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
LECTURE PLAN
Subject Code : CS8603
Subject Name : DISTRIBUTED SYSTEMS (R2017)
Name of faculty & Designation : K.ASHOKKUMAR, AsP/CSE
Course : VI semester B.E CSE
Academic Year : 2019-2020

RECOMMENDED TEXT BOOKS/REFERENCE BOOKS

S.No Title of the book Author Reference

1 “Distributed computing: Kshemkalyani, Ajay T1
principles, algorithms, and D., and Mukesh
systems”, Cambridge University Singhal
Press, 2011.
2 " Distributed Systems Concepts George Coulouris, T2
and Design ", Fifth Edition, Jean Dollimore and
Pearson Education, 2012 Tim Kindberg

Topic Reference No of Teaching

hours aids
UNIT I
Introduction: Definition –Relation to computer T1 1 Chalk & Talk
system components –Motivation –Relation to
parallel systems – Message-passing systems
T1 2 Chalk & Talk
versus shared memory systems –Primitives for
distributed communication –Synchronous versus
asynchronous executions –Design issues and T1 1 Chalk & Talk
challenges. A model of distributed
computations: A distributed program –A model of T1 2 Chalk & Talk
distributed executions –Models of communication
networks –Global state – Cuts –Past and future T1 2 Chalk & Talk
cones of an event –Models of process
communications. Logical Time: A framework for a
system of logical clocks –Scalar time –Vector time T1 2 Slide/PPT
– Physical clock synchronization: NTP.
Management – Stepwise Project Planning.
UNIT II
Message ordering and group communication: R1 2 Chalk & Talk

4
Message ordering paradigms –Asynchronous
execution with synchronous communication – R1 2 Chalk & Talk
Synchronous program order on an asynchronous
system –Group communication – Causal order R1 2 Chalk & Talk
(CO) - Total order. Global state and snapshot
recording algorithms: Introduction –System R1 2 Slide/PPT
model and definitions –Snapshot algorithms for R1 1 Slide/PPT
FIFO channels
UNIT III
Distributed mutual exclusion algorithms: T1 1 Chalk & Talk
Introduction – Preliminaries – Lamport‘s algorithm T1 1 Chalk & Talk
– Ricart-Agrawala algorithm – Maekawa‘s T1 1 Slide/PPT
algorithm – Suzuki–Kasami‘s broadcast algorithm. T1 1 Slide/PPT
Deadlock detection in distributed systems: T1 1 Slide/PPT
Introduction – System model – Preliminaries – T1 2 Slide/PPT
Models of deadlocks – Knapp‘s classification – T1 1 Chalk & Talk
Algorithms for the single resource model, the AND T1 1 Slide/PPT
model and the OR model.
UNIT IV

Checkpointing and rollback recovery:

Introduction – Background and definitions – T1 1 Chalk & Talk
Issues in failure recovery – Checkpoint-based T1 1 Chalk & Talk
T1 1 Slide/PPT
recovery – Log-based rollback recovery –
T1 1 Slide/PPT
Coordinated checkpointing algorithm – Algorithm T1 1 Slide/PPT
for asynchronous checkpointing and recovery. T1 1 Slide/PPT
Consensus and agreement algorithms: T1 1 Chalk & Talk
Problem definition – Overview of results – T1 1 Slide/PPT
Agreement in a failure – free system – Agreement 1 Chalk & Talk
in synchronous systems with failures.

UNIT V Chalk & Talk

Peer-to-peer computing and overlay graphs: T1 1 Chalk & Talk
Introduction – Data indexing and overlays – Chord T1 1 Slide/PPT
– Content addressable networks – Tapestry. T1 1 Slide/PPT
T1 1 Slide/PPT
Distributed shared memory: Abstraction and
T1 1 Slide/PPT
advantages – Memory consistency models – T1 2 Slide/PPT
Shared memory Mutual Exclusion. T1 2 Chalk & Talk

TOTAL 45
REVISION 05
TOTAL 50