Optimal parallel conflict-free access to extended binary trees

Authors :: Lutz Andrews
Reiner Creutzburg
Source :: Recent Issues in Pattern Analysis and Recognition ISBN: 9783540518150, Recent Issues in Pattern Analysis and Recognition
Publication Year :: 1989
Publisher :: Springer Berlin Heidelberg, 1989.
Abstract: In this paper the parallel conflict-free access to complete extended binary subtrees of complete binary trees is investigated. Thereby linear and also nonlinear memory module assignment functions S are considered. Furthermore, the problem of optimal parallel access to extended binary trees is solved.

Subjects :: Binary tree
Geometry of binary search trees
Computer science
Binary search tree
Optimal binary search tree
Weight-balanced tree
Bit-length
Binary expression tree
Algorithm
Tree (graph theory)
Random binary tree

ISBN :: 978-3-540-51815-0
ISBNs :: 9783540518150
Database :: OpenAIRE
Journal :: Recent Issues in Pattern Analysis and Recognition ISBN: 9783540518150, Recent Issues in Pattern Analysis and Recognition
Accession number :: edsair.doi...........3808d20ec5602cfffff0ae3468f53874
Full Text :: https://doi.org/10.1007/3-540-51815-0_55