Parallel Dictionaries in 2-3 Trees

  title={Parallel Dictionaries in 2-3 Trees},
  author={Wolfgang J. Paul and Uzi Vishkin and Hubert Wagener},
Our model of computation is a parallel computer with k synchronized processors PI,...,Pk sharing a common random access storage, where simultaneous access to the same storage location by two or more processors is not allowed. Suppose a 2-3 tree T with n leaves is implemented in the storage, suppose al,...,a k are data that may or may not be stored in the leaves, and for all i, 1 4 i 4 k, processor Pi knows a i. We show how to search for al,...,a k in the tree T, how to insert these data into… CONTINUE READING