(24) * << * >> * Russian * English * Content * All Issues

Application of the method of counter runs for the synthesis of a parallel algorithm for solving grid equations of tridiagonal type

D.L. Golovashkin1,2
1Image Processing Systems Institute of RAS
2Samara State Aerospace University

 PDF, 687 kB

Pages: 33 - 39.

Abstract:
The article is devoted to the synthesis and analysis of parallel algorithms (with local communication) for solving grid equations of tridiagonal type. An optimal algorithm in terms of communication time, idle time and memory footprint has been developed in this class of algorithms. The article presents an experimental technique for increasing the acceleration of a parallel calculation process generated by the optimal algorithm.

Keywords:
grid equation, parallel algorithm, parallel calculation, optimal algorithm.

Citation:
Golovashkin D.L. Application of the method of counter runs for the synthesis of a parallel algorithm for solving grid equations of tridiagonal type. Computer Optics 2002; 24: 33-39.

References:
  1. Yanenko NN, Konovalov AN, Bugrov AN, Shustov GV. On the organization of parallel computing and parallelizing sweeps [In Russian]. Computational Methods of Continuum Mechanics; 1978; 9(7): 139-146. 
  2. Braunl T. The art of parallel programming. Prentice Hall International (UK) Limited; 1993. 
  3. Ortega JM. Introduction to parallel and vector solution of linear systems. New York: Springer Science+Business Media LLC; 1988. 
  4. Mirenkov NN. Parallel algorithms for solving problems on homogeneous computer systems [In Russian]. Vychisliteljnye Sistemy 1973; 57: 3-32. 
  5. Samarskii AA, Nikolaev ES. Numerical methods for grid equations. Vol I: Direct Methods, and Vol II: Iterative Methods. Basel: Birkhauser Verlag; 1989. 
  6. Samarsky AA. The theory of difference schemes. New York: Marcel Dekker Inc; 2001.

© 2009, IPSI RAS
151, Molodogvardeiskaya str., Samara, 443001, Russia; E-mail: journal@computeroptics.ru ; Tel: +7 (846) 242-41-24 (Executive secretary), +7 (846) 332-56-22 (Issuing editor), Fax: +7 (846) 332-56-20