Optimal searching algorithms for parallel-pipelined computers
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.
KeywordsLeaf Node Search Tree Internal Node Search Time Binary Search
Unable to display preview. Download preview PDF.
- D.E. Knuth, The Art of Computer Programming, Vol. 3, Addison-Wesley, (1973), pp. 414–416.Google Scholar
- 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
- J. Kiefer, "Sequential Minimax Search for a Maximum," Amer. Math. Soci. Proc., Vol. 4, (1953), pp. 502–505.Google Scholar
- D.E. Knuth, The Art of Computer Programming, Vol. 1, Addison-Wesley, (1969), pp. 81–82.Google Scholar