Menu: Home :: go to Journal :: switch to Russian :: switch to English
You are here: all Journals and Issues→ Journal→ Issue→ Article

ABOUT EFFECTIVE METHODS OF PARALLELIZING BLOCK RECURSIVE ALGORITHMS

Annotation

We describe an algorithm for the decentralized control of parallel computing process which is based on the SPMD computational paradigm and present the results of experiments on a cluster «MVS-100K».

Keywords

Adjoint; система Mathpar; MPI; hybrid parallel programming model; C++; GMP; parallel algorithm; decentralized control; Adjugate matrix; the system Mathpar; SPMD computational paradigm; MPI; multithreading; hybrid parallel programming model; C++; GMP

Full-text in one file

Download

UDC

519.6

Pages

1173-1186

References

1. Strassen V. Gaussian Elimination is not optimal. Numerische Mathematik. 1969. V. 13. P. 354-356. 2. Malashonok G.I. Matrichnye metody vychisleniy v kommutativnykh kol'tsakh. Tambov: Izd-vo Tambovskogo universiteta, 2002. 3. Malaschonok G.I. O vychislenii yadra operatora deystvuyushchego v module // Vestnik Tambovskogo universiteta. Seriya Estestvennye i tekhnicheskie nauki. Tambov, 2008. T. 13. Vyp. 1. S. 129-131. 4. Malaschonok G., Ilchenko E. Decentralized control of parallel computing // International conference Polynomial Computer Algebra. St. Petersburg, PDMI RAS, 2012. P. 57-58. 5. Betin A.A. Eksperimenty s parallel'nym algoritmom vychisleniya prisoedinennoy matritsy i parallel'nym umnozheniem faylovykh matrits // Vestnik Tambovskogo universiteta. Seriya Estestvennye i tekhnicheskie nauki. Tambov, 2010. T. 15. Vyp. 1. S. 341-345. 6. Betin A.A. Eksperimenty s parallel'nym algoritmom vychisleniya prisoedinennoy matritsy // Vestnik Tambovskogo universiteta. Seriya Estestvennye i tekhnicheskie nauki. Tambov, 2010. T. 15. Vyp. 6. S. 1748-1754. 7. Malashonok G.I. Komp'yuternaya matematika dlya vychislitel'noy seti // Vestnik Tambovskogo universiteta. Seriya Estestvennye i tekhnicheskie nauki. Tambov, 2010. T. 15. Vyp. 1. S. 322-327. 8. Malashonok G.I. Upravlenie parallel'nym vychislitel'nym protsessom // Vestnik Tambovskogo universiteta. Seriya Estestvennye i tekhnicheskie nauki. Tambov, 2009. T. 14. Vyp. 1. S. 269-274. 9. Malashonok G.I., Valeev Yu.D. Organizatsiya parallel'nykh vychisleniy v rekursivnykh simvol'no-chislennykh algoritmakh // Trudy konferentsii PaVT’2008 (Sankt-Peterburg). Chelyabinsk: Izd-vo YuUrGU, 2008. S. 153-165. 10. G.I. Malashonok, Yu.D. Valeev. Rekursivnoe rasparallelivanie simvol'no-chislennykh algoritmov // Vestnik Tambovskogo universiteta. Seriya Estestvennye i tekhnicheskie nauki. Tambov, 2006. T. 11. Vyp. 4. S. 536-549. 11. Malashonok G.I., Valeev Yu.D. Dinamicheskoe raspredelenie zadaniy v vychislitel'nom klastere po grafu algoritma // 11 Derzhavinskie chteniya. Tezisy dokladov. Tambov: Izd-vo TGU im. G.R. Derzhavina, 2006. S. 38-47. 12. G.I. Malashonok, Yu.D. Valeev. O nekotorykh podkhodakh k postroeniyu parallel'nykh programm // Vestnik Tambovskogo universiteta. Seriya Estestvennye i tekhnicheskie nauki. Tambov, 2005. T. 10. Vyp. 1. S. 154-156. 13. Malaschonok G.I. Effective Matrix Methods in Commutative Domains // Formal Power Series and Algebraic Combinatorics. Berlin: Springer, 2000. P. 506-517.

Received

2015-06-01

Section of issue

Scientific articles

Для корректной работы сайта используйте один из современных браузеров. Например, Firefox 55, Chrome 60 или более новые.