Vestnik Yuzhno-Ural'skogo Universiteta. Seriya Matematicheskoe Modelirovanie i Programmirovanie
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestnik YuUrGU. Ser. Mat. Model. Progr.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestnik YuUrGU. Ser. Mat. Model. Progr., 2020, Volume 13, Issue 3, Pages 59–67 (Mi vyuru557)  

This article is cited in 1 scientific paper (total in 1 paper)

Programming & Computer Software

Parallelization of recurrent loops due to the preliminary computation of superpositions

O. B. Shteinberg

South Federal University, Rostov-on-Don, Russian Federation

Abstract: As a rule, sections of code that take a lot of time to compute are loops. Therefore, it is precisely on them that special efforts are directed when accelerating programs, in particular, through parallelization.
The article describes the parallelization algorithm for loops calculating the elements of a recursively given sequence. The recurrent loops considered in the article cannot be directly parallelized. With the help of auxiliary transformations, they can sometimes be reduced to loops that allow parallel execution. Earlier, the author of the article published another algorithm for parallelizing loops that calculate the elements of a recursively given sequence.
In modern processors, the execution time of arithmetic operations is an order of magnitude faster than reading the arguments of these operations from RAM. This article provides estimates of the complexity of accessing memory for the described algorithm. The parallel algorithm presented in the article is more efficient in accessing memory than the algorithm described by the author earlier.

Keywords: recurrent loops, numerical methods, parallel computation, program transformations, recurrent sequences.

Funding Agency Grant Number
Ministry of Science and Higher Education of the Russian Federation 075-15-2019-1928


DOI: https://doi.org/~10.14529/mmp200305

Full text: PDF file (219 kB)
References: PDF file   HTML file

UDC: 510.57
MSC: 68W10
Received: 07.03.2020

Citation: O. B. Shteinberg, “Parallelization of recurrent loops due to the preliminary computation of superpositions”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 13:3 (2020), 59–67

Citation in format AMSBIB
\Bibitem{Sht20}
\by O.~B.~Shteinberg
\paper Parallelization of recurrent loops due to the preliminary computation of superpositions
\jour Vestnik YuUrGU. Ser. Mat. Model. Progr.
\yr 2020
\vol 13
\issue 3
\pages 59--67
\mathnet{http://mi.mathnet.ru/vyuru557}


Linking options:
  • http://mi.mathnet.ru/eng/vyuru557
  • http://mi.mathnet.ru/eng/vyuru/v13/i3/p59

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. B. Ya. Shteinberg, A. A. Vasilenko, V. V. Veselovskii, N. A. Zhivykh, “Reshateli SLAU s blochno-lentochnymi matritsami”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 14:3 (2021), 106–112  mathnet  crossref
  • Number of views:
    This page:22
    Full text:12
    References:1

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022