Usted está aquí: The BG simulation: an algorithmic tool for impossibility results

# The BG simulation: an algorithmic tool for impossibility results

Damien Imbs (IM-UNAM) - martes 4 de septiembre, 12 horas
Ponente: Damien Imbs (IM-UNAM)
Cuándo 04/09/2012 de 12:00 a 13:00 Salón "Graciela Salicrup" vCal iCal

Resumen:

In distributed computing, some models do not allow solving all problems. There are various ways to prove such impossibilities. In this talk, we will see a purely algorithmic tool for proving such impossibilities: the BG simulation. This simulation shows that, in an asynchronous system, the important parameter with regard to calculability is not the total number of cooperating processes; it is how many of them can fail.