Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Topics in Distributed Algorithms
Speaker:Dariusz Kowalski
coming from:Warsaw University, Poland
Speakers Bio:
Event Type:Talk
Visibility:D1, D2, D3, D4
We use this to send out email in the morning.
Level:AG Audience
Language:English
Date, Time and Location
Date:Friday, 12 April 2002
Time:13:30
Duration:45 Minutes
Location:Saarbr├╝cken
Building:46.1 - MPII
Room:024
Abstract
Distributed computing is about loosely coupled machines communicating over heterogeneous networks via channels of various characteristics. The participating machines sometimes crash, and even if they do not then the software they run is often not fully reliable. This poses a challenge to design robust algorithms that can achieve the computational goals in such environments in any contingency. This is even more challenging if we seek efficient solutions, in terms of time or the amount of communication.

We will focus on selected algorithmic problems, such as consensus, gossiping, do-all, and discuss recent work in these areas. Among the issues covered, we will show that randomization sometimes helps. Finally we will survey the remaining open problems.

Contact
Name(s):Spyros Kontogiannis
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):