Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Coti, Camille"'
Machine Learning approaches like clustering methods deal with massive datasets that present an increasing challenge. We devise parallel algorithms to compute the Multi-Slice Clustering (MSC) for 3rd-order tensors. The MSC method is based on spectral
Externí odkaz:
http://arxiv.org/abs/2309.17383
Autor:
Morel, Elian, Coti, Camille
Performance portability is a major concern on current architectures. One way to achieve it is by using autotuning. In this paper, we are presenting how we exten ded a just-in-time compilation infrastructure to introduce autotuning capabiliti es trigg
Externí odkaz:
http://arxiv.org/abs/2309.06414
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 system calls, and take advantage of its stability to design a tool that
Externí odkaz:
http://arxiv.org/abs/2304.11205
Autor:
Coti, Camille, Malony, Allen D.
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 distributed run-time environment are among the most critical ones. In pa
Externí odkaz:
http://arxiv.org/abs/2202.08948
Autor:
Coti, Camille, Malony, Allen D
This document presents the OpenSHMEM extension for the Special Karlsruhe MPI benchmark and the measurement algorithms used to measure the routines.
Comment: This paper is a technical report that comes with our benchmarking software. It implement
Comment: This paper is a technical report that comes with our benchmarking software. It implement
Externí odkaz:
http://arxiv.org/abs/2105.13395
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 it, with quasi-linear speedup over large problems.This type of parallel
Externí odkaz:
http://arxiv.org/abs/2009.14435
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 invariants called symplectic and even focusing on one particular invariant th
Externí odkaz:
http://arxiv.org/abs/2003.01081
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 speedup over large problems.
Externí odkaz:
http://arxiv.org/abs/1904.06079
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 reduction obtained by the non-optimal, state-of-the-art Source-DPOR (SDPOR)
Externí odkaz:
http://arxiv.org/abs/1802.03950
Autor:
Coti, Camille
Publikováno v:
EPTCS 220, 2016, pp. 53-62
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 a set of resources in appropriate conditions. A semi-formal model for
Externí odkaz:
http://arxiv.org/abs/1608.00656