Maurice Peter Herlihy (born 4 January 1954) is an American computer scientist active in the field of multiprocessor synchronization. Herlihy has contributed...
6 KB (361 words) - 07:23, 13 September 2024
newsreel narrator Gavan Herlihy (born 1947), New Zealand politician James Leo Herlihy (1927–1993), American writer Maurice Herlihy (born 1954), American...
1 KB (152 words) - 23:12, 28 April 2024
MIT by Barbara Liskov between 1982 and 1988, in collaboration with Maurice Herlihy, Paul Johnson, Robert Scheifler, and William Weihl. It is an extension...
2 KB (122 words) - 00:40, 22 April 2024
this memory location. "Test and test-and-set" is another example. Maurice Herlihy (1991) proved that test-and-set (1-bit comparand) has a finite consensus...
14 KB (2,110 words) - 08:42, 22 August 2024
originated in a 1986 paper by Tom Knight. The idea was popularized by Maurice Herlihy and J. Eliot B. Moss. In 1995, Nir Shavit and Dan Touitou extended...
17 KB (2,108 words) - 21:21, 20 August 2024
operations are also heavily used in non-blocking synchronization. Maurice Herlihy (1991) ranks atomic operations by their consensus numbers, as follows:...
3 KB (325 words) - 02:06, 14 February 2024
collection and multiprocessor synchronization. He is co-inventor with Maurice Herlihy of transactional memory. He is currently (2012) a Professor of computer...
2 KB (206 words) - 07:25, 13 September 2024
Archived (PDF) from the original on 2019-04-02. Retrieved 2019-09-26. Maurice Herlihy and Nir Shavit. "The Art of Multiprocessor Programming". "Spin Locks...
14 KB (1,733 words) - 19:09, 20 August 2024
as well as more sophisticated lock-free and wait-free algorithms. Maurice Herlihy (1991) proved that CAS can implement more of these algorithms than...
20 KB (2,606 words) - 23:18, 21 February 2024
A Program to Play Chess End Games (1968) Doctoral advisor John McCarthy Doctoral students Maurice Herlihy J. Eliot Moss Sanjay Ghemawat Andrew Myers...
21 KB (1,782 words) - 07:16, 13 September 2024