Abstract

The simplicity of programming associative supercomputers is described, and conventional associative data references are expanded into a generalized associative data structure reference mechanism which encompasses the arrays, data structures, and data-typing constructs of conventional languages. A unified approach is presented for representing arbitrarily complex data structures in content addressable memories and associative computers. This approach to data structures in associative computers has the advantages of (1) automatically extracting fine-grain parallelism. (2) eliminating much of the complexity of the nonalgorithmic address computation in program development, (3) allowing multiple data structures to be associated with each datum, (4) allowing the data structures themselves to be modified, and (5) allowing information exchange between vastly different program languages such as Lisp, Prolog, OPS5, Fortran and Pascal. >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.