An associative parallel processor with application to picture processing

A note on associative processors for data management

“…The second instance for the use of comparison is as for the CROSS-MARK instruction, where now single domain values of a target relation are compared against k comparands from the source relation in one tuple time. The simultaneous comparison of one value with k comparands was also done by Fuller and Bird [5], but not in the context of a relational database join operation. This type of comparison could be done with ACM Tnmsactions on Database Systems, Vol.…”

Associative and Parallel Processors

“…In 1965, Fuller and Bird [35] described a bztshce associative processor architecture. Fuller and Bird discussed their algorithms in terms of state transitions.…”

“…However, there are problems in which a B/C approach is more efficient. (The B/C approach is the same as described by Crane and Githens [76], and was discovered independently by Fuller and B*rd [35].) The B/C organization allows many operands to be processed simultaneously in a bit-parallel mode.…”

Research and development in the computer and information sciences :

“…Other than such scratchpad memory usage, several special-purpose and experimental associative memory developments may be of interest. One is Librascope's APP (/issociative Parallel Processor), as described by Fuller and Bird (1965), intended for use in such tasks as pattern-property-extraction and pattern classification. ^-^^^A nother example is the Pattern Articulation Unit and related parallel processing capabilities of the ILLIAC III computer.^" '' In a 1966 survey, Hanlon reports that "memory cycle times have been reported as low as 50 nanoseconds" and that "although the majority of research to date has been with small memories (up to 1000 cells), projections are indicated in the 10^-10* bit range, (p. 519)" Hobbs in one of a series of state-of-the-art reviews (1966) concurs in the opinion that advantages can be attained and dis-advantages lessened by the use of a relatively small associative memory coupled to a large capacity random access store.…”