Sistemy i Sredstva Informatiki [Systems and Means of 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


Sistemy i Sredstva Inform.:
Year:
Volume:
Issue:
Page:
Find




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

Sistemy i Sredstva Informatiki [Systems and Means of Informatics], 2011, Volume 21, Issue 1, Pages 47–61 (Mi ssi233)  
Model of parallel round of work trees

V. A. Kozmidiady

IPI RAN
Full-text PDF (212 kB)
References:
PDF
HTML
Abstract: A mechanism is considered, summarizing MapReduce that is aimed at Massive parallel processing. Consideration is based on the fact that a common task forms the tree of works, difficult works are divided into parts up to the obtaining of simple works that can be executed in parallel. The mathematical model of work tree execution is proposed. The methods of round of such trees and their influence on common time of execution are considered.
Keywords: MapReduce; massive parallel processing; round of trees; work tree.
Document Type: Article
Language: Russian
Citation: V. A. Kozmidiady, “Model of parallel round of work trees”, Sistemy i Sredstva Inform., 21:1 (2011), 47–61
Citation in format AMSBIB
\Bibitem{Koz11}
\by V.~A.~Kozmidiady
\paper Model of parallel round of work trees
\jour Sistemy i Sredstva Inform.
\yr 2011
\vol 21
\issue 1
\pages 47--61
\mathnet{http://mi.mathnet.ru/ssi233}
Linking options:
  • https://www.mathnet.ru/eng/ssi233
  • https://www.mathnet.ru/eng/ssi/v21/i1/p47
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Системы и средства информатики
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024