1.
Hascsi, Z.; Mitu, B.; Petre, M.; Stefan, G.
High-level synthesis of an enhanced Connex memory Proceedings Article
In: 1996 International Semiconductor Conference. 19th Edition. CAS'96 Proceedings, pp. 163-166 vol.1, 1996.
Abstract | Links | BibTeX | Tags: High level synthesis;Switches;Random access memory;Software performance;Data structures;Read-write memory;Hardware;Application software;Parallel processing;Computer aided manufacturing
@inproceedings{557330,
title = {High-level synthesis of an enhanced Connex memory},
author = {Z. Hascsi and B. Mitu and M. Petre and G. Stefan},
doi = {10.1109/SMICND.1996.557330},
year = {1996},
date = {1996-10-01},
booktitle = {1996 International Semiconductor Conference. 19th Edition. CAS'96 Proceedings},
volume = {1},
pages = {163-166 vol.1},
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 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.},
keywords = {High level synthesis;Switches;Random access memory;Software performance;Data structures;Read-write memory;Hardware;Application software;Parallel processing;Computer aided manufacturing},
pubstate = {published},
tppubtype = {inproceedings}
}
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.