Publication

Optimistic Causal Consistency for Geo-Replicated Key-Value Stores

Publications associées (30)

Reversible Pebbling Game for Quantum Memory Management

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

Quantum memory management is becoming a pressing problem, especially given the recent research effort to develop new and more complex quantum algorithms. The only existing automatic method for quantum states clean-up relies on the availability of many extr ...

IEEE2019

Causal Consistency and Latency Optimality: Friend or Foe? [Extended Version]

Rachid Guerraoui, Willy Zwaenepoel, Junxiong Wang, Diego Didona

Causal consistency is an attractive consistency model for geo-replicated data stores. It is provably the strongest model that tolerates network partitions. It avoids the long latencies associated with strong consistency, and, especially when using read-onl ...

2018

Causal Consistency and Latency Optimality: Friend or Foe?

Rachid Guerraoui, Willy Zwaenepoel, Junxiong Wang, Diego Didona

ASSOC COMPUTING MACHINERY2018

Optimization of Message Encryption for Real-Time Applications in Embedded Systems

Amir Aminifar

Today, security can no longer be treated as a secondary issue in embedded and cyber-physical systems. Therefore, one of the main challenges in these domains is the design of secure embedded systems under stringent resource constraints and real-time require ...

2018

Network-Compute Co-Design for Distributed In-Memory Computing

Alexandros Daglis

The booming popularity of online services is rapidly raising the demands for modern datacenters. In order to cope with data deluge, growing user bases, and tight quality of service constraints, service providers deploy massive datacenters with tens to hund ...

EPFL2018

Caching and Distributed Storage : Models, Limits and Designs

Saeid Sahraei

A simple task of storing a database or transferring it to a different point via a communication channel turns far more complex as the size of the database grows large. Limited bandwidth available for transmission plays a central role in this predicament. I ...

EPFL2018

Single-server Multi-message Private Information Retrieval with Side Information

Michael Christoph Gastpar, Su Li

We study the problem of single-server multi-message private information retrieval with side information. One user wants to recover N out of K independent messages which are stored at a single server. The user initially possesses a subset of M messages as s ...

IEEE2018

The mean-field behavior of processor sharing systems with general job lengths under the SQ(d) policy

Arpan Mukhopadhyay

This paper addresses the mean-field behavior of large-scale systems of parallel servers with a processor sharing service discipline when arrivals are Poisson and jobs have general service time distributions when an SQ(d) routing policy is used. Under this ...

ELSEVIER SCIENCE BV2018

Energy Proportionality in Near-Threshold Computing Servers and Cloud Data Centers: Consolidating or Not?

David Atienza Alonso, Luca Benini, Ali Pahlevan, Marina Zapater Sancho, Yasir Mahmood Qureshi

Cloud Computing aims to efficiently tackle the increasing demand of computing resources, and its popularity has led to a dramatic increase in the number of computing servers and data centers worldwide. However, as effect of post-Dennard scaling, computing ...

2018

Single-server Multi-user Private Information Retrieval with Side Information

Michael Christoph Gastpar, Su Li

In the problem of private information retrieval with side information, a single user wants to recover one of the K independent messages which are stored at one or multiple servers. The user initially has a subset of messages as side information. The goal o ...

2018