Publication

Tashkent: Uniting Durability with Transaction Ordering for High-Performance Scalable Database Replication

Publications associées (80)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

The visible human slice sequence animation web server

Roger Hersch

Since June 1998, EPFL's Visible Human Slice Server (http://visiblehuman.epfl.ch) allows to extract arbitrarily oriented and positioned slices. More than 300,000 slices are extracted each year. In order to give a 3D view of anatomic structures, a new servic ...

Society of Photo-Optical Instrumentation Engineers2001

Transaction Support for Ada

Jörg Kienzle

This paper describes the transaction support framework OPTIMA and its implementation for Ada 95. First, a transaction model that fits concurrent programming languages is presented. Then the design of the framework is given. Applications from many different ...

Springer Verlag2001

Database Replication Techniques: a three parameter classification

André Schiper, Matthias Wiesmann, Fernando Pedone

Data replication is an increasingly important topic as databases are more and more deployed over clusters of workstations. One of the challenges in database replication is to introduce replication without severely affecting performance. Because of this dif ...

IEEE Computer Society2000

Implementing e-Transactions with Asynchronous Replication

Rachid Guerraoui

An e-Transaction is one that executes exactly-once despite failures. This paper describes a distributed protocol that implements the abstraction of e-Transactionsin three-tier architectures. Three-tier architectures are typically Internet-oriented architec ...

2000

Understanding replication in databases and distributed systems

André Schiper, Matthias Wiesmann, Fernando Pedone

Replication is an area of interest to both distributed systems and databases. The solutions developed from these two perspectives are conceptually similar but differ in many aspects: model, assumptions, mechanisms, guarantees provided, and implementation. ...

IEEE Computer Society Technical Commitee on Distributed Processing2000

Data Replication Strategies for Fault Tolerance and Availability on Commodity Clusters

Willy Zwaenepoel

Recent work has shown the advantages of using persistent memory for transaction processing. In particular, the Vista transaction system uses recoverable memory to avoid disk I/O, thus improving performance by several orders of magnitude. In such a system, ...

2000

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

1999

The database state machine and group communication issues

Fernando Pedone

Distributed computing is reshaping the way people think about and do daily life activities. On-line ticket reservation, electronic commerce, and telebanking are examples of services that would be hardly imaginable without distributed computing. Nevertheles ...

EPFL1999

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