A New Memory Layout for Self-Rebalancing Trees - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

A New Memory Layout for Self-Rebalancing Trees

Résumé

In this paper, we show that trees implemented as a collection of pointers suffer from a lack of parallelism opportunities. We propose an alternative implementation based on arrays. Both implementations appear to be equivalently efficient time-wise. However, this new layout exposes new parallelism opportunities which can be then exploited by an optimizing compiler.
Fichier principal
Vignette du fichier
cgo2021.pdf (332.92 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03123491 , version 1 (28-01-2021)

Identifiants

  • HAL Id : hal-03123491 , version 1

Citer

Paul Iannetta. A New Memory Layout for Self-Rebalancing Trees. CGO'21, Feb 2021, Séoul, South Korea. ⟨hal-03123491⟩
81 Consultations
127 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More