Devan Sohier
YOU?
Author Swipe
View article: Error Analysis of Sum-Product Algorithms under Stochastic Rounding
Error Analysis of Sum-Product Algorithms under Stochastic Rounding Open
The quality of numerical computations can be measured through their forward error, for which finding good error bounds is challenging in general. For several algorithms and using stochastic rounding (SR), probabilistic analysis has been sh…
View article: Stochastic Rounding Variance and Probabilistic Bounds: A New Approach
Stochastic Rounding Variance and Probabilistic Bounds: A New Approach Open
International audience
View article: Bounds on non-linear errors for variance computation with stochastic rounding
Bounds on non-linear errors for variance computation with stochastic rounding Open
The main objective of this work is to investigate non-linear errors and pairwise summation using stochastic rounding (SR) in variance computation algorithms. We estimate the forward error of computations under SR through two methods: the f…
View article: The Positive Effects of Stochastic Rounding in Numerical Algorithms
The Positive Effects of Stochastic Rounding in Numerical Algorithms Open
International audience
View article: Stochastic rounding variance and probabilistic bounds: A new approach
Stochastic rounding variance and probabilistic bounds: A new approach Open
Stochastic rounding (SR) offers an alternative to the deterministic IEEE-754 floating-point rounding modes. In some applications such as PDEs, ODEs and neural networks, SR empirically improves the numerical behavior and convergence to accu…
View article: High-Quality Fault Resiliency in Fat Trees
High-Quality Fault Resiliency in Fat Trees Open
Coupling regular topologies with optimised routing algorithms is key in\npushing the performance of interconnection networks of supercomputers.In this\npaper we present Dmodc, a fast deterministic routing algorithm for Parallel\nGeneralise…
View article: High-Quality Fault-Resiliency in Fat-Tree Networks (Extended Abstract)
High-Quality Fault-Resiliency in Fat-Tree Networks (Extended Abstract) Open
Coupling regular topologies with optimized routing algorithms is key in\npushing the performance of interconnection networks of HPC systems. In this\npaper we present Dmodc, a fast deterministic routing algorithm for Parallel\nGeneralized …
View article: Space-Optimal Naming in Population Protocols
Space-Optimal Naming in Population Protocols Open
The distributed naming problem, assigning unique names to the nodes in a distributed system, is a fundamental task. This problem is nontrivial, especially when the amount of memory available for the task is low, and when requirements for f…
View article: A self-stabilizing algorithm for maximal matching in link-register model in $O(nΔ^3)$ moves
A self-stabilizing algorithm for maximal matching in link-register model in $O(nΔ^3)$ moves Open
In the matching problem, each node maintains a pointer to one of its neighbor or to $null$, and a maximal matching is computed when each node points either to a neighbor that itself points to it (they are then called married), or to $null$…
View article: Time and Space Optimal Counting in Population Protocols
Time and Space Optimal Counting in Population Protocols Open
This work concerns the general issue of combined optimality in terms of time and space complexity. In this context, we study the problem of (exact) counting resource-limited and passively mobile nodes in the model of population protocols, …
View article: Self-Stabilizing Maximal Matching and Anonymous Networks
Self-Stabilizing Maximal Matching and Anonymous Networks Open
We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is $O(n^3)$ moves with high probability, under the adversarial distributed daemon. In this algorithm, each node can determine …