Beyond massive parallelism: Numerical computation using associative tables

DOI10.1016/0167-8191(90)90155-3MaRDI QIDQ753471zbMATHOpenAlexFDO

Authors C. Douglas, Willard L. Miranker

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90155-3

zbMATH Keywords

parallel computingmassive parallelismKarmarkar's algorithmtable methodsassociative tableshardware implementationsproblem solution by associative memory

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Numerical methods for initial value problems involving ordinary differential equations (65L05) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• scientific article; zbMATH DE number 4074439
• KANERVA’S SPARSE DISTRIBUTED MEMORY: AN ASSOCIATIVE MEMORY ALGORITHM WELL-SUITED TO THE CONNECTION MACHINE
• A comparison of associative computation models
• scientific article; zbMATH DE number 882126
• Basic associative parallel algorithms for vertical processing systems

Cited in

(2)

• Tabular minimal redundant modular structures for fast and high-precision computations using general-purpose computers
• Theoretical and methodological bases of modular technology of parallel tabular computations using universal processors

This page was built for publication: Beyond massive parallelism: Numerical computation using associative tables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753471)