Concept

Optimistic replication

Publications associées (23)

A minimal model of stable autocatalytic RNA-replication through integration of replication, molecular regulation, and energy conversion

Catalysis and allostery are complementary principles of biological function: catalysis accelerates biochemical reactions, whereas allosteric regulation dynamically controls molecular interactions. The emergence and persistence of early autocatalytic ribozyme systems likely depended not only on template-directed self-replication but also on ATP production, utilization, and recycling through prebiotically plausible energy-conversion processes. We previously proposed that resistance to molecular parasitism in

bioRxiv2026

Integrated Estimation and Calibration: A Model Formulation Approach

Michel Bierlaire

Disaggregated models such as activity-based models play a crucial role in urban planning, infrastructure development, and traffic management. However, these models encounter several challenges, such as sequential development, error propagation, and asynchronicity in data and model components. These challenges can result in inefficiencies and inaccuracies in capturing system dynamics. This paper aims to reconcile these challenges by treating the transport model as a unified entity and considering the interde

Elsevier BV2024

Hierarchical Micromold Structuring via 2PP Micro-Stereolithography

Inspired by nature, a common way to create hydrophobic surfaces is by introducing hierarchical and fractal microstructures on surface. While plenty of studies have demonstratedcreating PDC (polymer derived ceramic) for several applications include SiC-fiber for composite materials and cantilever in ceramic MEMs, no research from the author’s knowledge is devoted to creating hydrophobic PDC surface by fabricate micro size array-like structure on PDC. Therefore, fabricate hydrophobic PDC surface is the main g

2020

Mitigating Load Imbalance in Distributed Data Serving with Rack-Scale Memory Pooling

Babak Falsafi, Edouard Bugnion, Boris Robert Grot, Alexandros Daglis, Stanko Novakovic, Dmitrii Ustiugov

To provide low-latency and high-throughput guarantees, most large key-value stores keep the data in the memory of many servers. Despite the natural parallelism across lookups, the load imbalance, introduced by heavy skew in the popularity distribution of k ...

2019

Trade-offs in Replicated Systems

Rachid Guerraoui

Replicated systems provide the foundation for most of today’s large-scale services. Engineering such replicated system is an onerous task. The first—and often foremost—step in this task is to establish an appropriate set of design goals, such as availability or performance, which should synthesize all the underlying system properties. Mixing design goals, however, is fraught with dangers, given that many properties are antagonistic and fundamental trade-offs exist among them. Navigating the harsh landscape

2016

RITA: An index-Tuning advisor for replicated databases

Given a replicated database, a divergent design tunes the indexes in each replica differently in order to specialize it for a specific subset of the workload. Empirical studies have shown that this specialization brings significant performance gains compared to the common practice of having the same indexes in all replicas. However, reaping the benefits of divergent designs requires the development of new tuning tools for database administrators, and the existing tools unfortunately suffer from severe short

ACM2015

CoShare: A Cost-effective Data Sharing System for Data Center Networks

Karl Aberer

Numerous research groups and other organizations collect data from popular data sources such as online social networks. This leads to the problem of data islands, wherein all this data is isolated and lying idly, without any use to the community at large. Using existing centralized solutions such as Dropbox to replicate data to all interested parties is prohibitively costly, given the large size of datasets. A practical solution is to use a Peer-to-Peer (P2P) approach to replicate data in a self-organized m

2015

Social-Aware Replication in Geo-Diverse Online Systems

Kévin Clément Huguenin

Distributing long-tail content is a difficult task due to the low amortization of bandwidth transfer costs as such content has limited number of views. Two recent trends are making this problem harder. First, the increasing popularity of user-generated con ...

Institute of Electrical and Electronics Engineers2015

RITA: An Index-Tuning Advisor for Replicated Databases

Given a replicated database, a divergent design tunes the indexes in each replica differently in order to specialize it for a specific subset of the workload. This specialization brings significant performance gains compared to the common practice of having the same indexes in all replicas, but requires the development of new tuning tools for database administrators. In this paper we introduce RITA (Replication-aware Index Tuning Advisor), a novel divergent-tuning advisor that offers several essential featu

Cornell University2013

JPaxos: State machine replication based on the Paxos protocol

André Schiper

State machine replication is a technique for making services fault-tolerant by replicating them over a group of machines. Although the theory of state machine replication has been studied extensively, the engineering challenges of converting a theoretical description into a fully functional system is less understood. This creates difficulties to implementors, because in designing such a system they face many engineering challenges which are crucial to ensure good performance and stability of a replicated sy

2011

SCALAR Data Replication Performance in Mobile Ad hoc Applications

Emre Atsan

Data replication is an indispensable service for mobile ad hoc networks and it helps to increase data availability, reduce communication overhead, achieve fault-tolerance and load balancing. Our scalable and reactive data replication framework SCALAR opera ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Concurrency and dynamic protocol update for group communication middleware

Olivier Rütti

The last three decades have seen computers invading our society: computers are now present at work to improve productivity and at home to enlarge the scope of our hobbies and to communicate. Furthermore, computers have been involved in many critical system ...

EPFL2009

Security in distributed metadata catalogues

Nuno Filipe de Sousa Santos

Catalogue services provide the discovery and location mechanisms that allow users and applications to locate data on Grids. Replication is a highly desirable feature in these services, since it provides the scalability and reliability required on large dat ...

2008

Middleware-based Database Replication: The Gaps between Theory and Practice

The need for high availability and performance in data management systems has been fueling a long running interest in database replication from both academia and industry. However, academic groups often attack replication problems in isolation, overlooking the need for completeness in their solutions, while commercial teams take a holistic approach that often misses opportunities for fundamental innovation. This has created over time a gap between academic research and industrial practice. This paper aims t

arXiv2007

Optimistic Algorithms for Partial Database Replication

Rodrigo Malta Schmidt, Fernando Pedone

In this paper, we study the problem of partial database replication. Numerous previous works have investigated database replication, however, most of them focus on full replication. We are here interested in genuine partial replication protocols, which req ...

2006

A Primary-Backup Protocol for In-Memory Database Replication

The paper presents a primary-backup protocol to manage replicated in-memory database systems (IMDBs). The protocol exploits two features of IMDBs: coarse-grain concurrency control and deferred disk writes. Primary crashes are quickly detected by backups and a new primary is elected whenever the current one is suspected to have failed. False failure suspicions are tolerated and never lead to incorrect behavior. The protocol uses a consensus-like algorithm tailor-made for our replication environment. Under no

2006

A Primary-Backup Protocol for In-Memory Database Replication

Rodrigo Malta Schmidt, Fernando Pedone

2006

Generalized Snapshot Isolation and a Prefix-Consistent Implementation

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, generalized snapshot isolation allows the use of older'' snapshots, facilitating a replicated implementation. We show that many of the desirable properties of snapshot isolation remain. In particular, under certain assumptions on the transaction workl

2004

Beyond 1-Safety and 2-Safety for replicated databases: Group-Safety

André Schiper

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 be used to build 2-safe database replication. We propose a new group communication primitive called \emph{end-to-end atomic broadcast} that solves the problem, i.e., can be used to implement 2-safe database replication. We also introduce a new safety criter

2004

Experimental evaluation results of an advanced DHT-based peer-to-peer system

Karl Aberer

P-Grid is a decentralized DHT-based peer-to-peer system with logarithmic search complexity. As it is intended to provide a platform for distributed information management beyond mere file-sharing it supports an update functionality with lazy consistency guarantees, identity management disentangling the DHT from the underlying networking infrastructure, and decentralized load balancing. In this paper we first give a brief overview of the theoretical foundations of P-Grid and the supporting functionalities. T

2004

Graph Chat

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.

Publications associées (23)

A minimal model of stable autocatalytic RNA-replication through integration of replication, molecular regulation, and energy conversion

bioRxiv2026