Maintaining B-trees on an EREW PRAM

DOI10.1006/JPDC.1994.1092MaRDI QIDQ1344541zbMATH OpenOpenAlexFDO

Authors Lisa Higham, Eric Schenk

Publication date 6 July 2000

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1994.1092

Mathematics Subject Classification ID

Data structures (68P05) Parallel algorithms in computer science (68W10)

Cited in

(4)

• A design of a parallel dictionary using skip lists
• Skip trees, an alternative data structure to skip lists in a concurrent approach
• Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.
• Parallel dictionaries with local rules on AVL and brother trees

This page was built for publication: Maintaining \(B\)-trees on an EREW PRAM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344541)