IEEE Transactions on Computers · 1971 · 50 citations · 2 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureData StructuresMemoryLookup TablesMemory HierarchyMemory SystemsAdder DesignMemory Search
A method of determining the number of responders to a search in an associative memory is presented. It is shown that less than one full adder per memory cell is required and that the maximum delay in establishing the count is proportional to n, where n is the log to the base 3 of the number of memory cells.
2
Algorithms for Parallel-Search Memories
Adin D. Falkoff · Journal of the ACM · 1962 · 94 citations
A search memory subsystem for a general-purpose computer
Albert Kaplan · 1963 · 12 citations · Full text