LUCAS. Associative array processor. Design, programming and application studies
LUCAS, an associative array processor, is defined as an SIMD processor with one control unit and many processing elements (PE's) which are activated by an associative process, i.e. by some property of the contents of the memory of the PE, and there is a topological relationship between the PE's, e.g. a linear array or a two-dimensional grid. The report is subdivided into three parts: Part 1 develops the theory and system architecture, Part 2 is devoted to programming aspects and Part 3 deals with application problems, above all with relational database processing and image processing. An epiloge discusses conclusions and continued research. I consider this report as an extremely valuable study of parallel processing, but for me there is always the contradiction of efficiency and robustness: Such parallel processors are very efficient for dedicated problems but they will immediately loose the efficiency in a universal environment although the authors claim that LUCAS is more general than they initially believed.
- Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint
- Comparison of the Prim-Dijkstra and Kraskal algorithms on an associative parallel processor
- STAR -- a language for associative and parallel computation with vertical processing
- Use of special processors for efficient realization of operations of relational algebra in vertical-processing systems
- An associative version of the Prim-Dijkstra algorithm and its application to some graph problems
This page was built for publication: LUCAS. Associative array processor. Design, programming and application studies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1071495)