Publication

The database state machine and group communication issues

Related publications (201)

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.

Pronto: High Availability for Standard Off-the-shelf Databases

Fernando Pedone

Enterprise applications typically store their state in databases. If a database fails, the application is unavailable while the database recovers. Database recovery is time consuming because it involves replaying the persistent transaction log. To isolate ...

2004

Scaling Laws for Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

Consider a set of correlated sources located at the nodes of a network, and a sink to which the data from all the sources has to arrive. We address the minimization of a separable joint communication cost function given by the product [rate]

\times

[edge ...

2004

Towards JMS Compliant Group Communication - a Semantic Mapping

André Schiper, Matthias Wiesmann, Stefan Pleisch, Arnas Kupsys

Group communication provides communication primitives with various semantics and their use greatly simplifies the development of highly available services. However, despite tremendous advances in research and numerous prototypes, group communication stays ...

2004

Power-Efficient Sensor Placement and Transmission Structure for Data Gathering under Distortion Constraints

Razvan Cristescu

We consider the joint optimization of sensor placement and transmission structure for data gathering, where a given number of nodes need to be placed in a field such that the sensed data can be recon structed at a sink within specified distortion bounds wh ...

2004

A new look at atomic broadcast in the asynchronous crash-recovery model

André Schiper, Sergio Mena

Atomic broadcast in particular, and group communication in general, have mainly been specified and implemented in a system model where processes do not recover after a crash. The model is called crash-stop. The drawback of this model is its inability to ex ...

2004

Total Order Broadcast and Multicast Algorithms: Taxonomy and Survey

André Schiper, Xavier Défago

Total order broadcast and multicast (also called atomic broadcast/multicast) present an important problem in distributed systems, especially with respect to fault-tolerance. In short, the primitive ensures that messages sent to a set of processes are, in t ...

2004

The Database State Machine Approach

Rachid Guerraoui, André Schiper, Fernando Pedone

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 ...

2003

Beyond 1-Safety and 2-Safety for Replicated Databases: Group-Safety

André Schiper, Matthias Wiesmann

In this paper, we study the safety guarantees of group communication-based database replication techniques. We show that there is a model mismatch between group communication and database, and because of this, classical group communication systems cannot b ...

2003

Evaluating the performance of distributed agreement algorithms

Nowadays, networked computers are present in most aspects of everyday life. Moreover, essential parts of society come to depend on distributed systems formed of networked computers, thus making such systems secure and fault tolerant is a top priority. If t ...

EPFL2003

Conflict-Aware Scheduling for Dynamic Content Applications

Willy Zwaenepoel

We present a new lazy replication technique, suitable for scaling the back-end database of a dynamic content site using a cluster of commodity computers. Our technique, called conflict-aware scheduling, provides both throughput scaling and 1-copy serializa ...

2003

Scaling Laws for Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

\times

[edge ...

2004