Recherche

Afficher tous les résultats pour

Accueil

Personne

Willy Zwaenepoel

Cette personne a quitté l’EPFL

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (57)

Page 3 sur 3

Predicting Replicated Database Scalability from Standalone Database Profiling

Willy Zwaenepoel, Sameh Mohamed Elnikety, Emmanuel Cecchet

This paper develops analytical models to predict the throughput and the response time of a replicated database using measurements of the workload on a standalone database. These models allow workload scalability to be estimated before the replicated system ...

2009

A comparative evaluation of transparent scaling techniques for dynamic content web servers

Willy Zwaenepoel

We study several transparent techniques for scaling dynamic content web sites, and we evaluate their relative impact when used in combination. Full transparency implies strong data consistency as perceived by the user, no modi- fications to existing dynami ...

2005

Job-aware Scheduling in Eagle: Divide and Stick to Your Probes

Willy Zwaenepoel, Diego Didona, Florin Dinu, Pamela Isabel Delgado Borda

We present Eagle, a new hybrid data center scheduler for data-parallel programs. Eagle dynamically divides the nodes of the data center in partitions for the execution of long and short jobs, thereby avoiding head-of-line blocking. Furthermore, it provides ...

ACM2016

Caching Dynamic Web Content: Designing and Analysing an Aspect-Oriented Solution

Willy Zwaenepoel

Caching dynamic web content is an effective approach to reduce Internet latency and server load. An ideal caching solution is one that can be added transparently by the developers and provides complete consistency of the cached documents, while minimizing ...

2006

Causal Consistency and Latency Optimality: Friend or Foe?

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Jingjing Wang

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

ASSOC COMPUTING MACHINERY2018

Tashkent+: Memory-Aware Load Balancing and Update Filtering in Replicated Databases

Willy Zwaenepoel, Sameh Mohamed Elnikety

BEST PAPER AWARDWe present a memory-aware load balancing (MALB) technique to dispatch transactions to replicas in a replicated database. Our MALB algorithm exploits knowledge of the working sets of transactions to ...

2007

Distributed Transactional Systems Cannot Be Fast

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Jingjing Wang, Panagiota Fatourou

We prove that no fully transactional system can provide fast read transactions (including read-only ones that are considered the most frequent in practice). Specifically, to achieve fast read transactions, the system has to give up support of transactions ...

2019

The Battle of the Schedulers: FreeBSD ULE vs. Linux CFS

Willy Zwaenepoel, Baptiste Joseph Eustache Lepers, Sébastien Chevalley, Justinien Gérard Alain Bouron

This paper analyzes the impact on application performance of the design and implementation choices made in two widely used open-source schedulers: ULE, the default FreeBSD scheduler, and CFS, the default Linux scheduler. We compare ULE and CFS in otherwise ...

2018

Towards Proving Optimistic Multicore Schedulers

Willy Zwaenepoel, Baptiste Joseph Eustache Lepers

Operating systems have been shown to waste machine resources by leaving cores idle while work is ready to be scheduled. This results in suboptimal performance for user applications, and wasted power. Recent progress in formal verification methods have led ...

2017

Size-aware Sharding For Improving Tail Latencies in In-memory Key-value Stores

Willy Zwaenepoel, Diego Didona

This paper introduces the concept of size-aware sharding to improve tail latencies for in-memory key-value stores, and describes its implementation in the Minos key-value store. ...

USENIX ASSOC2019

TRIAD: creating synergies between memory, disk and log in log structured key-value stores

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Oana Maria Balmau

We present TRIAD, a new persistent key-value (KV) store based on Log-Structured Merge (LSM) trees. TRIAD improves LSM KV throughput by reducing the write amplification arising in the maintenance of the LSM tree structure. Although occurring in the backgrou ...

2017

Managing Tail Latency in Datacenter-Scale File Systems Under Production Constraints

Willy Zwaenepoel, Ricardo Bianchini, Maria Fernanda Borge Chavez

Distributed file systems often exhibit high tail latencies, especially in large-scale datacenters and in the presence of competing (and possibly higher priority) workloads. This paper introduces techniques for managing tail latencies in these systems, whil ...

ASSOC COMPUTING MACHINERY2019

Willy Zwaenepoel

Graph Chatbot

Predicting Replicated Database Scalability from Standalone Database Profiling

A comparative evaluation of transparent scaling techniques for dynamic content web servers

Job-aware Scheduling in Eagle: Divide and Stick to Your Probes

Caching Dynamic Web Content: Designing and Analysing an Aspect-Oriented Solution

Causal Consistency and Latency Optimality: Friend or Foe?

Tashkent+: Memory-Aware Load Balancing and Update Filtering in Replicated Databases

Distributed Transactional Systems Cannot Be Fast

The Battle of the Schedulers: FreeBSD ULE vs. Linux CFS

Towards Proving Optimistic Multicore Schedulers

Size-aware Sharding For Improving Tail Latencies in In-memory Key-value Stores

TRIAD: creating synergies between memory, disk and log in log structured key-value stores

Managing Tail Latency in Datacenter-Scale File Systems Under Production Constraints

Closing The Performance Gap between Causal Consistency and Eventual Consistency

Profiling Software for Energy Consumption

Sahara: Guiding the Debugging of Failed Software Upgrades

Staged Deployment in Mirage, an Integrated Software Upgrade Testing and Distribution System

Clock-RSM: Low-Latency Inter-Datacenter State Machine Replication Using Loosely Synchronized Physical Clocks