Lock-Free Transactional Adjacency List

03/24/2019
by   Zachary Painter, et al.
0

Adjacency lists are frequently used in graphing or map based applications. Although efficient concurrent linked-list algorithms are well known, it can be difficult to adapt these approaches to build a high-performance adjacency list. Furthermore, it can often be desirable to execute operations in these data structures transactionally, or perform a sequence of operations in one atomic step. In this paper, we present a lock-free transactional adjacency list based on a multi-dimensional list (MDList). We are able to combine known linked list strategies with the capability of the MDList in order to efficiently organize graph vertexes and their edges. We design our underlying data structure to be node-based and linearizable, then use the Lock-Free Transactional Transformation (LFTT) methodology to efficiently enable transactional execution. In our performance evaluation, our lock-free transactional adjacency list achieves an average of 50 implementation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/03/2022

Technical Report: Bundling Linked Data Structures for Linearizable Range Queries

We present bundled references, a new building block to provide lineariza...
research
06/12/2023

RIP Linked List

Linked lists have always been an excellent teaching tool in programming....
research
10/14/2020

Fast Generation of Unlabelled Free Trees using Weight Sequences

In this paper, we introduce a new representation for ordered trees, the ...
research
10/29/2020

A more Pragmatic Implementation of the Lock-free, Ordered, Linked List

The lock-free, ordered, linked list is an important, standard example of...
research
08/05/2021

Space and Time Bounded Multiversion Garbage Collection

We present a general technique for garbage collecting old versions for m...
research
12/22/2022

GraphTango: A Hybrid Representation Format for Efficient Streaming Graph Updates and Analysis

Streaming graph processing involves performing updates and analytics on ...
research
06/23/2022

A Hybrid Adjacency and Time-Based Data Structure for Analysis of Temporal Networks

Dynamic or temporal networks enable representation of time-varying edges...

Please sign up or login with your details

Forgot password? Click here to reset