Massively parallel and distributed dictionaries on AVL and brother trees
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/82910
Tipus de documentReport de recerca
Data publicació1996-04
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
We present a set of local rules to deal with
distributed dictionaries,
having as a main advantage their possible scheduling
in a highly synchronized way to get
massively parallel dictionaries on AVLs.
Recall that, up to now trees
used in massively parallel dictionaries needed
to have all the leaves
at the same depth, such as 2-3 trees. Therefore,
it was possible (in INSERTions and deletions) to reconstruct the tree
bottom-up in a very
regular fashion, as a pipeline of
straight plane waves moving
up. On AVL trees the situation looks different because
leaves can
have different depth, therefore any weave
in a pipeline is
highly irregular. To solve this problem we define
virtual plane waves allowing us to develop an
EREW dictionary for k keys with k processors
and time O(log n + log k).
Later on we generalize the sequential algorithms on brother
trees presented by T. Ottmann and D. Wood in the same way.
CitacióGabarro, J., Messeguer, X. "Massively parallel and distributed dictionaries on AVL and brother trees". 1996.
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
R96-27.ps | 545,2Kb | Postscript | Visualitza/Obre |