Skip to main content
SpringerLink
Log in
Book cover

NATO Advanced Research Workshop on Cluster Computing

IWCC 2001: Advanced Environments, Tools, and Applications for Cluster Computing pp 103–117Cite as

Parallel and Distributed Solutions for the Optimal Binary Search Tree Problem

  • Conference paper
  • First Online:

  • 507 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2326))

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(n 2) 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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Horowitz, E., Sahni, S., Anderson-Freed, S.: Fundamentals of Data Structures in C, Computer Science Press, New York (1993)

    MATH  Google Scholar 

  2. Guerra, C.: A Unifying Framework for Systolic Design, LNCS 227, Springer-Verlag, Berlin Heidelberg New York (1986) 46–56

    Google Scholar 

  3. H. Attiya, Welch, H.J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, London (1998)

    Google Scholar 

  4. Rogers, W., Candela, G., Harman, D.: Space an Time Improvements for Indexing in Information Retrieval, National Institute of Standards & Technology, Gaithesburg (2001)

    Google Scholar 

  5. Baase, S., Van Gelder A.: Computer Algorithms: Introduction to Design & Analysis, Addison Wesley Longman (2000)

    Google Scholar 

  6. Heileman, G.: Data Structures, Algorithms and Object-Oriented programming, McGraw-Hill, New York (1996)

    MATH  Google Scholar 

  7. Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kauffman (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Department, ”Gh.Asachi” Technical University of Iasi, 6600, Iaşi, Romania

    Mitică Craus

Authors
  1. Mitică Craus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University College Cork, College Road, Cork, Ireland

    Dan Grigoras

  2. Information and Computer Science Department, University of California, 444 Computer Science Building, Irvine, CA, 92697-3425, USA

    Alex Nicolau

  3. Laboratoire d’Informatique Fondamentale de Lille (LIFL), University Lille 1, 59655, Villeneuve d’Ascq, France

    Bernard Toursel

  4. LIP, University Paris 6, 8, rue du Capitaine Scott, 75015, Paris, France

    Bertil Folliot

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Craus, M. (2002). Parallel and Distributed Solutions for the Optimal Binary Search Tree Problem. In: Grigoras, D., Nicolau, A., Toursel, B., Folliot, B. (eds) Advanced Environments, Tools, and Applications for Cluster Computing. IWCC 2001. Lecture Notes in Computer Science, vol 2326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47840-X_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-47840-X_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43672-0

  • Online ISBN: 978-3-540-47840-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation