Concept

Processing delay

Publications associées (11)

The Universal Gossip Fighter

Rachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko, Rafaël Benjamin Pinot

The notion of adversary is a staple of distributed computing. An adversary typically models “hostile” assumptions about the underlying distributed environment, e.g., a network that can drop messages, an operating system that can delay processes or an attac ...

2022

Measuring Network Service Latencies with a Programmable Dataplane

We present a tool for measuring network service latency times under high network load. This tool is a proof-of-concept application designed to show the viability of using programmable network data planes as a basis for both generating a high rate of networ ...

2019

IGCT Low-Current Switching – TCAD and Experimental Characterization

Drazen Dujic, Dragan Stamenkovic

Utilization of the Integrated Gate Commutated Thyristor as a semiconductor switch in the Series Resonant Converter for isolated medium voltage DC-DC conversion offers an opportunity for high conversion efficiency while operating at the high switching frequ ...

2019

Fast and Robust Memory Reclamation for Concurrent Data Structures

Rachid Guerraoui, Mihail Igor Zablotchi, Oana Maria Balmau

In concurrent systems without automatic garbage collection, it is challenging to determine when it is safe to reclaim memory, especially for lock-free data structures. Existing concurrent memory reclamation schemes are either fast but do not tolerate proce ...

2016

Fast and Robust Memory Reclamation for Concurrent Data Structures

Rachid Guerraoui, Mihail Igor Zablotchi, Oana Maria Balmau

2016

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

A Generalized Sampling Method for Finite-Rate-of-Innovation-Signal Reconstruction

Michaël Unser, Chandra Sekhar Seelamantula

The problem of sampling signals that are not admisible within the classical Shannon framework has received much attention in the recent past. Typically, these signals have a parametric representation with a finite number of degrees of freedom per time unit ...

IEEE2008

Stability and bounds in aggregate scheduling networks

Gianluca Rizzo

We study networks of FIFO nodes, where flows are constrained by arrival curves. A crucial question with these networks is: Can we derive a bound to the maximum delay that a packet can experience when traversing the network, and to the maximum queue size at ...

EPFL2008

Distributed signal processing for binaural hearing aids

Olivier Roy

Over the last centuries, hearing aids have evolved from crude and bulky horn-shaped instruments to lightweight and almost invisible digital signal processing devices. While most of the research has focused on the design of monaural apparatus, the use of a ...

EPFL2008

A Min-Plus System Theory for Constrained Traffic Regulation and Dynamic Service Guarantees

Jean-Yves Le Boudec, Patrick Thiran

By extending the system theory under the (min,+)-algebra to the time varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic service guarantees. For a constrained traffic regulation problem with maximum to ...

1999

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search