Title :
Fast Search Algorithms for Associative Memories
Author :
Davis, Wayne A. ; Lee, De-lei
Author_Institution :
Department of Computing Science, University of Alberta
fDate :
5/1/1986 12:00:00 AM
Abstract :
A new scheme for constructing search algorithms for bit-parallel associative memories of m n-bit words is described. The resulting equivalence searches, threshold searches, and double-limit searches achieve the time bound of O(log n), compared to O(n), the recent result of Ramamoorthy et al. [12]. The extremum search algorithm by Frei and Goldberg [2] is modified and generalized so that the number of memory interrogations is reduced by 30 percent over the initial algorithm in the average case.
Keywords :
Adjacency search; algorithm; associative memory; double-limit search; extremum search; threshold search; word-tree; Associative memory; Content based retrieval; Costs; Councils; Delay; Hardware; Logic; Power engineering and energy; Proposals; Random access memory; Adjacency search; algorithm; associative memory; double-limit search; extremum search; threshold search; word-tree;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1986.1676788
