Optimal Searching Algorithms for Parallel-Pipelined Computers.

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, called W-searches, are structured according to a new integer series, the W-series. The W-searches 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). (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1976
Accession Number
ADA027421

Entities

People

  • Daniel Lee Weller

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Central Processing Units
  • Computer Components
  • Computers
  • Parallel Processors

Readers

  • Operations Research
  • Parallel and Distributed Computing.