2 citations · 5 across the 23 of their papers we have counts for
5 papers · 1 filter
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…
Memory Bounds for Concurrent Bounded Queues
Vitaly Aksenov, Nikita Koval, Petr Kuznetsov +1
Concurrent data structures often require additional memory for handling synchronization issues in addition to memory for storing elements. Depending on the amount of this additiona…