Parallel and Distributed Solutions for the Optimal Binary Search Tree Problem

Authors:
Mitica Craus
Affiliations:
-
Venue:
IWCC '01 Proceedings of the NATO Advanced Research Workshop on Advanced Environments, Tools, and Applications for Cluster Computing-Revised Papers
Year:
2001

Citing 4
Cited 0

A unifying framework for systolic designs

Proc. of the Aegean workshop on computing on VLSI algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Distributed computing: fundamentals, simulations and advanced topics

Distributed computing: fundamentals, simulations and advanced topics
Data Structures, Algorithms and Object Oriented Programming

Data Structures, Algorithms and Object Oriented Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A parallel and a distributed implementation for a very important problem in the searching theory,the optimal binary search tree (BST) problem,is presented and analyzed. Implemented as a VLSI array, the algorithm for building the optimal BST uses O(n2) processors and has the parallel time complexity O(n). A search is solved in O(log n) time. On a cluster of computers, the binary search tree is organized on two levels: the first level corresponds to the BST of searching intervals and the second level is the level of the BST for effective searching within an interval. A hybrid solution is also considered. The best variant depends on the hypothesis of the searching problem.