Concurrent Treaps and Impact of Locking Objects

We propose algorithms to perform operations concurrently on treaps in a shared memory multi-core environment. Concurrent treaps hold the advantage of using nodes’ priority for maintaining the height of the treaps. To achieve synchronization, concurrent treaps make use of fine-grained locking mechani...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:New generation computing Jg. 38; H. 1; S. 187 - 212
Hauptverfasser: Alapati, Praveen, Mutyam, Madhu, Saranam, Swamy
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Tokyo Ohmsha 01.03.2020
Springer Nature B.V
Schlagworte:
Algorithms
Artificial Intelligence
Computer Hardware
Computer Science
Computer Systems Organization and Communication Networks
Data structures
Locking
Nodes
Software Engineering/Programming and Operating Systems
Synchronism
Trees
Treaps
Concurrent data structures
Locking objects
Concurrency
ISSN:0288-3635, 1882-7055
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose algorithms to perform operations concurrently on treaps in a shared memory multi-core environment. Concurrent treaps hold the advantage of using nodes’ priority for maintaining the height of the treaps. To achieve synchronization, concurrent treaps make use of fine-grained locking mechanism along with logical ordering and physical ordering of nodes’ keys. We initially study the throughput and performance-per-Watt (PPW) of our concurrent treap implementation and observe that it scales well, and performs better than the state-of-the-art implementations. We further continue studies to understand the impact of different locking objects on both throughput and PPW. Our experiments show that a concurrent treap implementation that uses AtomicInteger as the locking object provides better throughput and PPW, at the same time uses a low memory footprint. As part of the application study, we consider concurrent interval trees by choosing different underlying concurrent search tree implementations as the base. We observe that the concurrent interval tree implementation that uses concurrent treap as an underlying data structure provides better throughput.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0288-3635
1882-7055
DOI:10.1007/s00354-019-00073-z