Maurice Herlihy

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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 areas including theoretical foundations of wait-free synchronization, linearizable data structures, applications of combinatorial topology to distributed computing, as well as hardware and software transactional memory. He is the An Wang Professor of Computer Science at Brown University, where he has been a member of the faculty since 1994.[4]

Recognition[edit]

References[edit]

  1. ^ "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. 
  2. ^ "Wait-free synchronization". ACM Transactions on Programming Languages and Systems. Retrieved 27 June 2013. 
  3. ^ "Linearizability: a correctness condition for concurrent objects". ACM Transactions on Programming Languages and Systems. Retrieved 27 June 2013. 
  4. ^ "Maurice Herlihy - Brown Research Directory". Retrieved 27 June 2013. 
  5. ^ a b "Edsger W. Dijkstra Prize in Distributed Computing". ACM Proceedings on Distributed Computing. Retrieved 27 June 2012. 
  6. ^ "Gödel Prize". ACM SIGACT. Retrieved 20 August 2011. 
  7. ^ "ACM: Fellows Award / Maurice P Herlihy". Association for Computing Machinery. Retrieved 20 August 2011. 
  8. ^ "W. Wallace McDowell Award". IEEE. Retrieved 5 May 2013. 
  9. ^ "National Academy of Engineering". NAE. Retrieved 30 April 2014. 
  10. ^ "National Academy of Inventors Fellow". Brown University. Retrieved 30 April 2014. 
  11. ^ "American Academy of Arts and Sciences Member". Brown. Retrieved 30 April 2014. 

External links[edit]