Binary Search in a Multiprocessing Environment

Baer,; Du, H. C.; Lander,

doi:10.1109/tc.1983.1676298

Cited by 6 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This suggests that we consider computational models where the number of shared memory cells is restricted, and where the amount of information that can be transferred in one read or write operation is smaller than the content of a memory cell. The work of Baer, Du and Ladner [1], and of Vishkin and Wigderson [13] is a useful start in the investigation of such systems. 9.…”

Section: Discussionmentioning

confidence: 99%

On Parallel Searching

Snir¹

1985

SIAM J. Comput.

View full text Add to dashboard Cite

We investigate the complexity of searching a sorted table of n elements on a synchronous, shared memory parallel computer with p processors. We show that f(lg n-lgp) steps are required if concurrent accesses to the same memory cell are not allowed, whereas O(lg n/lg p) steps are sufficient if simultaneous reads are allowed. The lower bound is valid even if only communication steps are counted, and the computational power of each processor is not restricted. In this model, (R)(x/-g n) steps are required for searching when the number of processors is unbounded. If the amount of information that a memory cell may store is restricted, then the time complexity for searching with an unbounded number of processors is O(lg n/lg lg n). If the amount of information a processor may hold is also restricted, then an fl(lg n) lower bound holds. These lower bounds are first proven for comparison-based algorithms; it is next shown that comparison-based algorithms are as powerful as more general ones in solving problems defined in terms of the relative order of the inputs.

show abstract

Section: Discussionmentioning

confidence: 99%