"Merci de de diffuser cette annonce sur vos listes de distributions"
Cher(e)s Collègues,
Je profite du passage à l'ENSIAS du Pr Michel Raynal (INRIA, Rennes, France) membre de l'Institut Universitaire de France et membre de l'Academia Europaea, pour vous annoncer ces deux conférences le Mercredi 22 février 2017 à 15h à l'Amphi 1 de l'ENSIAS.
(Pr. Raynal est l'un des pionniers au monde du domaine des systèmes distribués)
1- Une première conférence débat: "C'est quoi l'informatique ?" (durée 40min + débat)
Résumé: Alors que le mot "numérique" est de plus en plus utilisé par les politiques et les décideurs (et peut en conséquence présenter une sémantique floue), le but de cet exposé est de présenter une vision de ce qu'est l'informatique qui est la science au coeur du numérique. Un des effets recherchés est d'amener l'auditeur à se forger une vision claire de ce domaine scientifique et de lui donner sa place en accord avec les autres sciences.
------------------------------------------------------------------------------------------------
2- Une deuxième conférence technique technique : "Vertex Coloring with Communication and Local Memory Constraints in Synchronous Broadcast Networks" (Travail réalisé avec Hicham Lakhef et François Taïani) (durée 45 min)
Abstract: The talk will consider the broadcast/receive communication model in which message collisions and message conflicts can occur because processes share frequency bands. (A collision occurs when, during the same round, messages are sent to the same process by too many neighbors. A conflict occurs when a process and one of its neighbors broadcast during the same round.) More precisely, the talk will address the case where, during a round, a process may either broadcast a message to its neighbors or receive a message from at most m of them. This captures communication-related constraints or a local memory constraint stating that, whatever the number of neighbors of a process, its local memory allows it to receive and store at most m messages during each round. The talk will define first the corresponding generic vertex multi-coloring problem (a vertex can have several colors). It will then focuse on tree networks, for which it will present a lower bound on the number of colors K that are necessary and an associated coloring algorithm, which is optimal with respect to K.
Biography:
Michel Raynal is a Professor of computing science, IRISA, University of Rennes, France. His main research interests are the basic principles of distributed computing systems. He is a world leading researcher in distributed computing, and the author of numerous papers on this topic (more than 140 in int’l scientific journals, more than 300 papers in int’l conferences). He is also well-known for his books on distributed computing.
Michel Raynal chaired the program committee of the major conferences on the topic (e.g., ICDCS, DISC, SIROCCO, OPODIS, ICDCN, etc.) and served on the program committees of more than 180 int’l conferences including all the most prestigious ones. He is the recipient of several « Best Paper » awards (including ICDCS 1999, 2000 and 2001, SSS 2009 and 2011, Europar 2010, DISC 2010, PODC 2014) and has supervised more than 45 PhD students.
He is also the recipient of the 2015 Int’l Award « Innovation in Distributed Computing » (also known as SIROCCO Prize). He gave lectures on distributed computing in many universities all over the world. In the recent past, Michel Raynal has written four books: « Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems », Morgan & Claypool 251 pages, 2010 (ISBN 978-1-60845-293-4); « Fault-Tolerant Agreement in Synchronous Distributed Systems », 165 pages, Morgan & Claypool, September 2010), (ISBN 978-1-60845-525-6); « Concurrent Programming: Algorithms, Principles and Foundations », Springer, 515 pages, 2012, and « Distributed Algorithms for Message-passing Systems », Springer, 510 pages, 2013.
Michel Raynal is a senior member of the prestigious « Institut Universitaire de France» and a member of Academia Europaea.