The Connex Memory: A Physical Support for Tree/List Processing

ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY
Volume 1, Number 1, 1998, 85 - 104

Gheorghe STEFAN
University "Politehnica" of Bucharest
Department of Electronics
Bd. Iuliu Maniu 1-3, 77202 Bucharest, Romania
E-mail: stefan@agni.arh.pub.ro

Abstract.
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 is not yet an adequate structural implementation for any of them. bThe main memory functions are usually software implemented as data structures, using RAM as a hardware support, but having low performance in applications because all implementations rely on sequential mechanisms. Our proposal, the connex memory (CM), involves a base-level structural parallelism that would increase the performance in tree/list processing. This paper suggests, also, the architecture and the structure of a computation model: the automaton with connex memory (ACM), which we consider a superior alternative for sequential memory in the design of tree/list oriented architectures.