Leader election

Eventual leader election is an essential service for many reliable applications that require coordination actions on top of asynchronous fail-prone distributed systems. In 26 we proposed an new algorithm that eventually elects a leader for each connected component of a dynamic network where nodes can move or fail by crash. A node only communicates with nodes in its transmission range and locally keeps a global view, denoted topological knowledge, of the communication graph of the network and its dynamic evolution. Every change in the topology or in nodes membership is detected by one or more nodes and propagated over the network, updating thus the topological knowledge of the nodes. As the choice of the leader has an impact on the performance of applications that use an eventual leader election service, our algorithm, thanks to nodes topological knowledge, exploits the closeness centrality as the criterion for electing a leader. Experiments were conducted on top of PeerSim simulator, comparing our algorithm to a representative flooding algorithm. Performance results show that our algorithm outperforms the flooding one when considering leader choice stability, number of messages, and average distance to the leader.

Self-Stabilizing Leader election

Essentially, self-stabilizing algorithms tolerate transient failures, since by definition such failures last a finite time (as opposed to crash failures, for example) and their frequency is low (as opposed to intermittent failures).

We initiate research on self-stabilization in highly dynamic identified message passing systems where the dynamics is modeled using TVGs to obtain solutions tolerating both transient faults and high dynamics in 16. We reformulate the definition of self-stabilization to accommodate Time-Vary Graphs (TVGs).

We investigate the self-stabilizing leader election problem. This problem is fundamental in distributed computing since it allows to synchronize and self-organize a network. In 17, we have studied this problem in three classes of TVGs: (i) the ${\mathrm{𝒯𝒞}}^{ℬ}\left(\Delta \right)$ class of TVGs with temporal diameter bounded by $\Delta$, (ii) the ${\mathrm{𝒯𝒞}}^{𝒬}\left(\Delta \right)$ class of TVGs with temporal diameter almost bounded by $\Delta$ and (iii) the class of TVGs with recurrent temporal connectivity, ${\mathrm{𝒯𝒞}}^{ℛ}$. We show that in spite of the identities, in the ${\mathrm{𝒯𝒞}}^{𝒬}\left(\Delta \right)$ class and in the ${\mathrm{𝒯𝒞}}^{ℛ}$ class, any self-stabilizing election algorithm requires the exact knowledge of the number of processes. Then, we propose three election algorithms. The first, for the ${\mathrm{𝒯𝒞}}^{ℬ}\left(\Delta \right)$ class, stabilizes at most $3\Delta$ rounds. In the classes ${\mathrm{𝒯𝒞}}^{𝒬}\left(\Delta \right)$ and ${\mathrm{𝒯𝒞}}^{ℛ}$, the stabilization time of a self-stabilizing election algorithm cannot be limited. However, we show that our two solutions are speculative, i.e. they have good performances in favorable cases; indeed, they stabilize in $O\left(\Delta \right)$ rounds when restricted to the ${\mathrm{𝒯𝒞}}^{ℬ}\left(\Delta \right)$ class.

From Gathering to Leader Election

A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels which are positive integers, and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally considered under the assumption that when some agents are at the same node then they can talk, i.e., exchange currently available information. In 24, we ask the question of whether this ability of talking is needed for gathering. The answer turns out to be no.

Our main contribution are two deterministic algorithms that always accomplish gathering in a much weaker model. We only assume that at any time an agent knows how many agents are at the node that it currently occupies but agents do not see the labels of other co-located agents and cannot exchange any information with them. They also do not see other nodes than the current one. Our first algorithm works under the assumption that agents know a priori some upper bound $N$ on the size of the network, and it works in time polynomial in $N$ and in the length $\ell$ of the smallest label. Our second algorithm does not assume any a priori knowledge about the network but its complexity is exponential in the size ofthe network and in the labels of agents. Its purpose is to show feasibility of gathering under this harsher scenario.

As a by-product of our techniques we obtain, in the same weak model, the solution of the fundamental problem of leader election among agents: One agent is elected aleader and all agents learn its identity. As an application of our result we also solve, in the same model, the well-known gossiping problem: if each agent has a message at the beginning, we show how to make all messages known to all agents, even without any a priori knowledge about the network. If agents know an upper bound $N$ on the size of the network then our gossiping algorithm works in time polynomial in $N$, in the length of the smallest label $\ell$ and in the length of the largest message.

Robustness

In 10, we investigate a special case of hereditary property in graphs, referred to as robustness. A property (or structure) is called robust in a graph $G$ if it is inherited by all the connected spanning subgraphs of $G$. We motivate this definition using two different settings of dynamic networks. The first corresponds to networks of low dynamicity, where some links may be permanently removed so long as the network remains connected. The second corresponds to highly-dynamic networks, where communication links appear and disappear arbitrarily often, subject only to the requirement that the entities are temporally connected in a recurrent fashion (i.e. they can always reach each other through temporal paths). Each context induces a different interpretation of the notion of robustness.

We start by motivating the definition and discussing the two interpretations, after what we consider the notion independently from its interpretation, taking as our focus the robustness of maximal independent sets (MIS). A graph may or may not admit a robust MIS. We characterize the set of graphs in which all MISs are robust. Then, we turn our attention to the graphs that admit a robust MIS. This class has a more complex structure; we give a partial characterization in terms of elementary graph properties, then a complete characterization by means of a (polynomial time) decision algorithm that accepts if and only if a robust MIS exists. This algorithm can be adapted to construct such a solution if one exists.

Treasure Hunt with Angular Hints

In 9, we consider a mobile agent equipped with a compass and a measure of length has to find an inert treasure in the Euclidean plane. Both the agent and the treasure are modeled as points. In the beginning, the agent is at a distance at most $D>0$ from the treasure, but knows neither the distance nor any bound on it. Finding the treasure means getting at distance at most 1 from it. The agent makes a series of moves. Each of them consists in moving straight in a chosen direction at a chosen distance. In the beginning and after each move the agent gets a hint consisting of a positive angle smaller than $2\pi$ whose vertex is at the current position of the agent and within which the treasure is contained. We investigate the problem of how these hints permit the agent to lower the cost of finding the treasure, using a deterministic algorithm, where the cost is the worst-case total length of the agent's trajectory. It is well known that without any hint the optimal (worst case) cost is $\Theta \left(D^2\right)$. We show that if all angles given as hints are at most $\pi$, then the cost can be lowered to $O\left(D\right)$, which is optimal. If all angles are at most $\beta$, where $\beta <2\pi$ is a constant unknown to the agent, then the cost is at most $O\left(D^{2-ϵ}\right)$, for some $ϵ>0$. For both these positive results we present deterministic algorithms achieving the above costs. Finally, if angles given as hints can be arbitrary, smaller than $2\pi$, then we show that cost $\Theta \left(D^2\right)$ cannot be beaten.

Grid Exploration by Asynchronous Oblivious Robots

In 13, we deal with a team of autonomous robots that are endowed with motion actuators and visibility sensors. Those robots are weak and evolve in a discrete environment. By weak, we mean that they are anonymous, uniform, unable to explicitly communicate, and oblivious.

We propose optimal (w.r.t. the number of robots) deterministic solutions for the terminating exploration of an anonymous grid-shaped network by a team of asynchronous oblivious robots.

We first consider the semi-synchronous model. We show that it is impossible to explore a grid of at least 3 nodes with less than 3 robots. Next, we show that it is impossible to explore a $(2,2)$-Grid with less than 4 robots, and a $(3,3)$-Grid with less than 5 robots, respectively. The two first results hold for both deterministic and probabilistic settings, while the latter holds only in the deterministic case.

We then consider the asynchronous model. This latter being strictly weakest than the semi-synchronous model, all the aforementioned impossibility results still hold in that context. We then propose deterministic algorithms to exhibit the optimal number of robots allowing to explore of a given grid. Our results show that except in two particular cases, 3 robots are necessary and sufficient to deterministically explore a grid of at least 3 nodes. The optimal number of robots for the two remaining cases is: 4 for the $(2,2)$-Grid and 5 for the $(3,3)$-Grid, respectively.

Anonymous Rendezvous in the Plane

Two mobile agents represented by points freely moving in the plane and starting at two different positions, have to meet. The meeting, called rendezvous, occurs when agents are at distance at most $r$ of each other and never move after this time, where $r$ is a positive real unknown to them, called the visibility radius. Agents are anonymous and execute the same deterministic algorithm. Each agent has a set of private attributes, some or all of which can differ between agents. These attributes are: the initial position of the agent, its system of coordinates (orientation and chirality), the rate of its clock, its speed when it moves, and the time of its wake-up. If all attributes (except the initial positions) are identical and agents start at distance larger than $r$ then they can never meet, as the distance between them can never change. However, differences between attributes make it sometimes possible to break the symmetry and accomplish rendezvous. Such instances of the rendezvous problem (formalized as lists of attributes), are called feasible.

Our contribution in 23 is three-fold. We first give an exact characterization of feasible instances. Thus it is natural to ask whether there exists a single algorithm that guarantees rendezvous for all these instances. We give a strong negative answer to this question: we show two sets $S_1$ and $S_2$ of feasible instances such that none of them admits a single rendezvous algorithm valid for all instances of the set. On the other hand, we construct a single algorithm that guarantees rendezvous for all feasible instances outside of sets $S_1$ and $S_2$. We observe that these exception sets $S_1$ and $S_2$ are geometrically very small, compared to the set of all feasible instances: they are included in low-dimension subspaces of the latter. Thus, our rendezvous algorithm handling all feasible instances other than these small sets of exceptions can be justly called almost universal.

Minimum Spanning Tree approximation

We explore the impact of approximation on time-polynomial distributed algorithms. In particular we show in 22 that approximation can help reduce the space used for self-stabilization. In the classic state model, where the nodes of a network communicate by reading the states of their neighbors, an important measure of efficiency is the space: the number of bits used at each node to encode the state. In this model, a classic requirement is that the algorithm has to be silent, that is, after stabilization the states should not change anymore. We design a silent self-stabilizing algorithm for the problem of minimum spanning tree, that has a trade-off between the quality of the solution and the space needed to compute it.

Collaborative decision-making in heterogeneous and dynamic environment

New distributed system models such as Fog computing are based on computing resources decentralization. However, this complicates the orchestration of distributed resources due to its large-scale, unreliable and highly dynamic nature preventing any effcicient construction of a global and consistent view. Thus, we need to define new decentralized solutions where different autonomous subsytems, having a local view of their own resources, are able to make collaborative decisions in a reasonable time while limiting the communication cost. In this axis, we currently work about a new model of collaborative decicion-making based on consensus protocols (such as Paxos). In our model, we consider several concurrent sets of nodes on a common dynamic infrastructure where each set runs an instance of a consensus protocol to decide the value of a shared and replicated variable. A given node can belong to several consensus set. This implies that several decisions can be taken asynchronously in the system by several subsets of nodes and decisions conflicts may occur. In case of decision conflict, we need to revoke some decisions in order to garantee the invariants of nodes, which consequently modify the initial definition of the consensus problem. Our works are focused on 1) the execution optimisation of a high number of concurrent consensus and 2) the problem of decision revocability.

This work has been submitted for publication.

Resource management in large networks

Network Operators expect to accurately satisfy a wide range of user's needs by providing fully customized services relying on Network Slicing. The efficiency of Network Slicing depends on an optimized management of network resources and Quality of Service (QoS). We focus on Network Slice placement optimization problem.

In 21 we propose a Proof-of-Concept (PoC) illustrated by an Interactive Gaming time-sensitive use case. In 20, We focus on Virtual Network Functions (VNF) Placement and Chaining problem. In contrary to most studies related to VNF placement, we deal with the most complete and complex Network Slice topologies and we pay special attention to the geographic location of Network Slice Users. We propose a data model adapted to Integer Linear Programming. Extensive numerical experiments assess the relevance of taking into account the user location constraints. We also propose in 19 an online heuristic algorithm for the problem of network slice placement optimization. The solution is adapted to support placement on large scale networks and integrates Edge-specific and URLLC constraints. We rely on an approach called the Power of Two Choices to build the heuristic. The evaluation results show the good performance of the heuristic that solves the problem in few seconds under a large scale scenario. The heuristic also improves the acceptance ratio of network slice placement requests when compared against a deterministic online Integer Linear Programming (ILP) solution.

In 27, we study slicing in the context of 5G networks for allowing multiple users to share a common infrastructure. The chaining of Network Function (NFs) introduces constraints on the order in which NFs are allocated. We first model the allocation of resources for Chains of NFs in 5G Slices. Then we introduce a distributed mutual exclusion algorithm to address the problem of the allocation of resources. We show with selected metrics that choosing an order of allocation of the resources that differs from the order in which resources are used can give better performances. We then show experimental results where we improve the usage rate of resources by more than 20% compared to the baseline algorithm in some cases. The experiments run on our own simulator based on SimGrid.

Task scheduling in cloud environments

Cloud platforms usually offer several types of Virtual Machines (VMs) with different guarantees in terms of availability and volatility, provisioning the same resource through multiple pricing models. For instance, in the Amazon EC2 cloud, the user pays per use for on-demand VMs while spot VMs are instances available at lower prices. However, a spot VM can be terminated or hibernated by EC2 at any moment. In 14, we proposed the Hibernation-Aware Dynamic Scheduler (HADS) that schedules Bag-of-Tasks (BoT) applications with deadline constraints in both hibernation prone spots VMs and on-demand VMs. HADS aims at minimizing the monetary costs of executing BoT applications on Clouds ensuring that their deadlines are respected even in the presence of multiple hibernations. Results collected from experiments on Amazon EC2 VMs using synthetic applications and a NAS benchmark application show the effectiveness of HADS in terms of monetary costs when compared to on-demand VM only solutions.

Proving the safety of highly-available distributed objects

To provide high availability in distributed systems, object replicas allow concurrent updates. Although replicas eventually converge, they may diverge temporarily, for instance when the network fails. This makes it difficult for the developer to reason about the object's properties , and in particular, to prove invariants over its state. For the sub-class of state-based distributed systems, we propose a proof methodology for establishing that a given object maintains a given invariant, taking into account any concurrency control. Our approach allows reasoning about individual operations separately. We demonstrate that our rules are sound, and we illustrate their use with some representative examples. We automate the rule using Boogie, an SMT-based tool.

This work was published at the 29th European Symposium on Programming (ESOP), April 2020, Dublin, Ireland 31.

A coordination-free, convergent, and safe replicated tree

The tree is a basic data structure present in many applications. We consider the case where the tree is replicated across a distributed system, for instance in a distributed file system. To improve performance and availability, it is desirable to support concurrent updates to different replicas without coordination. Such concurrent updates converge if the effects commute. However, in a naïve implementation, concurrent moves might violate the tree invariant. To avoid this issue, previous approaches would either eschew atomic moves, require preventative cross-replica coordination, or totally order move operations after-the-fact, requiring roll-back and compensation operations.

In this work, we study a novel replicated tree data structure that supports coordination-free concurrent atomic moves, and provably maintains the tree invariant. Our analysis identifies cases where concurrent moves are inherently safe, and we devise a coordination-free, rollback-free algorithm for the remaining cases. The trade-off is that in some cases a move operation “loses” (i.e., is interpreted as skip).

We present a detailed analysis of the concurrency issues with trees, justifying our replicated tree data structure. We provide mechanized proof that the data structure is convergent and maintains the tree invariant. Finally, we compare the response time and availability of our design against the literature.

This work has been submitted for publication.

Specification of a Transactionally and Causally-Consistent (TCC) database

Large-scale application are typically built on top of geo-distributed databases running on multiple datacenters (DCs) situated around the globe. Network failures are unavoidable, but in most internet services, availability is not negotiable; in this context, the CAP theorem proves that it is impossible to provide both availability and strong consistency at the same time. Sacrificing strong consistency, exposes developers to complex anomalies that are complex to build against. AntidoteDB is a database designed for geo-replication. As it aims to provide high availability with the strongest possible consistency model, it guarantees Transactional Causal Consistency (TCC) and supports CRDTs. TCC means that: (1) if one update happens before another, they will be observed in the same order (causal consistency), and (2) updates in the same transaction are observed all-or-nothing. In AntidoteDB, the database is persisted as a journal of operations. In the current implementation, the journal grows without bound. The main objective of this work is to specify a mechanism for pruning the journal safely, by storing recent checkpoints. This will enable faster reads and crash recovery.

Work in cooperation with Annette Bieniusa (Uni Kaiserslautern), Carla Ferreira (Universidade NOVA de Lisboa) and Gustao Petri (ARM, Cambridge, UK).

An environment for composable distributed computing

Modern applications are highly distributed and data-intensive. Programming a distributed system is challenging because of asynchrony, failures and trade-offs. In addition, application requirements vary with the use-case and throughout the development cycle. Moreover, existing tools come with restricted expressiveness or limited runtime customizability. Our work aims to address this by improving reuse while maintaining fine-grain control and enhancing dependability. We argue that an environment for composable distributed computing will facilitate the process of developing distributed systems. We use high-level composable specification, verification tools and a distributed runtime.

This work was presented at the EuroSys Doctoral Workshop by Benoît Martin and Laurent Prosperi 37.

MemOpLight: Leveraging applicative feedback to improve container memory consolidation

The container mechanism supports consolidating several servers on the same machine, thus amortizing cost. To ensure performance isolation between containers, Linux relies on memory limits. However these limits are static, but application needs are dynamic; this results in poor performance. To solve this issue, MemOpLight reallocates memory to containers based on dynamic applicative feedback. MemOpLight rebalances physical memory allocation, in favor of under-performing ones, with the aim of improving overall performance. Our research explores the issues, addresses the design of MemOpLight, and validates it experimentally. Our approach increases total satisfaction by 13% compared to the default.

It is standard practice in Infrastructure as a Service to consolidate several logical servers on the same physical machine, thus amortizing cost. However, the execution of one logical server should not disturb the others: the logical servers should remain isolated from one another.

To ensure both consolidation and isolation, a recent approach is “containers,” a group of processes with sharing and isolation properties. To ensure memory performance isolation, i.e., guaranteeing to each container enough memory for it to perform well, the administrator limits the total amount of physical memory that a container may use at the expense of others. In previous work, we showed that these limits impede memory consolidation. Furthermore, the metrics available to the kernel to evaluate its policies (e.g., frequency of page faults, I/O requests, use of CPU cycles, etc.), are not directly relevant to performance as experienced from the application perspective, which is better characterized by, for instance, response time or throughput measured at application level.

To solve these problems, we propose a new approach, called the Memory Optimization Light (MemOpLight). It is based on application-level feedback from containers. Our mechanism aims to rebalance memory allocation in favor of unsatisfied containers, while not penalizing the satisfied ones. By doing so, we guarantee application satisfaction, while consolidating memory; this also improves overall resource consumption.

Our main contributions are the following:

• An experimental demonstration of the limitations of the existing Linux mechanisms.
• The design of a simple feedback mechanism from application to the kernel.
• An algorithm for adapting container memory allocation.
• And implementation in Linux and experimental confirmation.

These results published at NCA 2020 29 obtained the best paper paper award.

Leveraging High-Frequency Cores in the OS Scheduler

In modern server CPUs, individual cores can run at different frequencies, which allows for fine-grained control of the performance/energy tradeoff. Adjusting the frequency, however, incurs a high latency. We find that this can lead to a problem of frequency inversion, whereby the Linux scheduler places a newly active thread on an idle core that takes dozens to hundreds of milliseconds to reach a high frequency, just before another core already running at a high frequency becomes idle. In 28, we first illustrate the significant performance overhead of repeated frequency inversion through a case study of scheduler behavior during the compilation of the Linux kernel on an 80-core Intel R Xeon-based machine. Following this, we propose two strategies to reduce the likelihood of frequency inversion in the Linux scheduler. When benchmarked over 60 diverse applications on the Intel R Xeon, the better performing strategy, Smove, improves performance by more than 5% (at most 56% with no energy overhead) for 23 applications, and worsens performance by more than 5% (at most 8%) for only 3 applications. On a 4-core AMD Ryzen we obtain performance improvements up to 56%.

8.1.1 ANR

9.1.1 Scientific events: organisation

Marc Shapiro organised a series of seminars on the Loi de programmation pluriannuelle de la recherche (French bill organising the next 10 years of publicly-funded research) open to all scholars in Informatics. Speakers: Sebastian Stride (SIRIS Academic), Antoine Petit (head of CNRS), Patrick Lemaire (leader of the assembly of French learned societies), Christine Musselin (instituts d'Études Politiques, Paris), Pierre Ouzoulias (CNRS, senator, member of OPECST).

9.1.2 Scientific events: selection

9.1.3 Journal

9.1.4 Invited talks

• Pierre Sens, invited keynote speaker, "Fault Tolerance in Dynamic Distributed Systems", The 19th IEEE International Symposium on Network Computing and Applications (NCA 2020).
• Marc Shapiro, invited keynote speaker to Conférence francophone d'informatique en Parallélisme, Architecture et Système (Compas). Planned in Lyon, June 2020; canceled due to Covid.

9.1.5 Leadership within the scientific community

Marc Shapiro, Vice President for Research of Société informatique de France (SIF), the French learned society in Informatics.

9.1.6 Research administration

• Colette Johnen, since 2020: Member of section 27 of Conseil national des Universités.
• Pierre Sens, since 2016: Member of Section 6 of the national committee for scientific research CoNRS.
• Franck Petit, Pierre Sens, since 2012: Member of the Executive Committee of Labex SMART, Co-Chairs of Track 4, Autonomic Distributed Environments for Mobility.

9.2.1 Teaching

• Julien Sopena is Member of “Directoire des formations et de l'insertion professionnelle” of Sorbonne Université, France
• Master: Julien Sopena is responsible of Computer Science Master's degree in Distributed systems and applications (in French, SAR), Sorbonne Universités, France
• Master: Luciana Arantes, Swan Dubois, Jonathan Lejeune, Franck Petit, Pierre Sens, Julien Sopena, Advanced distributed algorithms, M2, Sorbonne Université, France
• Master: Jonathan Lejeune, Designing Large-Scale Distributed Applications, M2, Sorbonne Université, France
• Master: Maxime Lorrillere, Julien Sopena, Linux Kernel Programming, M1, Sorbonne Université, France
• Master: Luciana Arantes, Swan Dubois, Jonathan Lejeune, Pierre Sens, Julien Sopena, Operating systems kernel, M1, Sorbonne Université, France
• Master: Luciana Arantes, Swan Dubois, Franck Petit, Distributed Algorithms, M1, Sorbonne Université, France
• Master: Franck Petit, Autonomic Networks, M2, Sorbonne Université, France
• Master: Franck Petit, Distributed Algorithms for Networks, M1, Sorbonne Université, France
• Master: Jonathan Lejeune, Julien Sopena, Client-server distributed systems, M1, Sorbonne Université, France.
• Master: Luciana Arantes, Pierre Sens, Franck Petit. Cloud Computing, M1, EIT Digital Master, France.
• Master: Julien Sopena, Marc Shapiro, Ilyas Toumlilt, Francis Laniel. Kernels and virtual machines (Noyaux et machines virtuelles, NMV), M2, Sorbonne Université, France.
• Licence: Pierre Sens, Luciana Arantes, Julien Sopena, Principles of operating systems, L3, Sorbonne Université, France
• Licence: Swan Dubois, Initiation to operating systems, L3, Sorbonne Université, France
• Licence: Swan Dubois, Multi-threaded Programming, L3, Sorbonne Université, France
• Licence: Jonathan Lejeune, Oriented-Object Programming, L3, Sorbonne Université, France
• Licence: Franck Petit, Advanced C Programming, L2, Sorbonne Université, France
• Licence: Swan Dubois, Jonathan Lejeune, Julien Sopena, Introduction to operating systems, L2, Sorbonne Université, France
• Licence: Mesaac Makpangou, C Programming Language, 27 h, L2, Sorbonne Université, France
• Ingénieur 4ème année : Marc Shapiro, Introduction aux systèmes d'exploitation, 26 h, M1, Polytech Sorbonne Université, France.
• Licence : Philippe Darche (coordinator), Architecture of Internet of Things (IoT), 2 × 32h, L3, Institut Universitaire Technologique (IUT) Paris Descartes, France.
• Engineering School: Philippe Darche (coordinator), Solid-State Memories, 4th year, ESIEE, France.
• DUT: Philippe Darche (coordinator), Introduction to Computer Systems - Data representation, 60h, Institut Universitaire Technologique (IUT) Paris Descartes, France.
• DUT: Philippe Darche (coordinator), Computer Architecture, 32h, Institut Universitaire Technologique (IUT) Paris Descartes, France.
• DUT: Philippe Darche (coordinator), Computer Systems Programming, 80h, Institut Universitaire Technologique (IUT) Paris Descartes, France.

9.2.2 Supervision

• CIFRE PhD: Guillaume Fraysse, Orange Lab - Inria, “Ubiquitous Resouces for Service Availability”, Dec. 2020. Advised by Pierre Sens, Imen Grida Ben Yahia (Orange-Lab) , Jonathan Lejeune, Julien Sopena.
• PhD : Francis Laniel, “Vers une utilisation efficace de la mémoire non volatile pour économiser l'énergie.”Sorbonne Univ., Dec. . 2020. Advised by Marc Shapiro, Julien Sopena, Jonathan Lejeune.
• CIFRE PhD in progress: José Alves Esteves, “Adaptation dynamique en environnements répartis contraints”, Sorbonne Univ., since Sep. 2019. Advised by Pierre Sens and Amina Boubendir Orange Labs.
• PhD in progress: Arnaud Favier, “Algorithmes de coordination répartis dans des réseaux dynamiques”, Sorbonne Univ., since Sep. 2018. Advised by Pierre Sens and Luciana Arantes.
• PhD in progress: Célia Mahamdi, “Prise de décision collaborative dans un système distribué et dynamique”, Sorbonne Univ., since Sep. 2020. Advised by Mesaac Makpongou and Jonathan Lejeune.
• PhD in progress: Saalik Hatia, “Efficient management of memory and storage for CRDTs”, Sorbonne Univ., since Oct. 2018. Advised by Marc Shapiro.
• PhD in progress: Gabriel Le Bouder, “Autonomic synchronization”, Sorbonne Univ., since Sep. 2019. Advised by Franck Petit.
• PhD in progress: Benoît Martin, “Protocol de cohérence hybride: de la cohérence causal à la cohérence forte”, Sorbonne Univ., since Sep. 2019. Advised by Mesaac Makpangou and Marc Shapiro.
• PhD in progress: Sreeja Nair, “Just-Right Consistency for massive gee-replicated storage”, Sorbonne Univ., since Apr. 2018. Advised by Marc Shapiro.
• PhD in progress: Laurent Prosperi, “Abstractions, langage et runtime pour les systèmes distribués”, Sorbonne Univ., since Sep. 2019. Advised by Marc Shapiro.
• CIFRE PhD in progress: Jonathan Sid-Otmane. “Étude des critères de distribution et de l'usage d'une base de données distribuée pour un OS Telco”, since Dec. 2017. Advised by Marc Shapiro, with Sofiane Imadali and Frédéric Martelli, Orange Labs.
• PhD in progress: Ilyas Toumlilt, “Bridging the CAP gap, all the way to the edge”, Sorbonne Univ., since Sep. 2016. Advised by Marc Shapiro.
• CIFRE PhD in progress: Dimitrios Vasilas, “Indexing in large-scale storage systems”, Sorbonne Univ., since Sep. 2016. Advised by Marc Shapiro, with Brad King, Scality.
• PhD in progress: Daniel Wladdimiro, “Adaptation dynamique en environnements répartis contraints”, Sorbonne Univ., since Sep. 2019. Advised by Pierre Sens and Luciana Arantes.
• PhD in progress: Daniel Wilhelm, “Algorithmes de diffusion causale dans les systèmes répartis dynamique”, Sorbonne Univ., since Oct. 2019, Pierre Sens and Luciana Arantes.

9.2.3 Juries

Pierre Sens was the reviewer of:

• Anne-Cécile Orgerie, HDR, IRISA, Univ. Rennes
• Mohand Mezmaz, HDR, CRISTAL, Univ. Lille
• Nikos Parlavantzas, HDR, Inria, Sorbonne Univ.
• Maha Alsayasneh, PhD, LIG, Univ. Grenoble
• Mathieu Bacou, PhD, IRIT, Toulouse

Pierre Sens was Chair of

• Yifan Du, PhD, Inria Paris, Sorbonne Univ.
• Giovania Farina, PhD, LIP6, Sorbonne Univ.
• Francis Laniel, PhD, LIP6, Sorbonne Univ.
• Andrea Petreto, PhD, LIP6, Sorbonne Univ.

Colette Johnen was the reviewer of

• Marie Laveau, PhD, Paris Saclay.

International journals

• 9 articleSébastienS. Bouchard, YoannY. Dieudonné, AndrzejA. Pelc and FranckF. Petit. Deterministic Treasure Hunt in the Plane with Angular HintsAlgorithmica8211November 2020, 3250-3281
  HALDOIback to text
• 10 articleArnaudA. Casteigts, SwanS. Dubois, FranckF. Petit and JohnJ. Robson. Robustness: A new form of heredity motivated by dynamic networksTheoretical Computer Science806February 2020, 429-445
  HALDOIback to text
• 11 articleKerenK. Censor-Hillel and MikaëlM. Rabie. Distributed Reconfiguration of Maximal Independent SetsJournal of Computer and System Sciences112September 2020, 85-96
  HALDOI
• 12 articleTalesT. Heimfarth, João CarlosJ. Giacomin, EdisonE. Pignaton De Freitas, Gustavo FigueiredoG. Araujo and João PauloJ. de Araujo. PAX-MAC: A Low Latency Anycast Protocol with Advanced Preamble †Sensors201January 2020, 23 - 25
  HALDOI
• 13 articlePascalP. Raymond, StéphaneS. Devismes, AnissaA. Lamani, FranckF. Petit and SébastienS. Tixeuil. Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious RobotsThe Computer Journal641January 2021, 132-154
  HALDOIback to text
• 14 article LuanL. Teylo, LucianaL. Arantes, PierreP. Sens and Lucia M AL. Drummond. A dynamic task scheduler tolerant to multiple hibernations in cloud environments Cluster Computing September 2020
  HAL DOI back to text

National journals

• 15 article PhilippeP. Darche. Evolution of solid-state random access memories - version 2 Techniques de l'Ingenieur June 2020
  HAL

International peer-reviewed conferences

• 16 inproceedings KarineK. Altisen, StéphaneS. Devismes, AnaïsA. Durand, ColetteC. Johnen and FranckF. Petit. Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics PODC 2020 - ACM Symposium on Principles of Distributed Computing 227-229 Salerne / Virtual, Italy August 2020
  HAL DOI back to text
• 17 inproceedingsKarineK. Altisen, StéphaneS. Devismes, AnaïsA. Durand, ColetteC. Johnen and FranckF. Petit. Self-stabilizing Systems in Spite of High Dynamics22nd International Conference on Distributed Computing and Networking, ICDCN'21ICDCN '21: International Conference on Distributed Computing and Networking 2021Nara, JapanLaBRI, CNRS UMR 5800http://www.icdcn2021.netJanuary 2021, 156–165
  HALDOIback to text
• 18 inproceedings José JurandirJ. Alves Esteves, AminaA. Boubendir, FabiceF. Guillemin and PierreP. Sens. Edge-enabled Optimized Network Slicing in Large Scale Networks NoF 2020 - 11th International Conference on Network of the Future Bordeaux / Virtual, France October 2020
  HAL
• 19 inproceedings Jose JurandirJ. Alves Esteves, AminaA. Boubendir, FabiceF. Guillemin and PierreP. Sens. Heuristic for Edge-enabled Network Slicing Optimization using the "Power of Two Choices" CNSM 2020 - 16th International Conference on Network and Service Management Izmir / Virtual, Turkey November 2020
  HAL back to text
• 20 inproceedingsJosé JurandirJ. Alves Esteves, AminaA. Boubendir, FabiceF. Guillemin and PierreP. Sens. Location-based Data Model for Optimized Network Slice PlacementNetSoft 2020 - 6th IEEE International Conference on Network SoftwarizationGhent / Virtual, BelgiumJune 2020, 404-412
  HALDOIback to text
• 21 inproceedingsJose JurandirJ. Alves Esteves, AminaA. Boubendir, FabiceF. Guillemin and PierreP. Sens. Optimized Network Slicing Proof-of-Concept with Interactive Gaming Use CaseICIN 2020 - 23rd Conference on Innovation in Clouds, Internet and Networks and WorkshopsParis, FranceFebruary 2020, 150-152
  HALDOIback to text
• 22 inproceedingsLéliaL. Blin, SwanS. Dubois and LaurentL. Feuilloley. Silent MST Approximation for Tiny MemorySSS 2020 : The 22th International Symposium on Stabilization, Safety, and Security of Distributed Systems12514Lecture Notes in Computer ScienceAustin, TX / Virtual, United StatesNovember 2020, 118-132
  HALDOIback to text
• 23 inproceedingsSébastienS. Bouchard, YoannY. Dieudonné, AndrzejA. Pelc and FranckF. Petit. Almost Universal Anonymous Rendezvous in the PlaneSPAA '20: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and ArchitecturesSPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and ArchitecturesVirtual Event, United StatesJuly 2020, 117-127
  HALDOIback to text
• 24 inproceedingsSébastienS. Bouchard, YoannY. Dieudonné and AndrzejA. Pelc. Want to Gather? No Need to Chatter!PODC '20 - 39th Symposium on Principles of Distributed ComputingSalerno / Virtual, ItalyJuly 2020, 253-262
  HALDOIback to text
• 25 inproceedingsLeonardoL. Corrêa, LucianaL. Arantes, PierreP. Sens, MarioM. Inostroza-Ponta and MárcioM. Dorn. A dynamic evolutionary multi-agent system to predict the 3D structure of proteinsWCCI 2020 - IEEE World Congress on Evolutionary Computation - CEC SessionsGlasgow / Virtual, United KingdomJuly 2020, 1-8
  HALDOI
• 26 inproceedingsArnaudA. Favier, NicolasN. Guittonneau, LucianaL. Arantes, AnneA. Fladenmuller, JonathanJ. Lejeune and PierreP. Sens. Topology Aware Leader Election Algorithm for Dynamic NetworksPRDC 2020 - 25th IEEE Pacific Rim International Symposium on Dependable Computing2020 IEEE 25th Pacific Rim International Symposium on Dependable Computing (PRDC)Perth, Australiahttps://prdc.dependability.org/PRDC2020/January 2021, 1-10
  HALDOIback to text
• 27 inproceedingsGuillaumeG. Fraysse, JonathanJ. Lejeune, JulienJ. Sopena and PierreP. Sens. A resource usage efficient distributed allocation algorithm for 5G Service Function ChainsDAIS 2020 - 20th IFIP WG 6.1 International Conference Distributed Applications and Interoperable Systems12135Lecture Notes in Computer ScienceValetta, MaltaJune 2020, 169-185
  HALDOIback to text
• 28 inproceedings RedhaR. Gouicem, DamienD. Carver, Jean-PierreJ.-P. Lozi, JulienJ. Sopena, BaptisteB. Lepers, WillyW. Zwaenepoel, NicolasN. Palix, JuliaJ. Lawall and GillesG. Muller. Fewer Cores, More Hertz: Leveraging High-Frequency Cores in the OS Scheduler for Improved Application Performance 2020 USENIX Annual Technical Conference Boston / Virtual, United States https://www.usenix.org/conference/atc20/technical-sessions July 2020
  HAL back to text
• 29 inproceedingsBest paperFrancisF. Laniel, DamienD. Carver, JulienJ. Sopena, FranckF. Wajsburt, JonathanJ. Lejeune and MarcM. Shapiro. MemOpLight: Leveraging application feedback to improve container memory consolidationNCA 2020 - 19th IEEE International Symposium on Network Computing and ApplicationsCambridge / Virtual, United StatesNovember 2020, 1-10
  HALDOIback to textback to text
• 30 inproceedings BaptisteB. Lepers, RedhaR. Gouicem, DamienD. Carver, Jean-PierreJ.-P. Lozi, NicolasN. Palix, Maria-VirginiaM.-V. Aponte, WillyW. Zwaenepoel, JulienJ. Sopena, JuliaJ. Lawall and GillesG. Muller. Provable Multicore Schedulers with Ipanema: Application to Work Conservation Eurosys 2020 - European Conference on Computer Systems Heraklion / Virtual, Greece April 2020
  HAL DOI
• 31 inproceedings Sreeja SS. Nair, GustavoG. Petri and MarcM. Shapiro. Proving the safety of highly-available distributed objects ESOP 2020 - 29th European Symposium on Programming Dublin, Ireland April 2020
  HAL back to text
• 32 inproceedingsJonathanJ. Sid-Otmane, SofianeS. Imadali, FredericF. Martelli and MarcM. Shapiro. Data Consistency in the 5G SpecificationICIN 2020 - 23rd Conference on Innovation in Clouds, Internet and Networks and WorkshopsParis, FranceFebruary 2020, 110-117
  HALDOI
• 33 inproceedingsVincentV. Vallade, LudovicL. Le Frioux, SouheibS. Baarir, JulienJ. Sopena, VijayV. Ganesh and FabriceF. Kordon. Community and LBD-Based Clause Sharing Policy for Parallel SAT SolvingSAT 2020 - 23rd International Conference on Theory and Applications of Satisfiability Testing12178Lecture Notes in Computer ScienceAlghero / Virtual, ItalyJune 2020, 11-27
  HALDOI
• 34 inproceedings VincentV. Vallade, LudovicL. Le Frioux, SouheibS. Baarir, JulienJ. Sopena and FabriceF. Kordon. On the Usefulness of Clause Strengthening in Parallel SAT Solving NFM 2020 - 12th NASA Formal Methods Symposium Moffett Field / Virtual, United States May 2020
  HAL

National peer-reviewed Conferences

• 35 inproceedings KarineK. Altisen, StéphaneS. Devismes, AnaïsA. Durand, ColetteC. Johnen and FranckF. Petit. Élection Autostabilisante dans les Réseaux à Haute Dynamicité ALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications Lyon, France September 2020
  HAL
• 36 inproceedings GewuG. Bu, MariaM. Potop-Butucaru and MikaëlM. Rabie. Diffusion dans les réseaux sans fil en utilisant des filtres à mémoire constante ALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications Lyon, France September 2020
  HAL

Conferences without proceedings

• 37 inproceedings BenoîtB. Martin, LaurentL. Prosperi and MarcM. Shapiro. An environment for composable distributed computing EuroDW 2020 - 14th EuroSys Doctoral Workshop Heraklion / Virtual, Greece April 2020
  HAL back to text
• 38 inproceedings DimitriosD. Vasilas, MarcM. Shapiro, BradleyB. King and Sara S.S. Hamouda. Towards application-specific query processing systems BDA 2020 - 36ème Conférence sur la Gestion de Données – Principes, Technologies et Applications Paris / Virtual, France October 2020
  HAL

Scientific books

• 39 book PhilippeP. Darche. Microprocessor 1: Prolegomenes - Calculation and Storage Functions - Models of Computation and Computer Architecture November 2020
  HAL
• 40 book PhilippeP. Darche. Microprocessor 2. Core Concepts: Communication in a Digital System December 2020
  HAL
• 41 book PhilippeP. Darche. Microprocessor 3. Core Concepts: Hardware Aspects December 2020
  HAL
• 42 book PhilippeP. Darche. Microprocessor 4. Core Concepts: Software Aspects February 2021
  HAL
• 43 book PhilippeP. Darche. Microprocessor 5. Software and Hardware Aspects of Development, Debugging and Testing – The Microcomputer February 2021
  HAL

Doctoral dissertations and habilitation theses

• 44 thesis GuillaumeG. Fraysse. Distributed resource allocation for virtual networks Sorbonne Université, CNRS, LIP6, Paris, France December 2020
  HAL
• 45 thesis FrancisF. Laniel. MemOpLight: toward memory consolidation for containers thanks to application feedbackm Ecole Doctorale Informatique, Télécommunications et Electronique November 2020
  HAL

Reports & preprints

• 46 report AhmedA. Amamou, MartinM. Camey, ChristopheC. Cérin, JonathanJ. Rivalan and JulienJ. Sopena. Resources management for controlling dynamic loads in clouds environments. The Wolphin project experience Université Sorbonne Paris Nord; Sorbonne Université February 2020
  HAL
• 47 report SébastienS. Bouchard, YoannY. Dieudonné, AndrzejA. Pelc and FranckF. Petit. Almost Universal Anonymous Rendezvous in the Plane Université de Picardie Jules Verne December 2020
  HAL
• 48 report SébastienS. Bouchard, YoannY. Dieudonné and AndrzejA. Pelc. Want to Gather? No Need to Chatter! Université de Picardie Jules Verne December 2020
  HAL
• 49 report GewuG. Bu, ZviZ. Lotker, MariaM. Potop-Butucaru and MikaelM. Rabie. Lower and upper bounds for deterministic convergecast with labeling schemes Sorbonne Université May 2020
  HAL DOI
• 50 misc GewuG. Bu, MariaM. Potop-Butucaru and MikaelM. Rabie. Wireless Broadcast with short labelling January 2020
  HAL
• 51 report SaalikS. Hatia and MarcM. Shapiro. Specification of a Transactionally and Causally-Consistent (TCC) database DELYS; LIP6, Sorbonne Université, Inria, Paris, France July 2020
  HAL
• 52 report ColetteC. Johnen and MohammedM. Haddad. Efficient self-stabilizing construction of disjoint MDSs in distance-2 model Inria Paris, Sorbonne Université; LaBRI, CNRS UMR 5800; LIRIS UMR CNRS 5205 February 2021
  HAL
• 53 report Sreeja SS. Nair, FilipeF. Meirim, MárioM. Pereira, CarlaC. Ferreira and MarcM. Shapiro. A coordination-free, convergent, and safe replicated tree LIP6, Sorbonne Université, Inria, Paris, France; Universidade nova de Lisboa February 2021
  HAL
• 54 report Sreeja SS. Nair, GustavoG. Petri and MarcM. Shapiro. Proving the safety of highly-available distributed objects (Extended version) LIP6, Sorbonne Université, Inria, Paris, France; Arm Research, Cambridge, UK February 2020
  HAL
• 55 report DanielD. Wilhelm, LucianaL. Arantes and PierreP. Sens. A scalable causal broadcast that tolerates dynamics of mobile networks Sorbonne University , UPMC May 2020
  HAL