Fast Fault-Tolerant Concurrent Access to Shared Objects


We consider a synchronous model of distributed computation in which n nodes communicate via point-to-point messages, subject to the following constraints: (i) in a single \step", a node can only send or receive O(logn) words, and (ii) communication is unreliable in that a constant fraction of all messages may be lost at each step due to node and/or link… (More)
DOI: 10.1109/SFCS.1996.548516


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics