Campus Event Calendar
Event Entry
What and Who
Approximate Agreement
Pankaj Khanchandani
Max-Planck-Institut für Informatik - D1
ToDS Group Meeting
AG 1
MPI Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 22 January 2015
10:00
90 Minutes
E1 4
023
Saarbrücken
Abstract
In this talk, I will present a fault-tolerant algorithm for approximate agreement in a distributed system. Given a system of n nodes and an input real number at each node, an approximate agreement algorithm outputs a real number at each node that is within a given ε and in the range of input values. The nodes communicate using synchronous message passing model i.e. sending and receiving messages synchronously. Additionally, we consider that there are at most f < n/3 Byzantine faults in the system. I will then touch upon the application of this algorithm to the problem of self-stabilizing clock synchronization in a multi-core system.
Contact
Matthias Függer
--email hidden
passcode not visible
logged in users only
Matthias Függer, 01/21/2015 10:10 -- Created document.