Maurice Herlihy

Maurice Peter Herlihy (born January 4, 1954 ) is an American computer scientist.

Life

Herlihy studied mathematics at Harvard University with a bachelor's degree in 1975 and computer science at the Massachusetts Institute of Technology with a master's degree in 1980 and a doctorate in 1984. In the summer of 1982, he conducted research at the Xerox PARC research center . From 1984 to 1989 he was an assistant professor at Carnegie Mellon University and from 1989 to 1994 at DEC's Cambridge Research Laboratory . In 1994 he became an Associate Professor and in 1998 Professor at Brown University . In 2004 and 2005 he did research at Microsoft Research and from 2010 to 2011 he was at Technion .

Herlihy made important contributions to multiprocessor systems (for example transactional memory , which he introduced with Eliot Moss and which was used in advanced processors at Intel and IBM ).

He made fundamental contributions to sync without waiting (Wait-free synchronization), the concept of linearizability led (English linearizability ) with concurrent data structures (with Jeannette Wing) and led Counting Networks with Nir Shavit and James Aspnes. With Shavit he also introduced topological methods in the treatment of distributed algorithms.

Prices

• 2003 Dijkstra Prize for Wait-free synchronization .
• 2004 Gödel Prize for The topological structure of asynchronous computation with Nir Shavit and Wait-free k-set agreement is impossible: The topology of public knowledge with Michael Saks and Fotios Zaharoglou .
• 2012 Dijkstra Prize for Transactional Memory: architectural support for lock-free data structures with Eliot Moss.
• In 2013 he received the W. Wallace McDowell Award for fundamental contributions to the theory and practice of multiprocessor computers .

He is a Fellow of the Association for Computing Machinery . In 2015 he was elected to the American Academy of Arts and Sciences .

Fonts

• with Nir Shavit: The art of multiprocessor programming, Morgan Kaufmann 2008, 2012
• with Dmitry Kozlov and Sergio Rajsbaum: Distributed Computing Through Combinatorial Topology, Morgan Kaufmann 2014

Web links

• Homepage

Individual evidence

1. ↑ ACM Trans. Progr. Lang. Syst., 13, 1991, 124-149
2. ↑ Journal of the ACM, 46, 1999, 858-923
3. ↑ SIAM J. on Computing, 29, 2000, 1449-1483
4. ^ Proc. 1993 Int. Symp. Computer Architecture, San Diego
5. ↑ Laudation McDowell Award ( Memento of the original from March 27, 2013 in the Internet Archive ) Info: The archive link was automatically inserted and not yet checked. Please check the original and archive link according to the instructions and then remove this notice.