Prototypage rapide d'un supercalculateur dédié à la radioastronomie
National audience
Demande Session Spéciale Joliot-Curie 2021
Stand up indulgent gathering
We consider a swarm of mobile robots evolving in a bidimensional Euclidean space. We study a variant of the crash-tolerant gathering problem: if no robot crashes, robots have to meet at the same arbitrary location, not known beforehand, in finite time; if one or several robots crash at the same location, the remaining correct robots gather at the c...
Autovesk: Automatic vectorization of unstructured static kernels by graph transformations
Leveraging the SIMD capability of modern CPU architectures is mandatory to take full benefit of their increasing performance. To exploit this feature, binary executables must be explicitly vectorized by the developers or an automatic vectorization tool. This why the compilation research community has created several strategies to transform a scalar...
Frequency Estimation of Evolving Data Under Local Differential Privacy
Collecting and analyzing evolving longitudinal data has become a common practice. One possible approach to protect the users' privacy in this context is to use local differential privacy (LDP) protocols, which ensure the privacy protection of all users even in the case of a breach or data misuse. Existing LDP data collection protocols such as Googl...
Towards Modeling the Power Usage Efficiency of Software-Defined Computing Infrastructures
Energy is one of the biggest expenses for a data center, most of which is attributed to the cooling system, as well as the many underlying parts, such as network equipment and the large number of machines used.These infrastructures are very energy-intensive, and their number is constantly increasing around the world, especially due to the growing p...
A Modular Approach to Construct Signature-Free BRB Algorithms under a Message Adversary
This paper explores how reliable broadcast can be implemented without signatures when facing a dual adversary that can both corrupt processes and remove messages. More precisely, we consider an asynchronous n-process message-passing system in which up to t processes are Byzantine and where, at the network level, for each message broadcast by a corr...
IRIS: Online Reconfiguration of Distributed NoSQL Databases for Dynamic Workloads
Reconfiguring NoSQL databases in the face of changing workload patterns is crucial for maximizing database throughput. However, this is challenging because of the large configuration parameter search space with complex interdependencies among parameters. While stateof-the-art systems can automatically identify close-tooptimal configurations for sta...
FLeet: Online Federated Learning via Staleness Awareness and Performance Prediction
Federated learning (FL) is very appealing for its privacy benefits: essentially, a global model is trained with updates computed on mobile devices while keeping the data of users local. Standard FL infrastructures are however designed to have no energy or performance impact on mobile devices, and are therefore not suitable for applications that req...
Improving automatic GO annotation with semantic similarity
Abstract Background Automatic functional annotation of proteins is an open research problem in bioinformatics. The growing number of protein entries in public databases, for example in UniProtKB, poses challenges in manual functional annotation. Manual annotation requires expert human curators to search and read related research articles, interpret...
