Person
Tudor Alexandru David
This person is no longer with EPFL
Related publications (11)
Log-Free Concurrent Data Structures
Rachid Guerraoui, Aleksandar Dragojevic, Mihail Igor Zablotchi, Tudor Alexandru David
Non-volatile RAM (NVRAM) makes it possible for data structures to tolerate transient failures, assuming however that programmers have designed these structures such that their consistency is preserved upon recovery. Previous ap- proaches are typically tran ...
USENIX Association2018Log-Free Concurrent Data Structures
Rachid Guerraoui, Aleksandar Dragojevic, Mihail Igor Zablotchi, Tudor Alexandru David
Non-volatile RAM (NVRAM) makes it possible for data structures to tolerate transient failures, assuming however that programmers have designed these structures such that their consistency is preserved upon recovery. Previous approaches are typically transa ...
USENIX ASSOC2018Locking Timestamps versus Locking Objects
Rachid Guerraoui, Junxiong Wang, Tudor Alexandru David
We present multiversion timestamp locking (MVTL), a new genre of multiversion concurrency control algorithms for serializable transactions. The key idea behind MVTL is simple: lock individual timestamps instead of locking objects. After presenting a generi ...
ASSOC COMPUTING MACHINERY2018Universally Scalable Concurrent Data Structures
The increase in the number of cores in processors has been an important trend over the past decade. In order to be able to efficiently use such architectures, modern software must be scalable: performance should increase proportionally to the number of all ...
EPFL2017Locking Timestamps Versus Locking Objects
Rachid Guerraoui, Tudor Alexandru David
We present multiversion timestamp locking (MVTL), a new genre of multiversion concurrency control algorithms for serializable transactions. The key idea behind MVTL is simple and novel: lock individual time points instead of locking objects or versions. Af ...
2017Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free
Rachid Guerraoui, Tudor Alexandru David
We argue that there is virtually no practical situation in which one should seek a "theoretically wait-free" algorithm at the expense of a state-of-the-art blocking algorithm in the case of search data structures: blocking algorithms are simple, fast, and ...
ACM2016Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures
Rachid Guerraoui, Vasileios Trigonakis, Tudor Alexandru David
We introduce "asynchronized concurrency (ASCY),'' a paradigm consisting of four complementary programming patterns. ASCY calls for the design of concurrent search data structures (CSDSs) to resemble that of their sequential counterparts. We argue that ASCY ...
2015Designing ASCY-compliant Concurrent Search Data Structures
Rachid Guerraoui, Vasileios Trigonakis, Tudor Alexandru David, Tong Che
This report details the design of two new concurrent data structures, a hash table, called CLHT, and a binary search tree (BST), called BST-TK. Both designs are based on asynchronized concurrency (ASCY), a paradigm consisting of four complementary programm ...
2014Consensus Inside
Rachid Guerraoui, Maysam Yabandeh, Tudor Alexandru David
Scaling to a large number of cores with non-uniform communication latency and unpredictable response time may call for viewing a modern many-core architecture as a distributed system. In this view, the cores replicate shared data and ensure consistency amo ...
2014Consensus inside
Rachid Guerraoui, Maysam Yabandeh, Tudor Alexandru David
Scaling to a large number of cores with non-uniform communication latency and unpredictable response time may call for viewing a modern many-core architecture as a distributed system. In this view, the cores replicate shared data and ensure consistency amo ...
ACM Press2014