O
Ori Shalev
Researcher at Tel Aviv University
Publications - 9
Citations - 2186
Ori Shalev is an academic researcher from Tel Aviv University. The author has contributed to research in topics: Record locking & Concurrent computing. The author has an hindex of 6, co-authored 9 publications receiving 2129 citations. Previous affiliations of Ori Shalev include Sun Microsystems Laboratories.
Papers
More filters
Journal Article
Transactional locking II
Dave Dice,Ori Shalev,Nir Shavit +2 more
TL;DR: This paper introduces the transactional locking II (TL2) algorithm, a software transactional memory (STM) algorithm based on a combination of commit-time locking and a novel global version-clock based validation technique, which is ten-fold faster than a single lock.
Book ChapterDOI
Transactional locking II
Dave Dice,Ori Shalev,Nir Shavit +2 more
TL;DR: TL2 as mentioned in this paper is a software transactional memory (STM) algorithm based on a combination of commit-time locking and a novel global version-clock based validation technique, which is ten times faster than a single lock.
Journal ArticleDOI
Split-ordered lists: Lock-free extensible hash tables
Ori Shalev,Nir Shavit +1 more
TL;DR: Though lock-free algorithms are expected to work best in multiprogrammed environments, empirical tests show that the new algorithm performs as well as the most efficient known lock-based resizable hash-table algorithm, and in high load cases it significantly outperforms it.
Proceedings ArticleDOI
Split-ordered lists: lock-free extensible hash tables
Ori Shalev,Nir Shavit +1 more
TL;DR: Empirical tests show the first lock-free implementation of an extensible hash table running on current architectures provides concurrent insert, delete, and search operations with an expected O(1) cost and is well suited for real-time applications.
Book ChapterDOI
The baskets queue
TL;DR: The Baskets Queue is presented - a new, highly concurrent lock-free linearizable dynamic memory FIFO queue that creates baskets of mixed-order items instead of the standard totally ordered list and outperforms the original MS-queue algorithm in various benchmarks.