New Parallel Order Maintenance Data Structure

08/16/2022
by   Bin Guo, et al.
0

The Order-Maintenance (OM) data structure maintains a total order list of items for insertions, deletions, and comparisons. As a basic data structure, OM has many applications, such as maintaining the topological order, core numbers, and truss in graphs, and maintaining ordered sets in Unified Modeling Language (UML) Specification. The prevalence of multicore machines suggests parallelizing such a basic data structure. This paper proposes a new parallel OM data structure that supports insertions, deletions, and comparisons in parallel. Specifically, parallel insertions and deletions are synchronized by using locks efficiently, which achieve up to 7x and 5.6x speedups with 64 workers. One big advantage is that the comparisons are lock-free so that they can execute highly in parallel with other insertions and deletions, which achieve up to 34.4x speedups with 64 workers. Typical real applications maintain order lists that always have a much larger portion of comparisons than insertions and deletions. For example, in core maintenance, the number of comparisons is up to 297 times larger compared with insertions and deletions in certain graphs. This is why the lock-free order comparison is a breakthrough in practice.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2022

Parallel Order-Based Core Maintenance in Dynamic Graphs

The core numbers of vertices in a graph are one of the most well-studied...
research
10/20/2022

Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance

Projection maintenance is one of the core data structure tasks. Efficien...
research
01/08/2020

The Simplex Tree: an Efficient Data Structure for General Simplicial Complexes

This paper introduces a data structure, called simplex tree, to represen...
research
07/13/2021

Maintaining 𝖢𝖬𝖲𝖮_2 properties on dynamic structures with bounded feedback vertex number

Let φ be a sentence of 𝖢𝖬𝖲𝖮_2 (monadic second-order logic with quantific...
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
11/03/2022

SQUID: Faster Analytics via Sampled Quantiles Data-structure

Measurement is a fundamental enabler of network applications such as loa...
research
01/18/2022

Simplified Algorithms for Order-Based Core Maintenance

Graph analytics attract much attention from both research and industry c...

Please sign up or login with your details

Forgot password? Click here to reset