Age, Biography and Wiki
Rachid Guerraoui was born on 5 January, 1967, is a Moroccan-Swiss computer scientist and academic. Discover Rachid Guerraoui's Biography, Age, Height, Physical Stats, Dating/Affairs, Family and career updates. Learn How rich is he in this year and how he spends money? Also learn how he earned most of networth at the age of 57 years old?
| Popular As |
N/A |
| Occupation |
N/A |
| Age |
57 years old |
| Zodiac Sign |
Capricorn |
| Born |
5 January 1967 |
| Birthday |
5 January |
| Birthplace |
N/A |
| Nationality |
|
We recommend you to check the complete list of Famous People born on 5 January.
He is a member of famous Computer with the age 57 years old group.
Rachid Guerraoui Height, Weight & Measurements
At 57 years old, Rachid Guerraoui height not available right now. We will update Rachid Guerraoui's Height, weight, Body Measurements, Eye Color, Hair Color, Shoe & Dress size soon as possible.
| Physical Status |
| Height |
Not Available |
| Weight |
Not Available |
| Body Measurements |
Not Available |
| Eye Color |
Not Available |
| Hair Color |
Not Available |
Dating & Relationship status
He is currently single. He is not dating anyone. We don't have much information about He's past relationship and any previous engaged. According to our Database, He has no children.
| Family |
| Parents |
Not Available |
| Wife |
Not Available |
| Sibling |
Not Available |
| Children |
Not Available |
Rachid Guerraoui Net Worth
His net worth has been growing significantly in 2023-2024. So, how much is Rachid Guerraoui worth at the age of 57 years old? Rachid Guerraoui’s income source is mostly from being a successful Computer. He is from . We have estimated Rachid Guerraoui's net worth, money, salary, income, and assets.
| Net Worth in 2024 |
$1 Million - $5 Million |
| Salary in 2024 |
Under Review |
| Net Worth in 2023 |
Pending |
| Salary in 2023 |
Under Review |
| House |
Not Available |
| Cars |
Not Available |
| Source of Income |
Computer |
Rachid Guerraoui Social Network
Timeline
Rachid Guerraoui (born January 5, 1967) is a Moroccan-Swiss computer scientist and a professor at the School of Computer and Communication Sciences at École Polytechnique Fédérale de Lausanne (EPFL), known for his contributions in the fields of concurrent and distributed computing.
Rachid 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 received his PhD from the University of Orsay (1992) and has been affiliated with Ecole des Mines of Paris, the Commissariat à l'Energie Atomique of Saclay, Hewlett Packard Laboratories and the Massachusetts Institute of Technology.
He is an associate (area) editor of the Journal of the ACM and is the co-author of several books, including "Algorithms for Concurrent Systems", "Introduction to Reliable and Secure Distributed Programming" and "Principles of Transactional Memory".
He won an ERC Advanced Grant Award (2013) and the Google Focused Award (2014).
He also received the 10-Year Best Paper Award at Middleware 2014,
Beyond his scientific and academic work, Guerraoui works on the popularization of computer science.
He co-initiated the Wandida teaching project on YouTube, a library of 300+ videos on computer science and mathematics with 2.5 million views and over 25 thousand subscribers, as well as the Zettabytes education project, a library of videos related to introducing major computer science discoveries and open problems to the general public.
Rachid maintains strong ties to Morocco through his participation in the public debate and the Moroccan political life.
With his co-workers, Guerraoui received Best Paper Awards at the following scientific conferences: ACM Middleware (2016, 2014, 2012), ICDCN (2011), Eurosys (2010), DISC (2010) and OPODIS (2006).
He is an ACM Fellow and the Chair in Informatics and Computational Science for the year 2018–2019 at Collège de France for distributed computing.
In December 2019, he was appointed by King Mohammed VI as a member of the Special Committee on Model of Development.
Guerraoui worked on establishing theoretical foundations of Transactional Memory (TM).
He co-defined a concept he called opacity, used for establishing correctness of TMs.
On the practical side, he co-devised elastic transactions and co-designed SwissTM, a throughput-efficient software transactional memory (STM) as well as a benchmark for TM systems, STMBench7.
Earlier, Guerraoui studied scalable information dissemination methods.
His paper on lightweight epidemic broadcast 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, gained over 1250 citations combined as of 2018, among which a number of theory papers on the analysis of gossip protocols in realistic settings.
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.
He further proved fundamental results on the relationships between classical distributed computing problems, such as atomic commitment 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.
Guerraoui further co-defined a general methodology to build highly concurrent asynchronous data structures and has shown how asynchrony can help build pseudo-random numbers.
Guerraoui invented the mathematical abstraction of indulgence 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.
