Publications related to Goodput

An Iterative Method for Mapping-Aware Frequency Regulation in Dataflow Circuits

Andrea Guerrieri, Lana Josipovic, Carmine Rizzi

Dataflow circuits promise to overcome the scheduling limitations of standard HLS solutions. However, their performance suffers due to timing overheads caused by their handshake communication protocol. Current pipelining solutions fail to account for logic ...

IEEE2023

Genuinely distributed Byzantine machine learning

Rachid Guerraoui, El Mahdi El Mhamdi, Le Nguyen Hoang, Sébastien Louis Alexandre Rouault, Arsany Hany Abdelmessih Guirguis

Machine learning (ML) solutions are nowadays distributed, according to the so-called server/worker architecture. One server holds the model parameters while several workers train the model. Clearly, such architecture is prone to various types of component ...

2022

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

Genuinely Distributed Byzantine Machine Learning

Rachid Guerraoui, El Mahdi El Mhamdi, Le Nguyen Hoang, Sébastien Louis Alexandre Rouault, Arsany Hany Abdelmessih Guirguis

Machine Learning (ML) solutions are nowadays distributed, according to the so-called server/worker architecture. One server holds the model parameters while several workers train the model. Clearly, such architecture is prone to various types of component ...

Association for Computing Machinery2020

High-throughput and adaptive super-resolution fluorescence microscopy of organelles

Dora Mahecic

Fluorescence super-resolution microscopy has allowed unprecedented insight into the workings of biological systems below the diffraction limit of light. Over the past decade, it has overcome several challenges to deliver 3D, multi-color and faster imaging ...

EPFL2020

PolarBear: A 28-nm FD-SOI ASIC for Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Thomas Christoph Müller, Andrea Bonetti, Pascal Giard

Polar codes are a recently proposed class of block codes that provably achieve the capacity of various communication channels. They received a lot of attention as they can do so with low-complexity encoding and decoding algorithms, and they have an explici ...

2017

Incremental Consistency Guarantees for Replicated Objects

Rachid Guerraoui, Dragos-Adrian Seredinschi, Matej Pavlovic

Programming with replicated objects is difficult. Developers must face the fundamental trade-off between consistency and performance head on, while struggling with the complexity of distributed storage stacks. We introduce Correctables, a novel abstraction ...

2016

iPRP: Parallel Redundancy Protocol for IP Networks

Jean-Yves Le Boudec, Dan-Cristian Tomozei, Miroslav Popovic, Maaz Mashood Mohiuddin

Reliable packet delivery within stringent delay constraints is of primal importance to industrial processes with hard real-time constraints, such as electrical grid monitoring. Because retransmission and coding techniques counteract the delay requirements, ...

2015

Fundamental aspects of linear slow light systems

Luc Thévenaz

In a linear slow light system the delaying process is necessarily inducing distortion for fundamental reasons, strictly bounding the maximum delay-bandwidth product to unity. Slowing the light does not directly enhance light-matter interaction, but is a co ...

City University London2015

Cross Layer Energy-Efficiency Optimization For Cognitive Radio Transceivers

Andreas Peter Burg, Carl Christian Sten Dominic Senning

Designing energy-efficient cognitive radio transceivers requires joint optimization of medium access control and the physical layer implementation. In this paper we show an energy efficiency optimization strategy for IEEE 802.11n compliant transceivers in ...

IEEE2014

On the Necessity of Traffic Shaping for PMU Measurement Data Streams

Jean-Yves Le Boudec, Dan-Cristian Tomozei, Peng Gao, Miroslav Popovic

We study the communication network of an on-campus active distribution network (ADN) that comprises phasor measurement units (PMUs) connected to medium-voltage transformers. Within stringent time delays and with minimal loss the PMUs periodically transfer ...

2013

Automating the Testing of OpenFlow Applications

Dejan Kostic, Marco Canini, Jennifer Rexford

Software-defined networking, and the emergence of OpenFlow-capable switches, enables a wide range of new network functionality. However, enhanced programmability inevitably leads to more software faults (or bugs). We believe that tools for testing OpenFlow ...

2011

Finite Block-Length Achievable Rates for Queuing Timing Channels

Thomas Riedl

The exponential server timing channel is known to be the simplest, and in some sense canonical, queuing timing channel. The capacity of this infinite-memory channel is known. Here, we discuss practical finite-length restrictions on the codewords and attemp ...

2011

Boosting Gossip for Live Streaming

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Davide Frey

Gossip protocols are considered very effective to disseminate information in a large scale dynamic distributed system. Their inherent simplicity makes them easy to implement and deploy. However, whereas their probabilistic guarantees are often enough to di ...

2010

LHCb Silicon Tracker DAQ and ECS Online Systems

Olivier Schneider, Aurelio Bay, Guido Haefeli, Frédéric Blanc, Tatsuya Nakada, Christophe Salzmann, Minh Tâm Tran, Raluca Anca Muresan, Mark Tobin, Johan Luisier, Anne Keune, Matthew Needham, Marc-Olivier Bettler, Vincent Fave, Cédric Potterat, Mathias Oleg Knecht, Christophe Bauer, Géraldine Conti, Reto Frei, Louis Nicolas, Aurélie Perrin

The LHCb experiment at CERN is designed to perform precision measurements of b quark decays. The Silicon Tracker plays a crucial role in reconstructing particle trajectories and consists of two silicon micro-strip detectors, the Tracker Turicensis and the ...

2010

Optimizing TCP Receive Performance

Willy Zwaenepoel, Aravind Menon

The performance of the networking stack in an operating system depends on the overhead incurred by two of its components: the per-byte overhead incurred in data-touching operations, and the per-packet overhead of protocol processing and other operating sys ...

2008

On Average Throughput Benefits and Alphabet Size in Network Coding

Christina Fragouli, Emina Soljanin

e analyze a special class of configurations with h sources and N receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to \sq ...

2005

Denial-of-service resilience in peer-to-peer file sharing systems

Willy Zwaenepoel, Dan Mihai Dumitriu

Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. These properties alone are not sufficient, however, to render p2p networks immun ...

2005

SensorScope: Experiences with a Wireless Building Monitoring Sensor Network

Martin Vetterli, Henri Julien Dubois-Ferrière, Thomas Schmid

This paper reports on our experience with the implementation, deployment, and operation of SensorScope, an indoor environmental monitoring network. Nodes run on standard TinyOS components and use B-MAC for the MAC layer implementation. The main component o ...

2005

Protocol overheads in networks

Prasenjit Dey

To increase network capacity, it may not be sufficient to just increase the capacity of the networks. It may be necessary to reduce the network overhead bits, to leave more room for the data bits, to increase the network capacity. As network functions beco ...

EPFL2004