Publications associées à Serveur d'applications

Planetary-Scale Byzantine Fault Tolerance

The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...

EPFL2024

Oracular Byzantine Reliable Broadcast

Rachid Guerraoui, Martina Camaioni, Matteo Monti, Manuel José Ribeiro Vidigueira

Byzantine Reliable Broadcast (BRB) is a fundamental distributed computing primitive, with applications ranging from notifications to asynchronous payment systems. Motivated by practical consideration, we study Client-Server Byzantine Reliable Broadcast (CS ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

Hardware and Software Support for RPC-Centric Server Architecture

Mark Johnathon Sutherland

Online services have become ubiquitous in technological society, the global demand for which has driven enterprises to construct gigantic datacenters that run their software. Such facilities have also recently become a substrate for third-party organizatio ...

EPFL2022

When to Hedge in Interactive Services

Edouard Bugnion, Aikaterini Argyraki, Mia Primorac

In online data-intensive (OLDI) services, each client request typically executes on multiple servers in parallel; as a result, “system hiccups”, although rare within a single server, can interfere with many client requests and cause violations of service-l ...

USENIX ASSOC2021

GARFIELD: System Support for Byzantine Machine Learning (Regular Paper)

Rachid Guerraoui, Sébastien Louis Alexandre Rouault, Arsany Hany Abdelmessih Guirguis

We present GARFIELD, a library to transparently make machine learning (ML) applications, initially built with popular (but fragile) frameworks, e.g., TensorFlow and PyTorch, Byzantine–resilient. GARFIELD relies on a novel object–oriented design, reducing t ...

IEEE2021

Task scheduling for highly concurrent analytical and transaction workloads

Anastasia Ailamaki, Iraklis Psaroudakis

Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and ...

2020

Single-server Multi-message Private Information Retrieval with Side Information: the General Cases

Michael Christoph Gastpar, Su Li

The single-server multi-message private information retrieval with side information problem is studied for general cases. In this problem, K independent messages are stored at a single server. One user initially has M messages as side information and wants ...

IEEE2020

GA-Par: Dependable Microservice Orchestration Framework for Geo-Distributed Clouds

Tao Lin, Jie Xu

Recent advances in composing Cloud applications have been driven by deployments of inter-networking heterogeneous microservices across multiple Cloud datacenters. System dependability has been of the upmost importance and criticality to both service vendor ...

IEEE COMPUTER SOC2020

System Support for Efficient Replication in Distributed Systems

Dragos-Adrian Seredinschi

Current online applications, such as search engines, social networks, or file sharing services, execute across a distributed network of machines. They provide non-stop services to their users despite failures in the underlying network. To achieve such a hi ...

EPFL2019

Drowsy-DC: Data center power management system

Willy Zwaenepoel, Baptiste Joseph Eustache Lepers, Mathieu Paul Fernand Bacou

In a modern data center (DC), a large majority of costs arise from energy consumption. The most popular technique used to mitigate this issue is virtualization and more precisely virtual machine (VM) consolidation. Although consolidation may increase serve ...

IEEE2019

Fast General Distributed Transactions with Opacity

Aleksandar Dragojevic, Georgios Chatzopoulos, Stanko Novakovic

Transactions can simplify distributed applications by hiding data distribution, concurrency, and failures from the application developer. Ideally the developer would see the abstraction of a single large machine that runs transactions sequentially and neve ...

ASSOC COMPUTING MACHINERY2019

The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live

Rachid Guerraoui, Victor Bushkov, Panagiota Fatourou

We establish a theorem called the PCL theorem, which states that it is impossible to design a transactional memory algorithm that ensures (1) parallelism, i.e., transactions do not need to synchronize unless they access the same application objects, (2) ve ...

ASSOC COMPUTING MACHINERY2019

Functionality Enhanced Memories for Edge-AI Embedded Systems

David Atienza Alonso, Alexandre Sébastien Julien Levisse, Pierre-Emmanuel Julien Marc Gaillardon, Marco Antonio Rios, William Andrew Simon

With the surge in complexity of edge workloads, it appeared in the scientific community that such workloads cannot be anymore overflown to the cloud due to the huge edge device to server communication energy cost and the high energy consumption induced in ...

IEEE2019

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

Scrub: Online TroubleShooting for Large Mission-Critical Applications

Willy Zwaenepoel

Scrub is a troubleshooting tool for distributed applications that operate under strict SLOs common in production environments. It allows users to formulate queries on events occurring during execution in order to assess the correctness of the application’s ...

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

Learning-Based Hardware Design for Data Acquisition Systems

Cosimo Aprile

This multidisciplinary research work aims to investigate the optimized information extraction from signals or data volumes and to develop tailored hardware implementations that trade-off the complexity of data acquisition with that of data processing, conc ...

EPFL2018

Increasing Availability in Distributed Storage Systems via Clustering

Michael Christoph Gastpar, Saeid Sahraei

We introduce the Fixed Cluster Repair System (FCRS) as a novel architecture for Distributed Storage Systems (DSS) that achieves a small repair bandwidth while guaranteeing a high availability. Specifically, we partition the set of servers in a DSS into s c ...

2018

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

Placement of Virtual Containers on NUMA systems: A Practical and Comprehensive Model

Baptiste Joseph Eustache Lepers

Our work addresses the problem of placement of threads, or virtual cores, onto physical cores in a multicore NUMA system. Different placements result in varying degrees of contention for shared resources, so choosing the right placement can have a large ef ...

USENIX ASSOC2018