Concept

Hirohito surrender broadcast

Related publications (30)

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.

Optimistic active replication

André Schiper

Replication is a powerful technique for increasing availability of a distributed service. Algorithms for replicating distributed services do however face a dilemma: they should be (1) efficient (low latency), while (2) ensuring consistency of the replicas, ...

IEEE Comput. Soc2001

Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be?

André Schiper, Xavier Défago

Peter Urban, Xavier Defago and Andre Schiper: Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be? Keywords: replication, atomic broadcast, consensus, measurements, robustness, high load, LAN, FLP impossibility Abstra ...

2001

Totally Ordered Broadcast and Multicast Algorithms: A Comprehensive Survey

André Schiper, Xavier Défago

Total order multicast algorithms constitute an important class of problems in distributed systems, especially in the context of fault-tolerance. In short, the problem of total order multicast consists in sending messages to a set of processes, in such a wa ...

2000

Optimistic Active Replication

André Schiper

2000

Efficient Algorithms to Implement Failure Detectors and Solve Consensus in Distributed Systems

The consensus problem is a fundamental paradigm for fault-tolerant distributed computing. It abstracts a family of problems known as agreement problems, e.g., atomic broadcast, atomic commitment, group membership, and leader election. Any solution to Conse ...

2000

Processing Transactions over Optimistic Atomic Broadcast Protocols

André Schiper, Fernando Pedone

Atomic broadcast primitives allow fault-tolerant cooperation between sites in adistributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, scalable applications on top of atomic ...

1999

A Systematic Classification of Replicated Database Protocols based on Atomic Broadcast

André Schiper, Matthias Wiesmann, Fernando Pedone

Database replication protocols based on group communication primitives have recently emerged as a promising technology to improve database fault-tolerance and performance. Roughly speaking, this approach consists in exploiting the order and atomicity prope ...

1999

Using Optimistic Atomic Broadcast in Transaction Processing Systems

André Schiper, Fernando Pedone

Atomic broadcast primitives are often proposed as a mechanism to allow fault-tolerant cooperation between sites in a distributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, s ...

1999

Generic Broadcast

André Schiper, Fernando Pedone

Message ordering is a fundamental abstraction in distributed systems. However, usual ordering guarantees are purely syntactic'', that is, message semantics'' is not taken into consideration, despite the fact that in several cases semantic information a ...

1999

A Petri Net based approach for modelling multi-layered distributed protocols

Nicoleta Sergent

A Petri Net based approach for modelling multi-layered distributed protocols N. Sergent This paper presents an original modelling approach which aims to provide probabilistic guarantees on time in asynchronous distributed systems for several important algo ...

1996