High-level synthesis of an enhanced Connex memory

Architectural deficiencies in symbolic processing systems are generated by the lack of an appropriate implementation of their memory functions. There are many well-defined memory functions, but there isn´t yet an adequate structural implementation for any of them. The main memory functions are usually software implemented as data structures, using RAM as hardware support, but having low performance in applications because all implementations rely on sequential mechanisms. The Connex Memory (CM), involves a base-level structural parallelism that would increase the performance in tree/list processing. This paper is concerned with the synthesis of an enhanced version of CM. Specific applications of the CM include list processing, set operations, string matching and Prolog-like computation.