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.
In a distributed system using message logging and checkpointing to provide fault tolerance, there is always a unique maximum recoverable system state, regardless of the message logging protocol used. The proof of this relies on the observation that the set ...
In a transactional system, an {\em atomic commitment} protocol ensures that for any transaction, all {\em Data Manager} processes agree on the same outcome {\em (commit} or {\em abort)}. A {\em non-blocking atomic commitment} protocol enables an outcome to ...
A network multicomputer is a multiprocessor in which the processors are connected by general-purpose networking technology, in contrast to current distributed memory multiprocessors where a dedicated special-purpose interconnect is used. The advent of high ...
Distributed computing is one of the major trends in the computer industry. As systems become more distributed, they also become more complex and have to deal with new kinds of problems, such as partial crashes and link failures. To answer the growing deman ...
Fiber Distributed Data Interface (FDDI) is a high speed local area network operating at 100Mbps using a fiber optic ring transmission medium. The purpose of this paper is to build a Petri net model for the FDDI media access control (MAC) protocol. This mod ...
Evaluating Latency of Distributed Algorithms Using Petri Nets N. Sergent The time it takes to a distributed algorithm to finish (the distributed algorithm latency) cannot be directly measured in asynchronous systems if the algorithm starts and ends on diff ...
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 discusses the relationship between the {\em Non-\Blocking Atomic Commitment problem (NB-AC)} and the Consensus problem in asynchronous systems with {\em unreliable} failure detectors. We first confirm that NB-AC is harder than Consensus. In con ...
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 ...
