Applications of convergence acceleration methods to asynchronous iterations

Authors

  • A.S. Rasulov The University of World Economy and Diplomacy Author
  • G.M. Raimova The University of World Economy and Diplomacy Author

Keywords:

asynchronous iterations, parallel algorithms, relaxation methods

Abstract

In this work we will consider asynchronous iteration algorithms. As is well known in multiprocessor computers the parallel application of iterative methods often shows poor scaling and less than optimal parallel efficiency. The ordinary iterative asynchronous method often has much better efficiency as they almost never need to wait to communicate between possessors. The result of our numerical experiments shows better efficiency of asynchronous iterative processes for considered problem.

References

Rasulov A.S., Bakoev M.T. 2014. Probabilistic Approach to the Asynchronous Iteration. Journal of Applied Mathematics and Physics. 2, – P. 32–40.

Bertsekas D., Tsitsiklis J. 1997. Parallel and Distributed Computation: Numerical Methods. – 731 p.

Baudet G.M. 1977. Iterative Methods for Asynchronous Multiprocessors. High Speed Computer and Algorithm Organization. In: D. Kuck, D. Lawrie and A. Sameh, Eds., Academic Press, New York, – P. 309–310.

Baudet G.M. 1978. Asynchronous Iterative Methods for Multiprocessors. Journal of Associated Computation. – Vol. 25. – No. 2, – P. 226–244. http://dx.doi.org/10.1145/322063.322067

Robert F., Charnay M. and Musy F. 1975. Iteration Chaotiques Serie-Parablele Pour Equations Non-Linearires de Point Fixe. Applied Mathematics. – Vol. 20, – No. 1, – P. 1–38.

Chazan D. and Miranker W. 1969. Chaotic Relaxation. Linear Algebra and Its Applications. Vol. 2, – P. 199–229. http://dx.doi.org/10.1016/0024-3795(69)90028-7

Donelly J.D. Periodic Chotic Relaxation. 1971. Linear Algebra and Its Applications. No. 2, – P. 117–128. http://dx.doi.org/10.1016/0024-3795(71)90033-4

Nesterenko B.B., Marchuk V.A. 1989. Basics of Asynchronous Methods for Parallel Calculations. Kiev. Nauka-Dumka, – 176 p. Monograph (in Russian).

Ermakov S.M., Nekrutkin V.V., Sipin A.S. 1989. Random Processes for Classical Equations of Mathematical Physics. Kluwer Academic Publication, London,

Ermakov S.M., Rasulov A.S., Bakoev M.T., Veselovskaya A.Z. 1992. Elective algorithms of Monte-Carlo method. Tashkent University, – 132 p.

Fesenko N. Convergence of block asynchronous process. 1981. Vestnik of Leningrad State University. ser.1, – P. 59–63.

Belectkiy V.N. 1988. Multiprocessors and parallel structures with organization of asynchronous calculations. Kiev. Nauka-Dumka, – 240 p.

Kantorovich L.V., Akilov G.P. 1977. Functional analysis. M.: Nauka. – 653 p.

Downloads

Published

2024-12-11

Issue

Section

Статьи