Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Algorithmique répartie

Publications associées (28)

How Fast can a Distributed Transaction Commit?

Rachid Guerraoui, Jingjing Wang

The atomic commit problem lies at the heart of distributed database systems. The problem consists for a set of processes (database nodes) to agree on whether to commit or abort a transaction (agreement property). The commit decision can only be taken if al ...

ACM Press2017

Real-Time Distributed Algorithms for Nonconvex Optimal Power Flow

Colin Neil Jones, Georgios Stathopoulos, Yuejiang Liu, Jean-Hubert Hours

The optimal power flow (OPF) problem, a fundamental problem in power systems, is generally nonconvex and computationally challenging for networks with an increasing number of smart devices and real-time control requirements. In this paper, we first investi ...

2017

Quantization Design for Distributed Optimization

Colin Neil Jones, Melanie Nicole Zeilinger, Ye Pu

We consider the problem of solving a distributed optimization problem using a distributed computing platform, where the communication in the network is limited: each node can only communicate with its neighbors and the channel has a limited data-rate. A co ...

2017

A randomised primal-dual algorithm for distributed radio-interferometric imaging

Yves Wiaux, Jason Douglas McEwen, Rafael Eduardo Carrillo Rangel

Next generation radio telescopes, like the Square Kilometre Array, will acquire an unprecedented amount of data for radio astronomy. The development of fast, parallelisable or distributed algorithms for handling such large-scale data sets is of prime impor ...

Ieee2016

Fixed-wing drones for communication networks

Maja Varga

In the last decade, drones became frequently used to provide eye-in-the-sky overview in the outdoor environment. Their main advantage compared to the other types of robots is that they can fly above obstacles and rough terrains and they can quickly cover l ...

EPFL2016

Never Say Never Probabilistic & Temporal Failure Detectors

Rachid Guerraoui, David Kozhaya

The failure detector approach for solving distributed computing problems has been celebrated for its modularity. This approach allows the construction of algorithms using abstract failure detection mechanisms, defined by axiomatic properties, as building b ...

Ieee2016

Towards 3-D Distributed Odor Source Localization: An Extended Graph-Based Formation Control Algorithm for Plume Tracking

Alcherio Martinoli, Ali Marjovi, Jorge Miguel Dias Almeida Rodrigues Soares, Jonathan Giezendanner, Anil Augustin Kodiyan

The large number of potential applications for robotic odor source localization has motivated the development of a variety of plume tracking algorithms, the majority of which work in restricted two-dimensional scenarios. In this paper, we introduce a distr ...

IEEE2016

A Tighter Analysis of Work Stealing

Nicolas Gabriel Gast

Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost for managing a single centralized list becomes prohibitive. The objective of this wor ...

Springer Berlin Heidelberg2010