Fine-Grained Parallelism in Computational Mathematics

Authors:
O. L. Bandman
Affiliations:
Institute of Computational Mathematics and Mathematical Geophysics, Siberian Division, Russian Academy of Sciences, pr. Akademika Lavrent'eva 6, Novosibirsk, 630090 Russia bandman@ssd.sscc ...
Venue:
Programming and Computing Software
Year:
2001

Citing 5
Cited 0

A 16 × 16 Cellular Neural Network UniversalChip: The First Complete Single-Chip Dynamic Computer Array withDistributed Memory and with Gray-Scale Input-Output

Analog Integrated Circuits and Signal Processing - Special issue: cellular neural networks and analog VLSI
A lattice gas automation capable of modeling three-dimensional electromagnetic fields

Journal of Computational Physics
Parallel Substitution Algorithm: Theory and Application

Parallel Substitution Algorithm: Theory and Application
Hardware Support for 3D Cellular Processing

PaCT '97 Proceedings of the 4th International Conference on Parallel Computing Technologies
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, a systematic discussion is made of state of the art theory and applications of fine-grained (massive) parallelism, which is permanently being adopted in computational mathematics. All known models of fine-grained computations (cellular automaton, neural and cellular neural networks, statistical automata, etc.) are represented in terms of a unique formalism, the so-called parallel substitution algorithm (PSA), which made it possible, on the one hand, to highlight common properties of the models and, on the other hand, to demonstrate expressiveness capabilities of the PSA. Theoretical and experimental results of studies on applications of fine-grained algorithms to modeling of spatial dynamics of reaction–diffusion and molecular processes are presented. Promising prospects of their application are substantiated both for the creation of special processors designed for the implementation of the algorithms and for the implementation of the algorithms on multiprocessor systems.