Efficient Protocols for Enforcing Causal Consistency in Geo-Replicated Key-Value Data Stores
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Recent work has shown the advantages of using persistent memory for transaction processing. In particular, the Vista transaction system uses recoverable memory to avoid disk I/O, thus improving performance by several orders of magnitude. In such a system, ...
This paper presents the foundations of Rapids ("Replicated Ada Partitions In Distributed Systems"), an implementation of the Distributed Systems Annex E incorporating the transparent replication of partitions in distributed Ada 95 applications. Rapids is a ...
Transaction Reordering in Replicated Databases F.Pedone, R.Guerraoui and A.Schiper This paper presents a fault-tolerant lazy replication protocol that ensures 1-copy serializability at a relatively low cost. Unlike eager replication approaches, our protoco ...
This paper presents the semi-passive replication technique -- a variant of passive replication -- that can be implemented in the asynchronous system model without requiring a membership service to agree on a primary. Passive replication is a popular replic ...
In a transactional system, an atomic commitment protocol ensures that for any transaction, all data managers agree on the same outcome: commit or abort. A non-blocking atomic commitment protocol enables an outcome to be decided at every correct data manage ...
This paper presents x-ability (Exactly-once-ability): a correctness criteria for replicated services. X-ability provides the illusion that the actions executed by a replicated service are executed exactly-once, even if these actions have been actually exec ...
Distributed computing is reshaping the way people think about and do daily life activities. On-line ticket reservation, electronic commerce, and telebanking are examples of services that would be hardly imaginable without distributed computing. Nevertheles ...
Sequential consistency and causal consistency constitute two of the main consistency criteria used to define the semantics of accesses in the shared memory model. An execution is sequentially consistent if all processes can agree on a same legal sequential ...
The following dissertation addresses one aspect of cooperative editing which has not been well examined until now : the consideration of hardware limitations imposed by a large scale distributed system (namely the Internet). This system model implies heter ...
Transaction Reordering in Replicated Databases F.Pedone, R.Guerraoui and A.Schiper This paper presents a fault-tolerant lazy replication protocol that ensures 1-copy serializability at a relatively low cost. Unlike eager replication approaches, our protoco ...
