Michel Raynal

Michel Raynal[1] (born 1949), is a French informatics scientist, professor at IRISA, University of Rennes, France. He is known for his contributions in the fields of algorithms, computability, and fault-tolerance in the context of concurrent and distributed systems. Michel Raynal is also Distinguished Chair professor at the Hong Kong Polytechnic University[2] and editor of the “Synthesis Lectures on Distributed Computing Theory” published by Morgan & Claypool.[3] He is a senior member of Institut Universitaire de France and a member of Academia Europaea.

Michel Raynal co-authored numerous research papers[4][5] on concurrent and distributed computing, and has written 12 books. His last three books[6][7][8] constitute an introduction to fault-free and fault-tolerant concurrent and distributed computing. In his publications Michel Raynal strives to promote simplicity as a “first-class citizen” in the scientific approach.[9] Michel Raynal (and his co-authors) won several best paper awards in prestigious conferences such as IEEE ICDCS 1999, 2000 and 2001, SSS 2009 and 2011, Europar 2010, DISC 2010, and ACM PODC 2014.

When Michel Raynal became Emeritus professor (2017), INRIA, IRISA and the University of Rennes organized a Workshop[10] in his honor featuring various speakers, including Turing Award recipient (Leslie Lamport) and Dijkstra Prize recipients (Leslie Lamport, Maurice Herlihy, Yoram Moses), and professor at Collège de France (Rachid Guerraoui).

Education and career

Michel Raynal obtained bachelor degrees (French “Baccalauréat”) both in literature and science. He received his PhD from University of Rennes in 1975, and his “Doctorat d’état” in 1981. During the period 1981-1984 he was a professor in a telecommunications engineer school (ENST de Bretagne) where he created and managed the informatics department. In 1984 he moved to the university of Rennes, and in 1985 he founded a research group entirely devoted to Distributed Algorithms (at that time, one of the first groups on this research topic in the world).

Michel Raynal has been an associate member of the editorial board of international journals, including the Journal of Parallel and Distributed Computing (JPDC), IEEE Transactions on Computers (TC), and IEEE Transactions of parallel and Distributed Systems (TPDS), among others.

Research areas and scientific interests

Michel Raynal’s research contributions concern mainly concurrent and distributed computing, and more specifically: causality, distributed synchronization, fault-tolerance, distributed agreement (consensus) and distributed computability. His first book (on mutual exclusion algorithms in both shared memory and message-passing systems)[11] is recognized as one of the first books entirely devoted to distributed algorithms.

On the synchronization side, with Jean-Michel Hélary and Achour Mostéfaoui, Michel Raynal designed a very simple generic message-passing mutual exclusion algorithm from which can be derived plenty of token and tree-based mutex algorithms.[12]

On the causality side, with co-workers he produced a very simple algorithm for causal message delivery,[13] and an optimal vector-clock-based distributed checkpointing algorithms,[14] which established the theoretical foundations of distributed checkpointing,[15] and the so-called communication-based snapshot.[16] He also introduced (with Hélary and Mostéfaoui) the notion of virtual precedence.[17] Together with V. Garg, he introduced the concept of “normality” which extends the well-known linearizability consistency condition to the case where objects have polyadic operations.[18]

On the agreement side, Michel Raynal (mainly with A. Mostéfaoui) produced several algorithms for asynchronous message-passing systems which solve consensus in the presence of crash failures[19][20][21] or process Byzantine failures.[22] This last algorithm is an incredibly simple randomized algorithm that is optimal with respect to both time and message complexities. With Mostéfaoui and Rajsbaum, Michel Raynal also introduced a new approach to solve consensus called “condition-based”.[23] This approach brought to light a very strong connection between error-correcting codes and distributed agreement problems.[24] Michel Raynal also designed distributed algorithms for other agreement problems (such as k-set agreement and renaming).

Recently, Armando Castaneda, Sergio Rajsbaum, and Michel Raynal introduced the notion of “interval linearizability” which is the first notion that allows us to unify in a single framework the notions of “concurrent objects” and “distributed tasks”.[25]

On the computability side, Steiner, Taubenfeld, and Raynal addressed universal constructions that allow x out of k distributed state machines to progress in the presence of asynchrony and any number of process crashes.[26] Recently, from an initial idea proposed by Taubenfeld, Michel Raynal became interested in algorithms suited to anonymous memories.[27]

Awards and Honours

References
  1. Michel Raynal's personal page on IRISA's website
  2. https://www.comp.polyu.edu.hk/en-us/staffs/detail/6764
  3. "Synthesis Lectures on Distributed Computing Theory".
  4. Michel Raynal's bibliography on DBLP
  5. Michel Raynal's bibliography on Google Scholar
  6. Raynal, Michel (2012). Concurrent Programming: Algorithms, Principles, and Foundations. Springer. doi:10.1007/978-3-642-32027-9. ISBN 978-3-642-32027-9. S2CID 10526009.
  7. Raynal, Michel (2013). Distributed algorithms for message-passing systems. Springer. doi:10.1007/978-3-642-38123-2. ISBN 978-3-642-38123-2. S2CID 31644113.
  8. Raynal, Michel (2018). Fault-tolerant message-passing distributed systems: an algorithmic approach. Springer. doi:10.1007/978-3-319-94141-7. ISBN 978-3-319-94141-7. S2CID 52175582.
  9. Le Bonheur, Julien (2018-07-16). "Michel Raynal distingué pour sa contribution exceptionnelle à l'algorithmique répartie" (in French). Université de Rennes 1. Retrieved 13 January 2020.
  10. "International Workshop on Distributed Computing in the honor of Michel Raynal". Inria. Retrieved 21 December 2019.
  11. Raynal, Michel (1986) [1984]. Algorithms for mutual exclusion. Cambridge: MIT Press. ISBN 0-262-18119-3.
  12. Hélary, Jean-Michel; Mostéfaoui, Achour; Raynal, Michel (November 1994). "A general scheme for token- and tree-based distributed mutual exclusion algorithms" (PDF). IEEE Transactions on Parallel and Distributed Systems. 5 (11): 1185–1196. doi:10.1109/71.329670. ISSN 2161-9883.
  13. Raynal, Michel; Schiper, André; Toueg, Sam (September 1991). "The causal ordering abstraction and a simple way to implement it" (PDF). Information Processing Letters. 39 (6): 343–350. doi:10.1016/0020-0190(91)90008-6.
  14. Baldoni, Roberto; Hélary, Jean-Michel; Raynal, Michel (March 2001). "Rollback-Dependency Trackability: A Minimal Characterization and Its Protocol". Information and Computation. 165 (2): 144–173. doi:10.1006/inco.2000.2906.
  15. Hélary, J.-M.; Mostefaoui, A.; Netzer, R.H.B.; Raynal, M. (1 January 2000). "Communication-based prevention of useless checkpoints in distributed computations". Distributed Computing. 13 (1): 29–43. doi:10.1007/s004460050003. S2CID 6554750.
  16. Helary, J.; Mostefaoui, A.; Raynal, M. (1999). "Communication-induced determination of consistent snapshots". IEEE Transactions on Parallel and Distributed Systems. 10 (9): 865–877. doi:10.1109/71.798312. S2CID 13939609.
  17. Hélary, J.M.; Mostefaoui, A.; Raynal, M. (March 2002). "Interval Consistency of Asynchronous Distributed Computations". Journal of Computer and System Sciences. 64 (2): 329–349. doi:10.1006/jcss.2001.1819.
  18. GARG, VIJAY K.; RAYNAL, MICHEL (21 November 2011). "Normality: A CONSISTENCY CONDITION FOR CONCURRENT OBJECTS". Parallel Processing Letters. 09 (1): 123–134. doi:10.1142/S0129626499000141. S2CID 16427772.
  19. MOSTEFAOUI, A.; RAYNAL, M. (21 November 2011). "Leader-Based Consensus". Parallel Processing Letters. 11 (1): 95–107. doi:10.1142/S0129626401000452.
  20. Guerraoui, R.; Raynal, M. (16 October 2006). "The Alpha of Indulgent Consensus" (PDF). The Computer Journal. 50 (1): 53–67. doi:10.1093/comjnl/bxl046.
  21. Mostefaoui, Achour; Rajsbaum, Sergio; Raynal, Michel; Travers, Corentin (January 2008). "The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement". SIAM Journal on Computing. 38 (4): 1574–1601. doi:10.1137/050645580.
  22. Mostéfaoui, Achour; Moumen, Hamouma; Raynal, Michel (11 September 2015). "Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time" (PDF). Journal of the ACM. 62 (4): 1–21. doi:10.1145/2785953. S2CID 2212421.
  23. Mostefaoui, Achour; Rajsbaum, Sergio; Raynal, Michel (1 November 2003). "Conditions on input vectors for consensus solvability in asynchronous distributed systems". Journal of the ACM. 50 (6): 922–954. doi:10.1145/950620.950624.
  24. Friedman, Roy; Mostefaoui, Achour; Rajsbaum, Sergio; Raynal, Michel (July 2007). "Asynchronous Agreement and Its Relation with Error-Correcting Codes". IEEE Transactions on Computers. 56 (7): 865–875. doi:10.1109/TC.2007.1043. S2CID 9418243.
  25. Castañeda, Armando; Rajsbaum, Sergio; Raynal, Michel (19 November 2018). "Unifying Concurrent Objects and Distributed Tasks". Journal of the ACM. 65 (6): 1–42. doi:10.1145/3266457. S2CID 53877441.
  26. Raynal, Michel; Stainer, Julien; Taubenfeld, Gadi (19 August 2015). "Distributed Universality". Algorithmica. 76 (2): 502–535. doi:10.1007/s00453-015-0053-3. S2CID 10912125.
  27. Raynal, Michel; Taubenfeld, Gadi (2019). "Mutual exclusion in fully anonymous shared memory systems". Cite journal requires |journal= (help)
  28. Michel Raynal's page Archived 2015-01-11 at the Wayback Machine on the website of the Institut Universitaire de France
  29. "SIROCCO 2015 website". Archived from the original on 2015-11-27. Retrieved 2015-03-10.
  30. Michel Raynal's page on the website of Academia Europaea
  31. "Michel Raynal distingué pour sa contribution exceptionnelle à l'algorithme répartie". Université de Rennes 1. July 2018.
  32. Le Bonheur, Julien (16 July 2018). "Michel Raynal distingué pour sa contribution exceptionnelle à l'algorithmique répartie" (in French). Université de Rennes 1. Retrieved 13 January 2020.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.