Publication

Scaling up Mixed Workloads: a Battle of Data Freshness, Flexibility, and Scheduling

Related publications (117)

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.

Consistent Main-Memory Database Federations under Deferred Disk Writes

Rodrigo Malta Schmidt, Fernando Pedone

Current cluster architectures provide the ideal environment to run federations of main-memory database systems (FMMDBs). In FMMDBs, data resides in the main memory of the federation servers, significantly improving performance by avoiding I/O during the ex ...

2005

Parameterizing Deformable Surfaces for Monocular 3--D Tracking

Pascal Fua, Mathieu Salzmann, Slobodan Ilic

e propose a deformable surface parameterization that is generic and lets us automatically build registered shape databases. This allows us to directly derive low-dimensional shape models using a simple dimensionality reduction technique. This addresses one ...

2005

Generalized Snapshot Isolation and a Prefix-Consistent Implementation

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

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

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

2004

Looking Ahead in Open Multithreaded Transactions

Maxime Monod

Complex distributed object-oriented systems often need complex concurrency features, which may go beyond the traditional concurrency control associated with separate method calls. A transaction groups together a sequence of operations, and can therefore en ...

2004

On the Use of Speech and Face Information for Identity Verification

{T}his report first provides a review of important concepts in the field of information fusion, followed by a review of important milestones in audio-visual person identification and verification. {S}everal recent adaptive and non-adaptive techniques for r ...

IDIAP2004

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

Using Code Transformation for Consistent and Transparent Caching of Dynamic Web Content

Willy Zwaenepoel, Sumit Mittal

We present a consistent and transparent caching system for dynamic web pages produced by a server-side application using a back-end database. Cached pages always reflect current database values. No intervention from the programmer is necessary to implement ...

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