Scribd
Upload
14 views

LM11

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
14 views

LM11

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/ 15

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)
MESSAGE ORDERING AND GROUP COMMUNICATION

 As the distributed systems are a network of systems at various physical


locations, the coordination between them should always be preserved.

 The message ordering means the order of delivering the messages to the
intended recipients.

 The common message order schemes are First in First out (FIFO), non FIFO,
causal order and synchronous order.

 In case of group communication with multicasting, the causal and total ordering
scheme is followed.

 It is also essential to define the behavior of the system in case of failures.


MESSAGE ORDERING AND GROUP COMMUNICATION

Notations
MESSAGE ORDERING AND GROUP COMMUNICATION

Message Ordering Paradigms


 The order of delivery of messages in a distributed system is an important
aspect of system executions because it determines the messaging behavior
that can be expected by the distributed program.

 The message orderings are

(i) non-FIFO
(ii) FIFO
(iii) causal order
(iv) synchronous order
MESSAGE ORDERING AND GROUP COMMUNICATION

Asynchronous Executions

An asynchronous execution (or A-execution) is an execution (E, ≺) for which the
causality relation is a partial order.

There cannot be any causal relationship between events in asynchronous execution.

On any Logical Link ,the messages can be delivered in any order not necessarily in
FIFO- Non FIFO Execution.

Though there is a physical link that delivers the messages sent on it in FIFO order
(FIFO Execution)due to the physical properties of the medium, a logical link may be
formed as a composite of physical links and multiple paths may exist between the two
end points of the logical link.
MESSAGE ORDERING AND GROUP COMMUNICATION
MESSAGE ORDERING AND GROUP COMMUNICATION

1. FIFO executions

 On any logical link in the system, messages are necessarily delivered in the order in
which they are sent.

 Although the logical link is inherently non FIFO, most network protocols provide a
connection-oriented service at the transport layer.

 The sender assigns and appends a <sequence_num, connection_id>tuple to each


message. The receiver uses a buffer to order the incoming messages as per the
sender’s sequence numbers, and accepts only the “next” message in sequence.
MESSAGE ORDERING AND GROUP COMMUNICATION

2. Causally ordered (CO) executions

 If two send events s and s’ are related by causality ordering (not physical time
ordering), then a causally ordered execution requires that their corresponding
receive events r and r’ occur in the same order at all common destinations..
MESSAGE ORDERING AND GROUP COMMUNICATION
MESSAGE ORDERING AND GROUP COMMUNICATION

 To implement CO, we distinguish between the arrival of a message and its


delivery.

 A message m that arrives in the local OS buffer at Pi may have to be delayed until
the messages that were sent to Pi causally before m was sent (the “overtaken”
messages) have arrived and are processed by the application.

 The delayed message m is then given to the application for processing.

 The event of an application, processing an arrived message is referred to as a


delivery event (instead of as a receive event) for emphasis
MESSAGE ORDERING AND GROUP COMMUNICATION

3. Synchronous execution (SYNC)


 When all the communication between pairs of processes uses synchronous send
and receives primitives, the resulting order is the synchronous order.

 The synchronous communication always involves a handshake between the receiver


and the sender, the handshake events may appear to be occurring instantaneously
and atomically.

 In a timing diagram, the “instantaneous” message communication can be shown by


bidirectional vertical message lines.

 Figure 6.3(a) shows a synchronous execution on an asynchronous system.

 Figure 6.3(b) shows the equivalent timing diagram with the corresponding
instantaneous message communication.
MESSAGE ORDERING AND GROUP COMMUNICATION

3. Synchronous execution (SYNC)

You might also like