Issue No. 07 - July (1983 vol. 32)
J.-L. Baer , Department of Computer Science, University of Washington
In this paper we consider variations on the binary search algorithm when placed in the context of a multiprocessing environment. Several organizations are investigated covering the spectrum from total independence (or free competition for access to common resources) to cooperation as in SIMD architectures. It is assumed that the two main sources of overhead are memory interference and interprocessor synchronization. An organization combining interference-free access to memory by implicit synchronization and a small degree of cooperation yields the best results.
SIMD architectures, Binary search, memory interference, multiprocessor systems
null Hung-Chang Du, J.-L. Baer, R.E. Lander, "Binary Search in a Multiprocessing Environment", IEEE Transactions on Computers, vol. 32, no. , pp. 667-677, July 1983, doi:10.1109/TC.1983.1676298