High-Speed CAM-Based Architecture for a Prolog Machine (ASCA)
IEEE Transactions on Computers
HYTREM-A Hybrid Text-Retrieval Machine for Large Databases
IEEE Transactions on Computers
Associative and Parallel Processors
ACM Computing Surveys (CSUR)
Associative Processor Architecture—a Survey
ACM Computing Surveys (CSUR)
Contentaddressable Memories
Content Addressable Parallel Processors
Content Addressable Parallel Processors
VLSI for Artificial Intelligence
VLSI for Artificial Intelligence
Associative Array Processor
ASP: A Cost-Effective Parallel Microcomputer
IEEE Micro
Testing SRAM-Based Content Addressable Memories
IEEE Transactions on Computers
Programming and Computing Software
A 16-Kbit Theta-Search Associative Memory
IEEE Micro
Vertical Processing Systems: A Survey
IEEE Micro
A keyword match processor architecture using content addressable memory
Proceedings of the 14th ACM Great Lakes symposium on VLSI
Hardware acceleration for database systems using content addressable memories
DaMoN '05 Proceedings of the 1st international workshop on Data management on new hardware
Large-Capacity High-Throughput Low-Cost Pipelined CAM Using Pipelined CTAM
IEEE Transactions on Computers
Journal of Computer Systems, Networks, and Communications
Content-addressable memory core cells A survey
Integration, the VLSI Journal
Low-power high-performance NAND match line content addressable memories
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors
Fundamenta Informaticae
Hi-index | 0.01 |
The functional structure of a classical content-addressable memory (CAM) and its realization at the transistor level are described. Some unorthodox CAM approaches are briefly examined. Associative processor systems are discussed, and application-specific CAM architectures to support artificial intelligence features are surveyed. Limitations of associative processing and ways to circumvent them are addressed. The use of parallel cellular logic is considered.