Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this thesis, we revisit classic problems in shared-memory distributed computing through the lenses of (1) emerging hardware technologies and (2) changing requirements. Our contributions consist, on the one hand, in providing a better understanding of th ...
EPFL2020
,
Modern asynchronous runtime systems allow the re-thinking of large-scale scientific applications. With the example of a simulator of morphologically detailed neural networks, we show how detaching from the commonly used bulk-synchronous parallel (BSP) exec ...
We present two Lie algebroids linked to the construction of the linearizing output of an input affine nonlinear system. The algorithmic development of the linearizing output proceeds inductively, and each stage has two structures, namely a codimension one ...
Asynchronous task allocation is a fundamental problem in distributed computing, in which p asyn- chronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key bui ...
We introduce a new distributed computing model called m&m that allows processes to both pass messages and share memory. Motivated by recent hardware trends, we find that this model improves the power of the pure message-passing and shared-memory models. As ...
Two Lie algebroids are presented that are linked to the construction of the linearizing output of an affine in the input nonlinear system.\ The algorithmic construction of the linearizing output proceeds inductively, and each stage has two structures, name ...
Asynchronous task allocation is a fundamental problem in distributed computing in which p asynchronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key buildi ...
The increased number of cores integrated on a chip has brought about a number of challenges. Concerns about the scalability of cache coherence protocols have urged both researchers and practitioners to explore alternative programming models, where cache co ...
EPFL2015
, , ,
Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes in a distributed system deliver the same set of messages. The reason why this primitive is appealing is twofold: (i) we can implement it deterministically in a co ...
Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik2021
, ,
LDPC codes are typically decoded by running a synchronous message passing algorithm over the corresponding bipartite factor graph (made of variable and check nodes). More specifically, each synchronous round consists of 1) updating all variable nodes based ...
