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:
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]
^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. CiteSeerX10.1.1.593.2182. doi:10.1145/2517349.2522714. ISBN9781450323888. S2CID10176747.
^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. S2CID24299793.