BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20230405T110000
DTEND;TZID=Europe/Paris:20230405T120000
DTSTAMP:20260423T123806
CREATED:20230322T164506Z
LAST-MODIFIED:20230322T164506Z
UID:11149-1680692400-1680696000@www.greyc.fr
SUMMARY:Séminaire Algorithmique : Gabriel Le Bouder (LIP6\, Sorbonne Univ.) « Memory-Optimization for Self-Stabilizing Distributed Algorithms »
DESCRIPTION:Self-stabilization is a suitable paradigm for distributed systems\, particularly prone to transient faults. Errors such as memory or messages corruption\, break of a communication link\, can put the system in an inconsistent state. A protocol is self-stabilizing if\, whatever the initial state of the system\, it guarantees that it will return a normal behavior in finite time. Several constraints concern algorithms designed for distributed systems. Asynchrony is one emblematic example. With the development of networks of connected\, autonomous devices\, it also becomes crucial to design algorithms with a low energy consumption\, and not requiring much in terms of resources. \nOne way to address these problems is to aim at reducing the size of the messages exchanged between the nodes of the network. This thesis focuses on the memory optimization of the communication for self-stabilizing distributed algorithms. We will present a negative results\, proving the impossibility to solve some problems under a certain limit on the size of the exchanged messages\, and a particularly efficient algorithms in terms of memory for one fundamental problem in distributed systems: the token circulation.
URL:https://www.greyc.fr/event/seminaire-algorithmique-gabriel-le-bouder-lip6-sorbonne-univ-memory-optimization-for-self-stabilizing-distributed-algorithms/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,Séminaire Algo
END:VEVENT
END:VCALENDAR