Parallel Binary Search

Two arrays of numbers sorted in nondecreasing order are given: an array A of size n and an array B of size m, where n >

[1]  Clyde P. Kruskal,et al.  Searching, Merging, and Sorting in Parallel Computation , 1983, IEEE Transactions on Computers.

[2]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[3]  Selim G. Akl,et al.  Optimal Parallel Merging and Sorting Without Memory Conflicts , 1987, IEEE Transactions on Computers.

[4]  Selim G. Akl,et al.  Parallel Binary Search with Delayed Read Conflicts , 1990, Int. J. High Speed Comput..