Maurice Herlihy

Maurice Herlihy
Name	Maurice Herlihy
Birth date	1954
Birth place	United States
Fields	Computer science; Distributed computing; Concurrent computing
Institutions	Brown University; IBM Research; Massachusetts Institute of Technology
Alma mater	Brown University; University of California, Berkeley
Doctoral advisor	Richard M. Karp
Known for	Linearizability; wait-free synchronization; transactional memory
Awards	ACM Turing Award; IEEE John von Neumann Medal; Gödel Prize

Maurice Herlihy Maurice Herlihy is an American computer scientist noted for foundational contributions to concurrent computing, distributed computing, and the theory and practice of synchronization. His work on correctness conditions, nonblocking algorithms, and transactional models has influenced research at institutions such as Brown University, IBM Research, and Massachusetts Institute of Technology. Herlihy's collaborations and mentorship span a wide network including figures associated with Richard M. Karp, Leslie Lamport, Nancy Lynch, Mihir Bellare, and groups working on multicore processors and cluster computing.

Early life and education

Herlihy was born in 1954 in the United States and pursued undergraduate studies at Brown University, where he received a background that connected him to leading researchers in computer engineering and applied mathematics. He completed his Ph.D. at the University of California, Berkeley under the supervision of Richard M. Karp, whose students and collaborators include contributors to algorithm design and complexity theory. During his graduate training he engaged with research communities around theoretical computer science, parallel algorithms, and early projects linked to Bell Labs and DARPA-funded initiatives.

Academic career and positions

Herlihy has held faculty and research positions at several premier institutions. He was a faculty member in the Computer Science Department at Brown University, where he taught courses and advised students who later joined faculties at MIT, Stanford University, Carnegie Mellon University, and UC Berkeley. He spent time as a researcher at IBM Research, collaborating with teams involved in concurrency control, transaction processing, and the design of symmetric multiprocessing systems. Herlihy has participated in program committees and editorial boards for venues including ACM SIGPLAN, ACM SIGOPS, IEEE Symposium on Foundations of Computer Science, and the ACM Symposium on Principles of Distributed Computing.

Research contributions and notable works

Herlihy's research established rigorous frameworks and constructive methods central to modern concurrent programming.

- Linearizability and correctness: He introduced and formalized the notion of linearizability as a correctness condition for concurrent objects, drawing connections to earlier work by Leslie Lamport and Nancy Lynch. Linearizability provided a compositional semantics that impacted design in database systems, replicated state machines, and distributed algorithms.

- Wait-free and nonblocking synchronization: Herlihy developed methods for designing wait-free algorithms and lower bounds for synchronization using read-modify-write primitives such as compare-and-swap and fetch-and-add. His work interacts with results from Maurice Herlihy (not linked per instruction), Herbert Simon-style algorithmic theory, and practical implementations on Intel and ARM architectures.

- Transactional memory and software transactional memory: He was a pioneer in articulating transactional memory models for both hardware and software implementations, influencing research groups at Sun Microsystems, Intel Labs, and academic projects at MIT and EPFL. These models informed the design of concurrency control in multicore processors and influenced industrial systems like Oracle and Microsoft runtime libraries.

- Combinatorial and algebraic methods: Herlihy applied topological and combinatorial techniques to distributed computing, linking to work by scholars at Cornell University, Harvard University, and Princeton University on impossibility results, consensus problems, and the Byzantine Generals Problem lineage.

His collaborative publications frequently intersected with researchers affiliated with ACM, IEEE, NSF-funded projects, and European groups such as INRIA and CNRS.

Awards and honors

Herlihy's achievements have been recognized by multiple major awards and fellowships. He received the ACM Turing Award for contributions to concurrent computing and the theory of synchronization, joining past recipients from IBM Research, Bell Labs, and leading universities. He was awarded the Gödel Prize for work that bridged theory and practice in distributed systems, and the IEEE John von Neumann Medal for contributions to computer architecture and synchronization primitives. He is a fellow of the Association for Computing Machinery and a member of the National Academy of Engineering, reflecting broad recognition from communities that include scholars from Stanford University, Cambridge University, and ETH Zurich.

Selected publications and legacy

Herlihy authored and co-authored numerous influential papers and books that are standard references in the fields of concurrent and distributed computing. Notable works include foundational papers on linearizability, wait-free constructions, and transactional memory, many published in proceedings of ACM SIGACT, IEEE S&P, and the ACM Symposium on Theory of Computing. He co-authored textbooks and survey articles used in courses at Brown University, MIT, Carnegie Mellon University, and UC Berkeley.

Herlihy's legacy endures through his students and collaborators who have become faculty and researchers at Princeton University, University of Washington, University of Illinois Urbana–Champaign, and University of Toronto. His concepts continue to influence implementations in Linux kernel development, JVM concurrency libraries, and research agendas at Google Research, Microsoft Research, and Amazon Web Services. He is frequently cited in work on blockchain consensus mechanisms, cloud computing orchestration, and real-time systems design.

Category:Computer scientists Category:Distributed computing