Concurrent Deterministic Skiplist and Other Data Structures

TL;DR

This paper presents a concurrent deterministic skiplist optimized for many-core NUMA systems, along with evaluations of lock-free queues and hash tables, introducing memory management strategies to enhance performance.

Contribution

It introduces a concurrent deterministic skiplist and strategies for memory management to improve performance on NUMA architectures, with comparative evaluations of related data structures.

Findings

Hierarchical data structures reduce memory latency.

Memory management strategies decrease page faults and cache misses.

Concurrent skiplist performs efficiently on many-core NUMA systems.

Abstract

Skiplists are used in a variety of applications for storing data subject to order criteria. In this article we discuss the design, analysis and performance of a concurrent deterministic skiplist on many-core NUMA nodes. We also evaluate the performance of concurrent lock-free unbounded queue implementation and two concurrent multi-reader,multi-writer(MWMR) hash table implementations and compare them with those from Intel's Thread Building Blocks(TBB) library. We introduce strategies for memory management that reduce page faults and cache misses for the memory access patterns in these data structures. This paper proposes hierarchical usage of concurrent data structures in programs to improve memory latencies by reducing memory accesses from remote NUMA nodes.