Scribd
Upload
7 views7 pages

Agp

Uploaded by

YT modapk
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
7 views7 pages

Agp

Uploaded by

YT modapk
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/ 7

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 processor.

• Agreement Protocols helps to reach an agreement in presence of failures.


System Model

• Agreement Problems have been studied under following System Model:

1. 'n' processors and at most 'm' of the processors can be faulty

2. Processors can directly communicate with other processors by message passing.

3. Receiver knows the identity of the sender

4. Communication medium is reliabble.

5. Only Processors are prone to failures


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 nonfaulty, 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 irrelevant"


The Lamport-Shostak-Pease Algorithm
• Set{P1 - Pn} which can have two values either 0 or 1
Solution:

Group A Group B

P1-> {1, 1, 1 } -> 1 (majority of incoming value) P1-> {1, 0, 1 } -> 1 (majority of incoming value)
P2-> {1, 1, 1 } -> 1 P2-> {0, 1, 1 } -> 1
P3-> {1, 1, 1 } -> 1 P3-> {1, 1, 0 } -> 1

Here we agree upon the majority value, Both the group of processors will communicate with each other, only
if the agreed value is true in both case
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.

You might also like