Data structures such as sets, relations and graphs occur frequently in Artificial Intelligence applications. When these structures are large, as in deductive databases and knowledge bases, the performance of conventional computers is poor. The generic operations on these structures, such as pattern-directed search, set intersection and transitive closure, all involve associative matching of variable-length lexical strings. In this paper, which is an updated version of a recent UNICOM presentation, we describe novel add-on hardware which employs SIMD parallel techniques to achieve the required associative processing. The hardware is embedded in an architecture which allows knowledge bases to be stored and processed in situ. Performance figures are given.
CITATION STYLE
Lavington, S. (1991). Parallel associative processing for knowledge bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 503 LNCS, pp. 112–123). Springer Verlag. https://doi.org/10.1007/3-540-54132-2_53
Mendeley helps you to discover research relevant for your work.