Concept

Schedule (computer science)

Related publications (79)

Comparison of Database Replication Techniques Based on Total Order Broadcast

In this paper, we present a performance comparison of database replication techniques based on total order broadcast. While the performance of total order broadcast-based replication techniques has been studied in previous papers, this paper presents many ...

2005

Database Replication Using Generalized Snapshot Isolation

Willy Zwaenepoel, Sameh Mohamed Elnikety, Fernando Pedone

Generalized snapshot isolation extends snapshot isolation as used in Oracle and other databases in a manner suitable for replicated databases. While (conventional) snapshot isolation requires that transactions observe the “latest” snapshot of the database, ...

2005

The CHT Play

Rachid Guerraoui, Felix Gaertner

This note gives a high level and informal account of the necessary part of the proof that Ω is the weakest failure detector to implement consensus with a majority of correct processes. The proof originally appeared in a widely cited but rarely understood p ...

2004

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

Generalized Snapshot Isolation and a Prefix-Consistent Implementation

Willy Zwaenepoel, Sameh Mohamed Elnikety, Fernando Pedone

2004

Pragmatic Type Interoperability

Rachid Guerraoui, Patrick Eugster, Philippe Altherr

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

2003

Pragmatic Type Interoperability

Rachid Guerraoui, Patrick Eugster

2003

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

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

Automatic Serialization of Dynamic Structures in Ada

Serialization is the process that transforms the state of a software object into a sequence of bytes. Serialization is useful, for example, to store the value of an object in persistent memory or to send it through a network channel. Ada provides object se ...

2003

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.