Batched searching of sequential and tree structured files
ACM Transactions on Database Systems (TODS)
Interference in multiprocessor computer systems with interleaved memory
Communications of the ACM
Optimal Searching Algorihtms for Parallel Pipelined Computers
Proceedings of the Sagamore Computer Conference on Parallel Processing
The Intel®8087 numeric data processor
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
An analysis of the instruction execution rate in certain computer structures
An analysis of the instruction execution rate in certain computer structures
Analysis of Memory Interference in Multiprocessors
IEEE Transactions on Computers
Interleaved Memory Bandwidth in a Model of a Multiprocessor Computer System
IEEE Transactions on Computers
A dichromatic framework for balanced trees
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Large-Capacity High-Throughput Low-Cost Pipelined CAM Using Pipelined CTAM
IEEE Transactions on Computers
Data Exchange Optimization in Reconfigurable
IEEE Transactions on Computers
| Hi-index | 14.99 |
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.