Parallel dictionaries on AVL trees

AVL trees are efficient data structures for implementing dictionaries. We present a parallel dictionary, using AVL trees, on the EREW-PRAM by proposing optimal algorithms to perform k operations with p (1⩽p⩽k) processors. An explicit processor scheduling is devised to avoid simultaneous reads in our parallel algorithm to perform k searches, which avoids the need for any additional memory in the parallelization. To perform multiple insertions and deletions, we identify rotations (in addition to AVL tree rotations) required to restore balance and present parallel algorithm to perform p insertions/deletions in O(log n+log p) time with p processors