Fast Search Algorithms for Associative Memories
- 1 May 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-35 (5) , 456-461
- https://doi.org/10.1109/TC.1986.1676788
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
This publication has 5 references indexed in Scilit:
- A Design of a Fast Cellular Associative Memory for Ordered RetrievalIEEE Transactions on Computers, 1978
- Associative Processor Architecture—a SurveyACM Computing Surveys, 1977
- Associative memories and processors: An overview and selected bibliographyProceedings of the IEEE, 1973
- Algorithms for Parallel-Search MemoriesJournal of the ACM, 1962
- A Method for Resolving Multiple Responses in a Parallel Search FileIEEE Transactions on Electronic Computers, 1961