Title

Parallel Dictionaries On Avl Trees

Abstract

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 LSEQ 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 algorithms to perform p insertions/deletions in O(log n + log p) time with p processors.

Publication Date

1-1-1994

Publication Title

Proceedings of the International Conference on Parallel Processing

Number of Pages

878-882

Document Type

Article; Proceedings Paper

Identifier

scopus

Personal Identifier

scopus

Socpus ID

0028138004 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0028138004

This document is currently not available here.

Share

COinS