2015 - Fellow of the American Academy of Arts and Sciences
2014 - Fellow, National Academy of Inventors
2013 - Member of the National Academy of Engineering For concurrent computing techniques for linearizability, non-blocking data structures, and transactional memory.
2005 - ACM Fellow For contributions to distributed and parallel systems.
His main research concerns Distributed computing, Software transactional memory, Parallel computing, Transactional memory and Data structure. His Distributed computing research incorporates themes from Exploit, Linearizability, Queue and Multi-core processor. The Software transactional memory study combines topics in areas such as Atomicity and Operating system, Concurrency.
His Parallel computing research is multidisciplinary, incorporating elements of Synchronization and Algorithm. His Transactional memory study is focused on Programming language in general. His work on Non-blocking algorithm as part of his general Data structure study is frequently connected to Synchronization, thereby bridging the divide between different branches of science.
Maurice Herlihy spends much of his time researching Distributed computing, Transactional memory, Parallel computing, Theoretical computer science and Data structure. He studied Distributed computing and Shared memory that intersect with Asynchronous communication and Distributed shared memory. His work on Software transactional memory as part of general Transactional memory research is often related to Transactional leadership, thus linking different fields of science.
His work in Theoretical computer science addresses issues such as Set, which are connected to fields such as Upper and lower bounds. Maurice Herlihy works mostly in the field of Data structure, limiting it down to topics relating to Implementation and, in certain cases, Software, as a part of the same area of interest. His Concurrent data structure study combines topics from a wide range of disciplines, such as Linearizability and Hazard pointer.
Maurice Herlihy spends much of his time researching Distributed computing, Transactional memory, Concurrent data structure, Data structure and Theoretical computer science. His study in Distributed computing is interdisciplinary in nature, drawing from both Task, Process and Shared memory. His Transactional memory research includes elements of Scheduling, Embedded system and Parallel computing.
His work carried out in the field of Concurrent data structure brings together such families of science as Hazard pointer, Memory management and Software transactional memory. His specific area of interest is Data structure, where Maurice Herlihy studies Non-blocking algorithm. His biological study spans a wide range of topics, including Computation and Combinatorial topology.
His primary scientific interests are in Distributed computing, Data structure, Parallel computing, Concurrent data structure and Computer security. His Quantum Byzantine agreement study, which is part of a larger body of work in Distributed computing, is frequently linked to Perspective, bridging the gap between disciplines. His Data structure study combines topics in areas such as Queue and Pointer.
His Parallel computing research is multidisciplinary, incorporating perspectives in Trace scheduling, Scalability, Thread, Exploit and Scheduling. Maurice Herlihy has included themes like Hazard pointer, x86 and Uniform memory access in his Concurrent data structure study. His work investigates the relationship between Computer security and topics such as Database transaction that intersect with problems in Hypercube.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Linearizability: a correctness condition for concurrent objects
Maurice P. Herlihy;Jeannette M. Wing.
ACM Transactions on Programming Languages and Systems (1990)
Linearizability: a correctness condition for concurrent objects
Maurice P. Herlihy;Jeannette M. Wing.
ACM Transactions on Programming Languages and Systems (1990)
Transactional memory: architectural support for lock-free data structures
Maurice Herlihy;J. Eliot B. Moss.
international symposium on computer architecture (1993)
Transactional memory: architectural support for lock-free data structures
Maurice Herlihy;J. Eliot B. Moss.
international symposium on computer architecture (1993)
Wait-free synchronization
Maurice Herlihy.
ACM Transactions on Programming Languages and Systems (1991)
Wait-free synchronization
Maurice Herlihy.
ACM Transactions on Programming Languages and Systems (1991)
The Art of Multiprocessor Programming
Maurice Herlihy.
(2008)
The Art of Multiprocessor Programming
Maurice Herlihy.
(2008)
Software transactional memory for dynamic-sized data structures
Maurice Herlihy;Victor Luchangco;Mark Moir;William N. Scherer.
principles of distributed computing (2003)
Software transactional memory for dynamic-sized data structures
Maurice Herlihy;Victor Luchangco;Mark Moir;William N. Scherer.
principles of distributed computing (2003)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
National Autonomous University of Mexico
MIT
Oracle (US)
Algorand Foundation
Columbia University
Technion – Israel Institute of Technology
École Polytechnique Fédérale de Lausanne
Institut de Recherche en Informatique et Systèmes Aléatoires
Oracle (United States)
MIT
University of Namur
Leeds Beckett University
The Ohio State University
The Graduate University for Advanced Studies, SOKENDAI
Brown University
University of Strasbourg
University of Lyon System
National Hellenic Research Foundation
Meikai University
Landcare Research
University of Newcastle Australia
Peking Union Medical College Hospital
National Academies of Sciences, Engineering, and Medicine
University of Queensland
Population Health Research Institute
New School