2 citations · 5 across the 23 of their papers we have counts for
25 papers
Concurrent Splay-Based Tree
Vitaly Aksenov, Rene van Bevern, Artem Shilkin
Most work on efficient concurrent ordered indices, such as concurrent binary search trees, B-trees, skip lists, etc., has focused on data structures that provide good \emph{worst-c…
Semantic Lock: Synchronization Based on the Analysis of the Operation Conflict Graph
Denis Korotchenko, Vitaly Aksenov
This paper presents a new lock, SemanticLock, based on the conflict graph between operations. We can consider it a generalization of a read-write lock where conflicts exist between…
Compression is all you need: Modeling Mathematics
Vitaly Aksenov, Eve Bodnia, Michael H. Freedman +1
Human mathematics (HM), the mathematics humans discover and value, is a vanishingly small subset of formal mathematics (FM), the totality of all valid deductions. We argue that HM…
Semantic Conflict Model for Collaborative Data Structures
Georgii Semenov, Vitaly Aksenov
Digital collaboration systems support asynchronous work over replicated data, where conflicts arise when concurrent operations cannot be unambiguously integrated into a shared hist…
Model-based Testing of Practical Distributed Systems in Actor Model
Ilya Kokorin, Evgeny Chernatskiy, Vitaly Aksenov
Designing and implementing distributed systems correctly can be quite challenging. Although these systems are often accompanied by formal specifications that are verified using mod…
Basic Lock Algorithms in Lightweight Thread Environments
Taras Skazhenik, Nikolai Korobenikov, Andrei Churbanov +2
Traditionally, multithreaded data structures have been designed for access by the threads of Operating Systems (OS). However, implementations for access by programmable alternative…
Skip Hash: A Fast Ordered Map Via Software Transactional Memory
Matthew Rodriguez, Vitaly Aksenov, Michael Spear
Scalable ordered maps must ensure that range queries, which operate over many consecutive keys, provide intuitive semantics (e.g., linearizability) without degrading the performanc…
Derivative-based regularization for regression
Enrico Lopedoto, Maksim Shekhunov, Vitaly Aksenov +2
In this work, we introduce a novel approach to regularization in multivariable regression problems. Our regularizer, called DLoss, penalises differences between the model's derivat…
Trigram-Based Persistent IDE Indices with Quick Startup
Zakhar Iakovlev, Alexey Chulkov, Nikita Golikov +4
One common way to speed up the find operation within a set of text files involves a trigram index. This structure is merely a map from a trigram (sequence consisting of three chara…
Efficient Self-Adjusting Search Trees via Lazy Updates
Alexander Slastin, Dan Alistarh, Vitaly Aksenov
Self-adjusting data structures are a classic approach to adapting the complexity of operations to the data access distribution. While several self-adjusting variants are known for…
Wait-free Trees with Asymptotically-Efficient Range Queries
Ilya Kokorin, Dan Alistarh, Vitaly Aksenov
Tree data structures, such as red-black trees, quad trees, treaps, or tries, are fundamental tools in computer science. A classical problem in concurrency is to obtain expressive,…
Parallel-batched Interpolation Search Tree
Ilya Kokorin, Vitaly Aksenov, Alena Martsenyuk
A sorted set (or map) is one of the most used data types in computer science. In addition to standard set operations, like Insert, Remove, and Contains, it can provide set-set oper…
Benchmark Framework with Skewed Workloads
Vitaly Aksenov, Dmitry Ivanov, Ravil Galiev
In this work, we present a new benchmarking suite with new real-life inspired skewed workloads to test the performance of concurrent index data structures. We started this project…
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…
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…
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…
Relaxed Scheduling for Scalable Belief Propagation
Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen
The ability to leverage large-scale hardware parallelism has been one of the key enablers of the accelerated recent progress in machine learning. Consequently, there has been consi…
Performance Prediction for Coarse-Grained Locking
Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov
A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is an alternation of parallelizable sections that incur no data confl…
Parallel Combining: Benefits of Explicit Synchronization
Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto
Parallel batched data structures are designed to process synchronized batches of operations in a parallel computing model. In this paper, we propose parallel combining, a technique…
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…