Scribd
Upload
22 views9 pages

Department of Artificial Intelligence & Data Science

Uploaded by

Kanmani K
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
22 views9 pages

Department of Artificial Intelligence & Data Science

Uploaded by

Kanmani K
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 9

KGiSL Institute of Technology

(Approved by AICTE, New Delhi; Affiliated to Anna University, Chennai)


Recognized by UGC, Accredited by NBA (IT)
365, KGiSL Campus, Thudiyalur Road, Saravanampatti, Coimbatore – 641035.

Department of Artificial Intelligence & Data Science


Name of the Faculty : Ms.T.Suganya & Dr. S. Kalpana

Subject Name & Code : CS3551 / DISTRIBUTED COMPUTING

Branch & Department : B.Tech & AI&DS

Year & Semester : III / V

Academic Year :2022-23(ODD)


UNIT I INTRODUCTION 8
Introduction: Definition-Relation to Computer System Components – Motivation – 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 of a Distributed System.

UNIT II LOGICAL TIME AND GLOBAL STATE 10


Logical Time: Physical Clock Synchronization: NTP – A Framework for a System of Logical Clocks – Scalar Time – Vector Time;
Message Ordering and Group Communication: Message Ordering Paradigms – Asynchronous Execution with Synchronous
Communication – Synchronous Program Order on Asynchronous System – Group Communication – Causal Order – Total Order;
Global State and Snapshot Recording Algorithms: Introduction – System Model and Definitions – Snapshot Algorithms for FIFO
Channels.

UNIT III DISTRIBUTED MUTEX AND DEADLOCK 10


Distributed Mutual exclusion Algorithms: Introduction – Preliminaries – Lamport’s algorithm – Ricart- Agrawala’s Algorithm –– Token-
Based Algorithms – Suzuki-Kasami’s Broadcast Algorithm; Deadlock Detection in Distributed Systems: Introduction – System Model
– Preliminaries – Models of Deadlocks – Chandy-Misra-Haas Algorithm for the AND model and OR Model.

UNIT IV CONSENSUS AND RECOVERY 10


Consensus and Agreement Algorithms: Problem Definition – Overview of Results – Agreement in a Failure-Free
System(Synchronous and Asynchronous) – Agreement in Synchronous Systems with Failures; Checkpointing and Rollback
Recovery: Introduction – Background and Definitions – Issues in Failure Recovery – Checkpoint-based Recovery – Coordinated
Checkpointing Algorithm - - Algorithm for Asynchronous Checkpointing and Recovery

UNIT V CLOUD COMPUTING 7


Definition of Cloud Computing – Characteristics of Cloud – Cloud Deployment Models – Cloud Service Models – Driving Factors and
Challenges of Cloud – Virtualization – Load Balancing – Scalability and Elasticity – Replication – Monitoring
SYLLABUS

UNIT II LOGICAL TIME AND GLOBAL STATE 10


Logical Time: Physical Clock Synchronization: NTP – A Framework for a
System of Logical Clocks – Scalar Time – Vector Time; Message Ordering and
Group Communication: Message Ordering Paradigms – Asynchronous
Execution with Synchronous Communication – Synchronous Program Order on
Asynchronous System – Group Communication – Causal Order – Total Order;
Global State and Snapshot Recording Algorithms: Introduction – System Model
and Definitions – Snapshot Algorithms for FIFO Channels.
Course Outcomes

OUTCOMES:
Upon the completion of this course, the student will be able to
CO1: Explain the foundations of distributed systems (K2)
CO2: Solve synchronization and state consistency problems (K3)
CO3 Use resource sharing techniques in distributed systems (K3)
CO4: Apply working model of consensus and reliability of distributed systems (K3)
CO5: Explain the fundamentals of cloud computing (K2)
A FRAMEWORK FOR A SYSTEM OF LOGICAL CLOCKS

 A logical clock is a mechanism for


capturing chronological and causal
relationships in a distributed system.

 Distributed systems may have no


physically synchronous global clock, so
a logical clock allows global ordering on
events from different processes in such
systems.

 We always maintain the procedure or an


organization that is planned before. In a
similar way, we should do the operations on
our PCs one by one in an organized way.
A FRAMEWORK FOR A SYSTEM OF LOGICAL CLOCKS

In a system of logical clocks, every process has a logical clock that is
advanced using a set of rules.

Every event is assigned a timestamp and the causality relation between


events can be generally inferred from their timestamps.

The timestamps assigned to events obey the fundamental


monotonicity property; that is if an event “a” causally affects an event
“b”, then the timestamp of “a” is smaller than the timestamp of “b”.
A FRAMEWORK FOR A SYSTEM OF LOGICAL CLOCKS

Definition:
A system of logical clocks consists of a time domain T and a logical clock C. Elements
of T form a partially ordered set over a relation < . This relation is usually called the
happened before or causal precedence.

The logical clock C is a function that maps an event e in a distributed system to an


element in the time domain T, denoted as C(e) and called the timestamp of e, and is
defined as follows: C : H → T,

such that the following property is satisfied:


 For two events ei and ej, ei → ej ⇒ C(ei) < C(ej). This monotonicity property is called
the clock consistency condition.
When T and C satisfy the following condition,
 For two events ei and ej, ei → ej ⇔ C(ei) < C(ej), the system of clocks is said to be
strongly consistent.
A FRAMEWORK FOR A SYSTEM OF LOGICAL CLOCKS

Implementing logical clocks:


The two major issues in implementing logical clocks are:

Data structures: representation of each process

Protocols: rules for updating the data structures to ensure consistent conditions.

Data structures: Each process pi maintains data structures with the given
capabilities:
• A local logical clock (lci), that helps process pi measure its own progress.
• A logical global clock (gci), that is a representation of process pi’s local view of
the logical global time. It allows this process to assign consistent timestamps to
its local events.
A FRAMEWORK FOR A SYSTEM OF LOGICAL CLOCKS

Implementing logical clocks

Protocol:
The protocol ensures that a process’s logical clock, and thus its view of the global
time, is managed consistently with the following rules:

Rule 1: Decides the updates of the logical clock by a process. It controls send,
receive and other operations.

Rule 2: Decides how a process updates its global logical clock to update its view of
the global time and global progress. It dictates what information about the logical time
is given in a message and how this information is used by the receiving process to
update its view of the global time.

You might also like