Login / Signup
Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem.
Jerry Lacmou Zeutouo
Vianney Kengne Tchendji
Jean Frédéric Myoupo
Published in:
Int. J. Parallel Emergent Distributed Syst. (2022)
Keyphrases
</>
binary search trees
parallel algorithm
coarse grained
shared memory
fine grained
data structure
parallel computation
search tree
parallel version
high level
medial axis transform
multithreading
b tree
access control
search space
hiv protease
cluster of workstations