Vestnik of Astrakhan State Technical University. Series: Management, Computer Sciences and Informatics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestn. Astrakhan State Technical Univ. Ser. Management, Computer Sciences and Informatics:
Year:
Volume:
Issue:
Page:
Find






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


Vestnik of Astrakhan State Technical University. Series: Management, Computer Sciences and Informatics, 2017, Number 4, Pages 31–38
DOI: https://doi.org/10.24143/2072-9502-2017-4-31-38
(Mi vagtu503)
 

COMPUTER SOFTWARE AND COMPUTING EQUIPMENT

Developing algorithm for partitioning tasks into subtasks in the systems of distributed data processing

V. V. Lukashenko, V. A. Romanchuk

Ryazan State University named after S. A. Yesenin
References:
Abstract: In terms of the problem of insufficient computational resources for a number of tasks, realization of computational cluster of neurocomputers is being considered as a variant. To implement the basic principle of distributed computing, there has been presented an algorithm for splitting the tasks entering the computational cluster of neurocomputers into sub-tasks. For this purpose, the program introduced into the cluster is suggested to present for execution in the modified postfix Polish record and to store it in the program command stack. To modify the program Polish notation should include different, non-arithmetic, operators and constructions. The next step is to get an abstract syntax tree of the program, following the rules for translating the modified postfix Polish record from the command stack into an abstract syntax tree. Then, the data should be sent to the abstract syntax tree of the program taking into account their bit depth, and to obtain the contiguity matrix of the program control flow graph that will display the set of all ways of program execution. The authors come to the conclusion that all operations recorded in the modified reverse Polish record presented in the form of an abstract syntax tree when data of a certain bit depth are transmitted to them, at the moment of transition to the program control flow graph executed in a single clock cycle are indivisible operations and can be represented as subprograms of the source program, which was submitted for processing to the computer cluster of neurocomputers.
Keywords: distributed computing, cluster computing, neurocomputers, clustering of computing resources, modified Polish notation, abstract syntactic tree.
Received: 30.05.2017
Document Type: Article
UDC: 004.383.3
Language: Russian
Citation: V. V. Lukashenko, V. A. Romanchuk, “Developing algorithm for partitioning tasks into subtasks in the systems of distributed data processing”, Vestn. Astrakhan State Technical Univ. Ser. Management, Computer Sciences and Informatics, 2017, no. 4, 31–38
Citation in format AMSBIB
\Bibitem{LukRom17}
\by V.~V.~Lukashenko, V.~A.~Romanchuk
\paper Developing algorithm for partitioning tasks into subtasks in the systems of distributed data processing
\jour Vestn. Astrakhan State Technical Univ. Ser. Management, Computer Sciences and Informatics
\yr 2017
\issue 4
\pages 31--38
\mathnet{http://mi.mathnet.ru/vagtu503}
\crossref{https://doi.org/10.24143/2072-9502-2017-4-31-38}
Linking options:
  • https://www.mathnet.ru/eng/vagtu503
  • https://www.mathnet.ru/eng/vagtu/y2017/i4/p31
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Вестник Астраханского государственного технического университета. Серия: Управление, вычислительная техника и информатика
    Statistics & downloads:
    Abstract page:64
    Full-text PDF :29
    References:20
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024