75 citations · 89 across the 12 of their papers we have counts for
4 papers · 1 filter
Progress-Space Tradeoffs in Single-Writer Memory Implementations
Damien Imbs, Petr Kuznetsov, Thibault Rieutord
Most algorithms designed for shared-memory distributed systems assume the single-writer multi-reader (SWMR) setting where each process is provided with a unique register readable b…
Flat Parallelization
Vitaly Aksenov, Petr Kuznetsov
There are two intertwined factors that affect performance of concurrent data structures: the ability of processes to access the data in parallel and the cost of synchronization. It…
Agreement Functions for Distributed Computing Models
Petr Kuznetsov, Thibault Rieutord
The paper proposes a surprisingly simple characterization of a large class of models of distributed computing, via an agreement function: for each set of processes, the function de…
A Concurrency-Optimal Binary Search Tree
Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov +2
The paper presents the first \emph{concurrency-optimal} implementation of a binary search tree (BST). The implementation, based on a standard sequential implementation of an intern…