Near-Data-Processing (NDP) architectures present a promising way to alleviate data
movement costs and can provide significant performance and energy benefits to parallel …

Today's cloud based online services are underpinned by distributed key-value stores (KVS).
Such KVS typically use a scale-out architecture, whereby the dataset is partitioned across a …

This paper presents multi-version read-log-update (MV-RLU), an extension of the read-log-
update (RLU) synchronization mechanism. While RLU has many merits including an …

Modern memory-optimized indexes often use optimistic locks for concurrent accesses. Read
operations can proceed optimistically without taking the lock, greatly improving performance …

Many key-value stores use RDMA to optimize the messaging and data transmission
between application layer and the storage layer, most of which only provide point-wise …

To maximize the performance of concurrent data structures, researchers have often turned to
highly complex fine-grained techniques, resulting in efficient and elegant algorithms, which …

Universal constructions are attractive as they can turn a sequential implementation of any
data structure into a concurrent implementation. However, existing universal constructions …

Irregular applications comprise an increasingly important workload domain for many fields,
including bioinformatics, chemistry, physics, social sciences and machine learning …

Recent decades have witnessed a surge in the development of concurrent data structures
with an increasing interest in data structures implementing concurrent sets (CSets) …

Concurrent priority queues are widely used in important workloads, such as graph
applications and discrete event simulations. However, designing scalable concurrent priority …