M
Michael Merritt
Researcher at AT&T Labs
Publications - 86
Citations - 6420
Michael Merritt is an academic researcher from AT&T Labs. The author has contributed to research in topics: Shared memory & Distributed shared memory. The author has an hindex of 33, co-authored 86 publications receiving 6227 citations. Previous affiliations of Michael Merritt include Bell Labs & Lawrence Livermore National Laboratory.
Papers
More filters
Journal ArticleDOI
Introduction to the Theory of Nested Transactions
Nancy Lynch,Michael Merritt +1 more
TL;DR: A new formal model is presented for studying concurrency and resiliency properties for nested transactions and is used to state and prove correctness of a well-known locking algorithm.
Proceedings ArticleDOI
Fast, wait-free (2k-1)-renaming
Yehuda Afek,Michael Merritt +1 more
TL;DR: A fast, wait-free (2k 1)-renaming algorithm which takes O(k2) time, which makes extensive use of tools and techniques developed by Attiya and Fouren.
Proceedings ArticleDOI
The concurrency hierarchy, and algorithms for unbounded concurrency
TL;DR: It is demonstrated that many interesting problems are solvable even in the infinite arrival, unbounded concurrency model, which illuminates relations between notions of wait-free solvability distinguished by arrival pattern, and notions of adaptive, one-shot, and long-livedsolvability.
Book ChapterDOI
Computing with Infinitely Many Processes
Michael Merritt,Gadi Taubenfeld +1 more
TL;DR: Four classic problems in concurrent computing when the number of processes which may participate is infinite are explored, and improved bounds for election when participation is required and a new adaptive algorithm for starvation-free mutual exclusion in a model with unbounded concurrency are proposed.
Journal ArticleDOI
Commutativity-based locking for nested transactions
TL;DR: A new model for describing and reasoning about transaction-processing algorithms is presented, which provides a comprehensive, uniform framework for rigorous correctness proofs and general conditions for a concurrency control algorithm to be correct-i.e., to ensure that transactions appear to be atomic.