2 citations · 3 across the 7 of their papers we have counts for
10 papers
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…