Model of parallel round of work trees

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.