The Complexity of Reliable and Secure Distributed Transactions
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.
The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties.We consider modern variants of such systems where each party is equipped with a tamper proof security module. The security modules trust each other but ca ...
The Common Object Request Broker Architecture standardizes a platform- and programming-language-independent distributed object com-puting environment. It also provides a standard for several distributed servic-es. The Object Transaction Service provides an ...
Database replication protocols have historically been built on top of distributed database systems, and have consequently been designed and implemented using distributed transactional mechanisms, such as atomic commitment. We present the Database State Mac ...
Complex distributed object-oriented systems often need complex concurrency features, which may go beyond the traditional concurrency control associated with separate method calls. A transaction groups together a sequence of operations, and can therefore en ...
Providing type interoperability consists in ensuring that, even if written by different programmers, possibly in different languages and running on different platforms, types that are supposed to represent the same software module are indeed treated as one ...
This paper addresses the question of the weakest failure detector for solving the Non-Blocking Atomic Commit problem (NBAC) in a message passing system where processes can fail by crashing. We define a failure detector, denoted by X, which we show to be su ...
This paper addresses the question of the weakest failure detector to solve the Non-Blocking Atomic Commit (NBAC) problem in an asynchronous system. We define the set A of timeless failure detectors which excludes detectors that provide information about gl ...
The Common Object Request Broker Architecture standardizes a platform- and programming-language-independent distributed object com-puting environment. It also provides a standard for several distributed servic-es. The Object Transaction Service provides an ...
Recent papers [GK03,HT03] define the weakest failure detector for solving the Non-Blocking Atomic Commit problem (NBAC) in a message passing system where processes can fail by crashing and a majority of processes never crash. In this paper, we generalize t ...
Providing type interoperability consists in ensuring that, even if written by different programmers, possibly in different languages and running on different platforms, types that are supposed to represent the same software module are indeed treated as one ...
