Advertisement

Optimal searching algorithms for parallel-pipelined computers

  • Daniel L. Weller
  • Edward S. Davidson
Session 8: Computation Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 24)

Abstract

A new class of optimal search algorithms is presented for the classical problem of searching an ordered list. The appropriate algorithm is selected as a function of the order, (s,p), of the target processor which may consist of p parallel processors each of which is an s level pipelined processor. The algorithms are structured according to a new integer series, the W-series. The algorithms include the binary search for processors of order (1,1), the Fibonacci search for processors of order (2,1), and well-known parallel searches for processors of order (1,p). Performance of the algorithms is evaluated. The algorithms are well-suited to computers with interleaved or parallel memory banks.

Keywords

Leaf Node Search Tree Internal Node Search Time Binary Search 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D.E. Knuth, The Art of Computer Programming, Vol. 3, Addison-Wesley, (1973), pp. 414–416.Google Scholar
  2. [2]
    R.M. Karp and W.L. Miranker, "Parallel Minimax Search for a Maximum," Journal of Combinatorial Theory, Vol. 4, (1968), pp. 19–35.Google Scholar
  3. [3]
    J. Kiefer, "Sequential Minimax Search for a Maximum," Amer. Math. Soci. Proc., Vol. 4, (1953), pp. 502–505.Google Scholar
  4. [4]
    D.E. Knuth, The Art of Computer Programming, Vol. 1, Addison-Wesley, (1969), pp. 81–82.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Daniel L. Weller
    • 1
  • Edward S. Davidson
    • 1
  1. 1.Coordinated Science LaboratoryUniversity of IllinoisUrbana

Personalised recommendations