Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

David, Tudor; Guerraoui, Rachid

doi:10.1145/2935764.2935774

Cited by 8 publications

(11 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Apart from these theoretical studies, the performance of concurrent lock-free search data structures are studied and investigated through empirical studies in [14], [8]. In [7], it is shown experimentally that the conflicts between threads occur very rarely in the context of concurrent search data structures, which is confirmed by our analysis.…”

Section: Related Worksupporting

confidence: 63%

Lock-Free Search Data Structures: Throughput Modelling with Poisson Processes

Atalar,

Renaud-Goud,

Tsigas

2018

Preprint

View full text Add to dashboard Cite

This paper considers the modelling and the analysis of the performance of lock-free concurrent search data structures. Our analysis considers such lock-free data structures that are utilized through a sequence of operations which are generated with a memoryless and stationary access pattern. Our main contribution is a new way of analysing lock-free search data structures: our execution model matches with the behavior that we observe in practice and achieves good throughput predictions. Search data structures are formed of linked basic blocks, usually referred as nodes, that can be accessed by two kinds of events, characterized by their latencies; (i) CAS events originated as a result of modifications of the search data structures (ii) Read events originated during traversals. This type of data structures are usually designed to accommodate a large number of data nodes, which makes the occurrence of an event on a given node rare at any given time. The throughput is defined by the number of events per operation in conjunction with the factors that impact the latencies of these events. We frame these impacting factors under capacity and coherence cache misses.In this context, we model the events as Poisson processes that we can merge and split to estimate the latencies of the events based on the interleaving of events from different threads, and in turn estimate the throughput. We have validated our analysis on several fundamental lock-free search data structures such as linked lists, hash tables, skip lists and binary trees.

show abstract

Section: Related Worksupporting

confidence: 63%

Lock-Free Search Data Structures: Throughput Modelling with Poisson Processes

Atalar,

Renaud-Goud,

Tsigas

2018

Preprint

View full text Add to dashboard Cite

show abstract

“…The update may have only reached the volatile CPU cache and can be lost upon a power failure or crash. To guarantee atomicity and durability of a pointer update, we update the forward pointer in HSIT using the flush-on-read technique [26,84,85]. Prism encodes a dirty bit to an unused bit into a forward pointer in HSIT entry.…”

Section: Cross-media Concurrency Controlmentioning

confidence: 99%

Prism: Optimizing Key-Value Store for Modern Heterogeneous Storage Devices

Song

Kim

Monga

et al. 2023

Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems,

View full text Add to dashboard Cite

As data generation has been on an upward trend, storing vast volumes of data cost-effectively as well as efficiently accessing them is paramount. At the same time, today's storage landscape continues to diversify, from high-bandwidth storage devices such as NVMe SSDs to low-latency non-volatile memory (e.g., Intel Optane DCPMM). These heterogeneous storage devices have the potential to deliver high performance in terms of bandwidth and latency with cost efficiency, while achieving the performance and cost targets together still remains a challenging problem.We provide our solution, Prism, a novel key-value store that utilizes modern heterogeneous storage devices. Prism uses heterogeneous storage devices synergistically to harness the advantages of each storage device while suppressing their downsides. We devise new techniques to balance the latency-bandwidth tradeoff when reading from SSD. For ensuring multicore scalability and crash consistency of data across heterogeneous storage media, Prism proposes cross-storage concurrency control and cross-storage crash consistency protocols. Our evaluation shows that Prism outperforms state-of-the-art key-value stores by up to 13.1× with significantly lower tail latency.

show abstract

“…The remainder of this subsection assumes fine-grained locking, where entries are individually locked. Hash table structures are used for the CS and PIT similar to most NDN software routers [5]- [7] as the probability of lock contention is low, as analyzed by David and Guerraoui [14].…”

Section: B Mutual Exclusion According To Compare-and-swap Instructionmentioning

confidence: 99%

Load Balancing for Stateful Forwarding by Mitigating Heavy Hitters: A Case for Multi-Threaded NDN Software Routers

2020

View full text Add to dashboard Cite

Equal load balancing for dispatching incoming packets to multiple threads is a crucial requirement in the stateful forwarding of multi-threaded software routers to achieve high-speed forwarding and low packet loss simultaneously. However, equal load balancing is not trivial for Named Data Networking (NDN) routers because of their stateful forwarding. In other words, the consistency of flow states should be maintained so that multiple threads do not access the states simultaneously. Sharding, wherein packets of the same flow are dispatched to the same thread while keeping loads of threads equal, has been proposed; however, in this study, we reveal that heavy hitters like popular content packets cause load imbalance, which may eventually cause packet losses. This study proposes a load balancing mechanism for NDN routers by exploiting the fact that states of flows need not be rigorously maintained when content packets are returned from caches at intermediate routers.

show abstract

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

Cited by 8 publications

References 53 publications

Lock-Free Search Data Structures: Throughput Modelling with Poisson Processes

Lock-Free Search Data Structures: Throughput Modelling with Poisson Processes

Prism: Optimizing Key-Value Store for Modern Heterogeneous Storage Devices

Load Balancing for Stateful Forwarding by Mitigating Heavy Hitters: A Case for Multi-Threaded NDN Software Routers

Contact Info

Product

Resources

About