Beyond massive parallelism: Numerical computation using associative tables (Q753471)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Beyond massive parallelism: Numerical computation using associative tables |
scientific article; zbMATH DE number 4180766
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Beyond massive parallelism: Numerical computation using associative tables |
scientific article; zbMATH DE number 4180766 |
Statements
Beyond massive parallelism: Numerical computation using associative tables (English)
0 references
1990
0 references
The authors discuss the basic problem to speed up algorithms by the use of available information from previous solutions or solution steps. This information should be stored in and delivered by an associative memory. In this context the solution of ordinary and partial differential equations and Karmarkar's algorithm are discussed. The authors write: Our results have a speculative character, since we deal with numerical computation on a connectionist (analog) parallel model and a putative class of hardware implementations.
0 references
massive parallelism
0 references
associative tables
0 references
problem solution by associative memory
0 references
table methods
0 references
parallel computing
0 references
Karmarkar's algorithm
0 references
hardware implementations
0 references
