This paper defines the Non-Blocking Atomic Commitment problem in a message-passing asynchronous system and determines a failure detector to solve the problem. This failure detector, which we call the modal failure detector star, and which we denote by M*, is strictly weaker than the perfect failure detector P but strictly stronger than the eventually perfect failure detector ◇P. The paper shows that at any environment, the problem is solvable with M*. © 2012 Springer-Verlag.
CITATION STYLE
Park, S. H., & Lee, S. H. (2012). Non-blocking atomic commitment in asynchronous distributed systems with faulty processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7439 LNCS, pp. 405–413). https://doi.org/10.1007/978-3-642-33078-0_29
Mendeley helps you to discover research relevant for your work.