
This paper describes a methodology for the implementation of asynchronous parallel iterative algorithms, which is the domain decomposition method. This approach reduces the cost of synchronization that affects synchronous algorithms. As an application of the proposed approach, the algorithms based on the well-known point-SOR methods are presented in both synchronous and asynchronous forms. Results obtained using the MIMD (Multiple Instruction stream Multiple data stream) superparallel computer are given, for the model problem of the solution of a Poisson equation.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
