46 citations · 52 across the 17 of their papers we have counts for
17 papers
STaKTAU: profiling HPC applications' operating system usage
Camille Coti, Kevin Huck, Allen D. Malony
This paper presents a approach for measuring the time spent by HPC applications in the operating system's kernel. We use the SystemTap interface to insert timers before and after s…
SKaMPI-OpenSHMEM: Measuring OpenSHMEM Communication Routines
Camille Coti, Allen D. Malony
Benchmarking is an important challenge in HPC, in particular, to be able to tune the basic blocks of the software environment used by applications. The communication library and di…
Measuring OpenSHMEM Communication Routines with SKaMPI-OpenSHMEM User's manual
Camille Coti, Allen D Malony
This document presents the OpenSHMEM extension for the Special Karlsruhe MPI benchmark and the measurement algorithms used to measure the routines.
A task-based approach to parallel parametric linear programming solving, and application to polyhedral computations
Camille Coti, David Monniaux, Hang Yu
Parametric linear programming is a central operation for polyhedral computations, as well as in certain control applications.Here we propose a task-based scheme for parallelizing i…
On-the-fly Optimization of Parallel Computation of Symbolic Symplectic Invariants
Joseph Ben Geloun, Camille Coti, Allen D. Malony
Group invariants are used in high energy physics to define quantum field theory interactions. In this paper, we are presenting the parallel algebraic computation of special invaria…
Parallel parametric linear programming solving, and application to polyhedral computations
Camille Coti, David Monniaux, Hang Yu
Parametric linear programming is central in polyhedral computations and in certain control applications.We propose a task-based scheme for parallelizing it, with quasi-linear speed…
Quasi-Optimal Partial Order Reduction
Huyen T. T Nguyen, César Rodríguez, Marcelo Sousa +2
A dynamic partial order reduction (DPOR) algorithm is optimal when it always explores at most one representative per Mazurkiewicz trace. Existing literature suggests that the reduc…
Parametric, Probabilistic, Timed Resource Discovery System
Camille Coti
This paper presents a fully distributed resource discovery and reservation system. Verification of such a system is important to ensure the execution of distributed applications on…
Parallel Galton Watson Process
Olivier Bodini, Camille Coti, Julien David
In this paper, we study a parallel version of Galton-Watson processes for the random generation of tree-shaped structures. Random trees are useful in many situations (testing, bina…
Fault Tolerant QR Factorization for General Matrices
Camille Coti
This paper presents a fault-tolerant algorithm for the QR factorization of general matrices. It relies on the communication-avoiding algorithm, and uses the structure of the reduct…
Formally Proving and Enhancing a Self-Stabilising Distributed Algorithm
Camille Coti, Charles Lakos, Laure Petrucci
This paper presents the benefits of formal modelling and verification techniques for self-stabilising distributed algorithms. An algorithm is studied, that takes a set of processes…
Exploiting Redundant Computation in Communication-Avoiding Algorithms for Algorithm-Based Fault Tolerance
Camille Coti
Communication-avoiding algorithms allow redundant computations to minimize the number of inter-process communications. In this paper, we propose to exploit this redundancy for faul…
Time Petri Net Models for a New Queuless and Uncentralized Resource Discovery System
Camille Coti, Sami Evangelista, Kais Klai
In this report, we detail the model using Petri Nets of a new fully distributed resource reservation system. The basic idea of the considered distributed system is to let a user re…
OS-level Failure Injection with SystemTap
Camille Coti, Nicolas Greneche
Failure injection in distributed systems has been an important issue to experiment with robust, resilient distributed systems. In order to reproduce real-life conditions, parts of…
POSH: Paris OpenSHMEM: A High-Performance OpenSHMEM Implementation for Shared Memory Systems
Camille Coti
In this paper we present the design and implementation of POSH, an Open-Source implementation of the OpenSHMEM standard. We present a model for its communications, and prove some p…
A Model for Coherent Distributed Memory For Race Condition Detection
Franck Butelle, Camille Coti
We present a new model for distributed shared memory systems, based on remote data accesses. Such features are offered by network interface cards that allow one-sided operations, r…
QR Factorization of Tall and Skinny Matrices in a Grid Computing Environment
Emmanuel Agullo, Camille Coti, Jack Dongarra +2
Previous studies have reported that common dense linear algebra operations do not achieve speed up by using multiple geographical sites of a computational grid. Because such operat…