1 citations · 2 across the 17 of their papers we have counts for
15 papers · 1 filter
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…
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…