Scribd
Upload
14 views10 pages

Mathina DC

The document discusses the importance of agreement in distributed systems, particularly in the context of failures and transaction management. It outlines different models of computation (synchronous vs asynchronous), types of processor failures, and the distinction between authenticated and non-authenticated messages. Additionally, it highlights the Byzantine Agreement Problem and its applications in fault-tolerant clock synchronization and atomic commit in distributed databases.

Uploaded by

ksathishkm
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
14 views10 pages

Mathina DC

The document discusses the importance of agreement in distributed systems, particularly in the context of failures and transaction management. It outlines different models of computation (synchronous vs asynchronous), types of processor failures, and the distinction between authenticated and non-authenticated messages. Additionally, it highlights the Byzantine Agreement Problem and its applications in fault-tolerant clock synchronization and atomic commit in distributed databases.

Uploaded by

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

M.A.M.

SCHOOL OF ENGINEERING
Department of Artificial Intelligence & Data
Science

III Year/ V Semester


CS3551 – Distributed Computing

Agreement in Synchronous
System with Failures

Present by,
R.Mathina
Introduction
 Processes/Sites in distributed systems often
compete as well as cooperate to achieve a
common goal.
 Mutual Trust/agreement is very much
required.
 In Distributed Data bases, there may be a
situation where data managers have to
decide “Whether to commit or Abort the
Transaction”
 When there is no failure, reaching an
agreement is easy.
 However, in case of failures, processes must
exchange their values with other processes
and relay the values received from others
several times to isolate the effect of faulty
System Model
Agreement Problems have been
studied under following System
Model:
‘n’ processors and at most ‘m’ of the
processors can be faulty
Processors can directly communicate
with other processors by message
passing.
Receiver knows the identity of the
sender
Communication medium is reliable.
Only Processors are prone to failures
Synchronous VS Asynchronous
Computation
Synchronous Computation
 Processes run in lock step manner[ Process
receives a message sent to it earlier,
performs computation and sends a message
to other process.
 Step of Synchronous computation is called
round
Asynchronous Computation
 Computation does not proceed in lock step.
 Process can send receive messages and
perform computation at any time.

Synchronous Models of Computations are


Model of Processor
Failures
Model of Processor Failures
Processor Can Fail in three modes:
1.Crash Fault:
(i) Processor stops and never resumes
operation.
2.Omission Fault :
(i) Processor Omits to send message to
some processors
3.Malicious Fault :
Also known as Byzantine Faults
(ii) Processor may send fictitious
values/message to other processes to
Authenticated VS Non-Authenticated
Messages
Authenticated Messages:
1.Also known as signed Message
2.Processor can not forge/change a
received message
3.Processor can verify the authenticity of
the message
4.It is easier to reach on an agreement in
this case
Non-Authenticated Messages:
1.Also known as Oral Message
2.Processor can forge/change a received
message and claims to have received it
from others
Performance Aspects of Agreement
Protocols
Following Metrics are used :
1.Time:
No of rounds needed to reach an
agreement
2.Message Traffic :
Number of messages exchanged to
reach an agreement.
3.Storage Overhead :
Amount of information that needs to
stored at processors during execution of
the protocol.
Byzantine Agreement Problem
Source Processor [ Any arbitrarily chosen
processor]broadcasts its values to
others. Solution must meet following
objectives:
1.Agreement :
All non-faulty processors agree on the
same value.
2.Validity :
If source is non faulty, then the common
agreed value must be the value supplied
by the source processor.
“If source is faulty then all non- faulty
processors can agree on any common value” .
“Value agreed upon by faulty processors is
Applications of Agreement Algorithms
1.Fault-Tolerant Clock Synchronization
Distributed Systems require physical
clocks to synchronized
Physical clocks have drift problem
Agreement Protocols may help to reach
a common clock value.
2.Atomic Commit in DDBS
DDBS sites must agree whether to
commit or abort the transaction
Agreement protocols may help to reach
a consensus.
Thank
You..
18

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy