1 citations · 2 across the 8 of their papers we have counts for
9 papers
Unexpected Scaling in Path Copying Trees
Ilya Kokorin, Alexander Fedorov, Trevor Brown +1
Although a wide variety of handcrafted concurrent data structures have been proposed, there is considerable interest in universal approaches (henceforth called Universal Constructi…
Peformance Prediction for Coarse-Grained Locking: MCS Case
Vitaly Aksenov, Daniil Bolotov, Petr Kuznetsov
A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is alternation of parallelizable sections that incur no data conflict…
Parallel Batched Interpolation Search Tree
Vitaly Aksenov, Ilya Kokorin, Alena Martsenyuk
Ordered set (and map) is one of the most used data type. In addition to standard set operations, like insert, delete and contains, it can provide set-set operations such as union,…
Overview of Bachelors Theses 2021
Vitaly Aksenov
In this work, we review Bachelors Theses done under the supervision of Vitaly Aksenov at ITMO University. This overview contains the short description of six theses: "Development o…
Execution of NVRAM Programs with Persistent Stack
Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler +2
Non-Volatile Random Access Memory (NVRAM) is a novel type of hardware that combines the benefits of traditional persistent memory (persistency of data over hardware failures) and D…
The Splay-List: A Distribution-Adaptive Concurrent Skip-List
Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova +1
The design and implementation of efficient concurrent data structures have seen significant attention. However, most of this work has focused on concurrent data structures providin…