We present a set of local rules to deal with dictionaries. Their main advantage is that they can be scheduled in a highly synchronized way to get parallel dictionaries on AVL trees. 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) the bottom-up reconstruction of the tree in a very regular fashion, as a pipeline of plane waves moving up. On AVL trees the situation looks di erent because leaves can have di erent depth, therefore any w ave i n a pipeline is highly irregular. To solve this problem we de ne 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 Ottmann and Wood in the same way.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.