Maurice Herlihy
Maurice Peter Herlihy (born 4 January 1954) is a computer scientist active in the field of multiprocessor synchronization.[1][2][3] Herlihy has contributed to the design of concurrent algorithms, and in particular to the exposition and quantification of the properties and uses of hardware synchronization operations. He is a professor of computer science at Brown University since 1998.[4]
Recognition
- 2003 Dijkstra Prize[5]
- 2004 Gödel prize[6]
- 2005 Fellow of the Association for Computing Machinery[7]
- 2012 Dijkstra Prize[5]
- 2013 W. Wallace McDowell Award[8]
- 2013 National Academy of Engineering[9]
- 2014 National Academy of Inventors Fellow[10]
- 2015 American Academy of Arts and Sciences Member[11]
References
- ↑ "Linearizability: a correctness condition for concurrent objects". ACM Transactions on Programming Languages and Systems. Retrieved 27 June 2013.
- ↑ "Transactional memory: architectural support for lock-free data structures". ACM SIGARCH Computer Architecture News - Special Issue: Proceedings of the 20th annual international symposium on Computer architecture (ISCA '93). Retrieved 27 June 2013.
- ↑ "Wait-free synchronization". ACM Transactions on Programming Languages and Systems. Retrieved 27 June 2013.
- ↑ "Maurice Herlihy - Brown Research Directory". Retrieved 27 June 2013.
- 1 2 "Edsger W. Dijkstra Prize in Distributed Computing". ACM Proceedings on Distributed Computing. Retrieved 27 June 2012.
- ↑ "Gödel Prize". ACM SIGACT. Retrieved 20 August 2011.
- ↑ "ACM: Fellows Award / Maurice P Herlihy". Association for Computing Machinery. Retrieved 20 August 2011.
- ↑ "W. Wallace McDowell Award". IEEE. Retrieved 5 May 2013.
- ↑ "National Academy of Engineering". NAE. Retrieved 30 April 2014.
- ↑ "National Academy of Inventors Fellow". Brown University. Retrieved 30 April 2014.
- ↑ "American Academy of Arts and Sciences Member". Brown. Retrieved 30 April 2014.
External links
| ||||||
|
This article is issued from Wikipedia - version of the Sunday, February 14, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.