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
Easy Impossibility Proofs for Distributed Consensus Problems
TL;DR: Easy proofs are given, of the impossibility of solving several consensus problems (Byzantine agreement, weak agreement, Byzantine firing squad, approximate agreement and clock synchronization) in certain communication graphs, and it is shown that, in the presence ofm faults, no solution exists for communication graphs with fewer than 3m+1 nodes or less than 2m-1 connectivity.
ReportDOI
A Comparison of Some Reliable Test Data Generation Procedures.
TL;DR: This paper is a case study of four test data generation schemes and the FMS.2 mutation system is used to derive a set T such that ms(P,T)=1.
Book ChapterDOI
Fairness of Shared Objects
Michael Merritt,Gadi Taubenfeld +1 more
TL;DR: This work investigates the implementation and power of a range of fairness models that are appropriate to the synchronous, semi-synchronous and asynchronous contexts of various concurrent systems.
Book ChapterDOI
Objects Shared by Byzantine Processes
TL;DR: This work explores situations in which processes accessing shared objects can fail arbitrarily (Byzantine faults), and proposes a solution to this problem.
Nested Transactions, Conflict-Based Locking, and Dynamic Atomicity.
TL;DR: Examination of concurrency control algorithms for nested transaction systems shows that if each object in a nested transaction system uses either Moss' algorithm or the new Conflict-Based Locking algorithm, then all executions of the system will be serially correct.