Rachid Guerraoui

Last updated
Rachid Guerraoui
Born (1967-01-05) January 5, 1967 (age 57)
Rabat, Morocco
Citizenship Morocco, Switzerland
Alma mater
Known for distributed computing, concurrent computing, popular science
Awards
Scientific career
Fields Computer science
Institutions EPFL, HP Labs
Thesis Programmation Répartie par Objets : Études et Propositions  (1992)
Doctoral advisor Christian Fluhr
Website dcl.epfl.ch/rachid/

Rachid Guerraoui (born January 5, 1967) is a Moroccan-Swiss-French [1] computer scientist and a Full Professor in the School of Computer and Communication Sciences (IC) at EPFL, known for his contributions in the fields of concurrent and distributed computing. [2] [3] He is an ACM Fellow [4] and an associate (area) editor of the Journal of the ACM . [5] In 2018–19, he held the position of Chair in Informatics and Computational Science for Distributed Computing at the Collège de France. [6]

Contents

Education and career

Guerraoui was born on January 5, 1967, in Rabat, Morocco. His father, Mohammed Guerraoui, is a teacher of mathematics and former wali (governor) of Marrakesh. His mother, Fatima Rahmoun-Guerraoui, is a teacher of French. After getting his baccalaureate in 1984, he left Morocco for France. Guerraoui earned simultaneous Master’s degrees in Computer Engineering from the École supérieure d'informatique électronique automatique (ESIEA) and in Computer Science from the Pierre and Marie Curie University in 1989, supported by a scholarship at the Centre de Recherche of the École des Mines of Paris. In 1992, he earned his PhD from the Université d’Orsay, advised by Christian Fluhr and supported by the French Alternative Energies and Atomic Energy Commission of Saclay. His doctoral dissertation was titled Programmation Répartie par Objets : Études et Propositions. [7] He then started as a postdoctoral researcher at EPFL and was appointed to the computer science faculty in 1999, after stints at HP Labs and MIT. [8] [9] [10] [11] [12] [13]

Guerraoui's honors include an ERC Advanced Grant Award (2013), [14] the Google Focused Award (2014), [15] the Middleware 2014 Best Paper and 10-Years Best Paper Awards, [16] and the Dahl–Nygaard Senior Prize (2024). [17] He was named an ACM Fellow in 2012 [4] and was appointed Chair in Informatics and Computational Science for Distributed Computing, 2018–2019, by the Collège de France [6] —the first Moroccan to receive either appointment. [12] [11]

With various collaborators, Guerraoui has written several technical and general-audience books:

He is also an associate (area) editor of the Journal of the ACM . [5]

Guerraoui also works on the popularization of computer science. With his doctoral student El Mahdi El Mahmdi, he created the Wandida project, a collection of permissively licensed educational videos on YouTube. [18]

Guerraoui maintains strong ties to Morocco through his participation in the public debate and the Moroccan political life. [19] [12] In December 2019, he was appointed by King Mohammed VI as a member of the Special Committee on Model of Development. [20]

Focal research areas and main publications

Guerraoui worked on establishing theoretical foundations of Transactional Memory (TM). He co-defined a concept he called opacity, [21] used for establishing correctness of TMs. On the practical side, he co-devised elastic transactions [22] and co-designed SwissTM, [23] a throughput-efficient software transactional memory (STM) as well as a benchmark for TM systems, STMBench7. [24]

Earlier, Guerraoui studied scalable information dissemination methods. His paper on lightweight epidemic broadcast [25] was the first to consider the partial and/or out-of-sync views of different processes in a gossip-based distributed system. This paper, together with Guerraoui's paper on the underlying membership service, [26] gained over 1250 citations combined as of 2018, among which a number of theory papers on the analysis of gossip protocols in realistic settings. [27]

Rachid Guerraoui has a proven record of investigating the foundations of asynchronous distributed computations. For instance, Guerraoui co-established lower bounds for asynchronous gossiping and renaming. [28] [29] He further proved fundamental results on the relationships between classical distributed computing problems, such as atomic commitment [30] and consensus, for which he helped close the then open problem of the weakest failure detector for consensus with any number of faults and co-established a new classification of distributed computing problems. [31] Guerraoui further co-defined a general methodology to build highly concurrent asynchronous data structures [32] [33] and has shown how asynchrony can help build pseudo-random numbers. [34]

Guerraoui invented the mathematical abstraction of indulgence [35] to precisely capture the essence of asynchronous algorithms of which safety does not depend on timing assumptions, such as Lamport's Paxos or Castro-Liskov's PBFT. Guerraoui used that concept to co-define a general framework for secure and reliable distributed protocols. [36]

Related Research Articles

Distributed computing is a field of computer science that studies distributed systems, defined as computer systems whose inter-communicating components are located on different networked computers.

<span class="mw-page-title-main">Leslie Lamport</span> American computer scientist and mathematician

Leslie B. Lamport is an American computer scientist and mathematician. Lamport is best known for his seminal work in distributed systems, and as the initial developer of the document preparation system LaTeX and the author of its first manual.

<span class="mw-page-title-main">Gödel Prize</span> Computer science award

The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory. The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.

A Byzantine fault is a condition of a system, particularly a distributed computing system, where a fault occurs such that different symptoms are presented to different observers, including imperfect information on whether a system component has failed. The term takes its name from an allegory, the "Byzantine generals problem", developed to describe a situation in which, to avoid catastrophic failure of a system, the system's actors must agree on a strategy, but some of these actors are unreliable in such a way as to cause other (good) actors to disagree on the strategy and they may be unaware of the disagreement.

A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes. This often requires coordinating processes to reach consensus, or agree on some data value that is needed during computation. Example applications of consensus include agreeing on what transactions to commit to a database in which order, state machine replication, and atomic broadcasts. Real-world applications often requiring consensus include cloud computing, clock synchronization, PageRank, opinion formation, smart power grids, state estimation, control of UAVs, load balancing, blockchain, and others.

Özalp Babaoğlu, is a Turkish computer scientist. He is currently professor of computer science at the University of Bologna, Italy. He received a Ph.D. in 1981 from the University of California at Berkeley. He is the recipient of 1982 Sakrison Memorial Award, 1989 UNIX InternationalRecognition Award and 1993 USENIX AssociationLifetime Achievement Award for his contributions to the UNIX system community and to Open Industry Standards. Before moving to Bologna in 1988, Babaoğlu was an associate professor in the Department of Computer Science at Cornell University. He has participated in several European research projects in distributed computing and complex systems. Babaoğlu is an ACM Fellow and has served as a resident fellow of the Institute of Advanced Studies at the University of Bologna and on the editorial boards for ACM Transactions on Computer Systems, ACM Transactions on Autonomous and Adaptive Systems and Springer-Verlag Distributed Computing.

A gossip protocol or epidemic protocol is a procedure or process of computer peer-to-peer communication that is based on the way epidemics spread. Some distributed systems use peer-to-peer gossip to ensure that data is disseminated to all members of a group. Some ad-hoc networks have no central registry and the only way to spread common data is to rely on each member to pass it along to their neighbors.

<span class="mw-page-title-main">Tomasz Imieliński</span> Polish-American computer scientist (born 1954)

Tomasz Imieliński is a Polish-American computer scientist, most known in the areas of data mining, mobile computing, data extraction, and search engine technology. He is currently a professor of computer science at Rutgers University in New Jersey, United States.

The Brooks–Iyengar algorithm or FuseCPA Algorithm or Brooks–Iyengar hybrid algorithm is a distributed algorithm that improves both the precision and accuracy of the interval measurements taken by a distributed sensor network, even in the presence of faulty sensors. The sensor network does this by exchanging the measured value and accuracy value at every node with every other node, and computes the accuracy range and a measured value for the whole network from all of the values collected. Even if some of the data from some of the sensors is faulty, the sensor network will not malfunction. The algorithm is fault-tolerant and distributed. It could also be used as a sensor fusion method. The precision and accuracy bound of this algorithm have been proved in 2016.

Bernard M. E. Moret is a Swiss-American computer scientist, an emeritus professor of Computer Science at the École Polytechnique Fédérale de Lausanne in Switzerland. He is known for his work in computational phylogenetics, and in particular for mathematics and methods for computing phylogenetic trees using genome rearrangement events.

Join-patterns provides a way to write concurrent, parallel and distributed computer programs by message passing. Compared to the use of threads and locks, this is a high level programming model using communication constructs model to abstract the complexity of concurrent environment and to allow scalability. Its focus is on the execution of a chord between messages atomically consumed from a group of channels.

Liuba Shrira is a professor of computer science at Brandeis University, whose research interests primarily involve distributed systems. Shrira is accredited with having coined the phrase "promise" when referring to the completion of an asynchronous operation and its resulting value for the JavaScript programming language

Kenneth P. Birman is a professor in the Department of Computer Science at Cornell University. He currently holds the N. Rama Rao Chair in Computer Science.

<span class="mw-page-title-main">Alexander L. Wolf</span> American computer scientist

Alexander L. Wolf is an American computer scientist known for his research in software engineering, distributed systems, and computer networking. He is credited, along with his collaborators, with introducing the modern study of software architecture, content-based publish/subscribe messaging, content-based networking, automated process discovery, and the software deployment lifecycle. Wolf's 1985 Ph.D. dissertation developed language features for expressing a module's import/export specifications and the notion of multiple interfaces for a type, both of which are now common in modern computer programming languages.

Michel Raynal 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 and editor of the “Synthesis Lectures on Distributed Computing Theory” published by Morgan & Claypool. He is a senior member of Institut Universitaire de France and a member of Academia Europaea.

<span class="mw-page-title-main">David Atienza</span> Spanish physicist and materials scientist

David Atienza Alonso is a Spanish/Swiss scientist in the disciplines of computer and electrical engineering. His research focuses on hardware‐software co‐design and management for energy‐efficient and thermal-aware computing systems, always starting from a system‐level perspective to the actual electronic design. He is a full professor of electrical and computer engineering at the Swiss Federal Institute of Technology in Lausanne (EPFL) and the head of the Embedded Systems Laboratory (ESL). He is an IEEE Fellow (2016), and an ACM Fellow (2022).

<span class="mw-page-title-main">Richard Vuduc</span>

Richard Vuduc is a tenured professor of computer science at the Georgia Institute of Technology. His research lab, The HPC Garage, studies high-performance computing, scientific computing, parallel algorithms, modeling, and engineering. He is a member of the Association for Computing Machinery (ACM). As of 2022, Vuduc serves as Vice President of the SIAM Activity Group on Supercomputing. He has co-authored over 200 articles in peer-reviewed journals and conferences.

Daniel Zingaro is an associate professor at the University of Toronto Mississauga. His main areas of research are in evaluating Computer science education and online learning. He has co-authored over 80 articles in peer-reviewed journals and conferences; and also authored a textbook, "Invariants: a Generative Approach to Programming.

<span class="mw-page-title-main">Jean-Pierre Hubaux</span> Swiss-Belgian computer scientist spezialised in security and privacy

Jean-Pierre Hubaux is a Swiss-Belgian computer scientist specialised in security and privacy. He is a professor of computer science at EPFL and is the head of the Laboratory for Data Security at EPFL's School of Computer and Communication Sciences.

References

  1. ↑ "Rachid Guerraoui, EPFL profil".
  2. ↑ "dblp: Rachid Guerraoui". dblp.uni-trier.de. Retrieved 2018-10-22.
  3. ↑ "EPFL - DCL - Rachid GUERRAOUI". lpdwww.epfl.ch. Retrieved 2018-10-22.
  4. 1 2 "Award recipients". Association for Computing Machinery. Retrieved 4 October 2024.
  5. 1 2 "ACM JACM". Journal of the ACM. Retrieved 2024-10-04.
  6. 1 2 Sayed, Inka (2018-06-15). "Rachid Guerraoui appointed Digital Chair by Collège de France" (Press release). Lausanne, Switzerland: EPFL.
  7. ↑ "Rachid Guerraoui". Mathematics Genealogy Project. Retrieved 4 October 2024.
  8. ↑ "Rachid Guerraoui : Biography and current work". EPFL. Retrieved 2018-10-22.
  9. ↑ Jmahri, Mustapha (2019-07-23). "Rachid Guerraoui du DHJ au collège de France". Mazagan24 - Portail d'El Jadida (in French). Retrieved 2020-02-14.
  10. ↑ "Le passeport suisse et moi. Rachid Guerraoui: 'Les policiers m'ont offert un verre de blanc'". Le Temps (in French). 2016-01-07. ISSN   1423-3967 . Retrieved 2020-09-14.
  11. 1 2 Jérémie, David (29 Jul 2023). "PORTRAIT. Rachid Guerraoui, éminent professeur à l'Ecole Polytechnique de Lausanne, détenteur d'une chaire au collège de France" (in French). Challenge. Archived from the original on 2023-09-27. Retrieved 4 October 2024.
  12. 1 2 3 El Bouzdaini, Wissam (26 Jun 2018). "Rachid Guerraoui, sommité du domaine informatique" (in French). Maroc Hebdo. Archived from the original on 2018-08-15. Retrieved 4 October 2024.
  13. ↑ Guerraoui, Rachid. "CV". Rachid GUERRAOUI. DCL, EPFL. Retrieved 4 October 2024.
  14. ↑ "Guerraoui Wins an ERC Grant". EcoCloud. 2013-09-17. Retrieved 2018-10-22.
  15. ↑ Madry, Kamila (2013-11-04). "Prof. Rachid Guerraoui received a Google Focused Award" (Press release). Lausanne, Switzerland: EPFL.
  16. ↑ Walther, Alexandra (2014-12-17). "Middleware 2014 and 10-Years Best Paper Award for Rachid Guerraoui" (Press release). Lausanne, Switzerland: EPFL.
  17. ↑ "Technical papers". ECOOP 2024. Retrieved 4 October 2024.
  18. ↑ Kazar, Yassir (2014-05-08). "Online education : Wandida, this is not a MOOC". Open Knowledge Foundation. Archived from the original on 2024-08-29. Retrieved 1 October 2024.
  19. ↑ "Rachid Guerraoui: "Je n'habite pas le Maroc mais le Maroc m'habite" (REPLAY)". 2M (in French). Retrieved 2020-02-14.
  20. ↑ "Composition of Special Committee on Model of Development". www.mapnews.ma. Rabat: Agence Marocaine de Presse. 2019-12-12. Retrieved 2020-02-14.
  21. ↑ Guerraoui, Rachid; Kapałka, Michał (2008). "On the correctness of transactional memory". Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming - PPoPP '08. p. 175. CiteSeerX   10.1.1.164.9537 . doi:10.1145/1345206.1345233. ISBN   9781595937957. S2CID   1550577.
  22. ↑ Felber, Pascal; Gramoli, Vincent; Guerraoui, Rachid (2017). "Elastic transactions". Journal of Parallel and Distributed Computing. 100: 103–127. doi:10.1016/j.jpdc.2016.10.010.
  23. ↑ Dragojevik, Aleksandar; Felber, Pascal; Gramoli, Vincent; Guerraoui, Rachid (2011). "Why STM can be more than a research toy". Communications of the ACM. 54 (4): 70. CiteSeerX   10.1.1.164.8994 . doi:10.1145/1924421.1924440. S2CID   12568524.
  24. ↑ Guerraoui, Rachid; Kapałka, Michał; Vitek, Jan (2007). "STMBench7". ACM SIGOPS Operating Systems Review. 41 (3): 315. doi:10.1145/1272998.1273029.
  25. ↑ Eugster, P. Th.; Guerraoui, R.; Handurukande, S. B.; Kouznetsov, P.; Kermarrec, A.-M. (2003). "Lightweight probabilistic broadcast". ACM Transactions on Computer Systems. 21 (4): 341–374. CiteSeerX   10.1.1.100.9532 . doi:10.1145/945506.945507. S2CID   6875620.
  26. ↑ Jelasity, Márk; Voulgaris, Spyros; Guerraoui, Rachid; Kermarrec, Anne-Marie; Van Steen, Maarten (2007). "Gossip-based peer sampling". ACM Transactions on Computer Systems. 25 (3): 8–es. CiteSeerX   10.1.1.310.501 . doi:10.1145/1275517.1275520. S2CID   6266183.
  27. ↑ "rachid guerraoui - Google Scholar Citations". scholar.google.com. Retrieved 2018-10-22.
  28. ↑ Georgiou, Chryssis; Gilbert, Seth; Guerraoui, Rachid; Kowalski, Dariusz R. (2013). "Asynchronous gossip". Journal of the ACM. 60 (2): 1–42. doi:10.1145/2450142.2450147. S2CID   7901743.
  29. ↑ Alistarh, Dan; Aspnes, James; Censor-Hillel, Keren; Gilbert, Seth; Guerraoui, Rachid (2014). "Tight Bounds for Asynchronous Renaming". Journal of the ACM. 61 (3): 1–51. CiteSeerX   10.1.1.431.2007 . doi:10.1145/2597630. S2CID   9813419.
  30. ↑ Guerraoui, Rachid (2002). "Non-blocking atomic commit in asynchronous distributed systems with failure detectors". Distributed Computing. 15: 17–25. CiteSeerX   10.1.1.19.5491 . doi:10.1007/s446-002-8027-4. S2CID   72867.
  31. ↑ Fauconnier, Carole Delporte-Gallet Hugues; Guerraoui, Rachid (2010). "Tight failure detection bounds on atomic object implementations". Journal of the ACM. 57 (4): 1–32. CiteSeerX   10.1.1.165.8950 . doi:10.1145/1734213.1734216. S2CID   11566298.
  32. ↑ David, Tudor; Guerraoui, Rachid; Trigonakis, Vasileios (2013). "Everything you always wanted to know about synchronization but were afraid to ask". Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles - SOSP '13. pp. 33–48. CiteSeerX   10.1.1.593.2182 . doi:10.1145/2517349.2522714. ISBN   9781450323888. S2CID   10176747.
  33. ↑ David, Tudor; Guerraoui, Rachid; Trigonakis, Vasileios (2015). "Asynchronized Concurrency". ACM SIGPLAN Notices. 50 (4): 631–644. doi: 10.1145/2775054.2694359 .
  34. ↑ Antoniadis, Karolos; Blanchard, Peva; Guerraoui, Rachid; Stainer, Julien (2018). "The entropy of a distributed computation random number generation from memory interleaving". Distributed Computing. 31 (5): 389–417. doi:10.1007/s00446-017-0311-5. S2CID   24299793.
  35. ↑ Guerraoui, Rachid (2000). "Indulgent algorithms (preliminary version)". Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing - PODC '00. pp. 289–297. CiteSeerX   10.1.1.583.6812 . doi:10.1145/343477.343630. ISBN   978-1581131833. S2CID   16791929.
  36. ↑ Aublin, Pierre-Louis; Guerraoui, Rachid; Knežević, Nikola; Quéma, Vivien; Vukolić, Marko (2015). "The Next 700 BFT Protocols". ACM Transactions on Computer Systems. 32 (4): 1–45. doi:10.1145/2658994. S2CID   900359.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.