|
Informatika i Ee Primeneniya [Informatics and its Applications], 2011, Volume 5, Issue 2, Pages 90–99
(Mi ia149)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Work tree andmassively parallel processing
V. A. Kozmidiady Institute for Problems of Informatics RAS
Abstract:
A mechanism is considered, summarizing MapReduce. A special attention is paid to the methods of distribution of works for concurrent execution. It is assumed that simple works form a tree and there is a coordinator who is responsible for the division of complex works. Workers execute simple works only. It appears that on the order of tree of traversal works substantially depends complexity of renewals after the refuse of site. Main attention is paid to the methods of tree traversal operation.
Keywords:
MapReduce; Massive parallel processing; tree of traversals; work tree; fault-tolerant.
Citation:
V. A. Kozmidiady, “Work tree andmassively parallel processing”, Inform. Primen., 5:2 (2011), 90–99
Linking options:
https://www.mathnet.ru/eng/ia149 https://www.mathnet.ru/eng/ia/v5/i2/p90
|
Statistics & downloads: |
Abstract page: | 314 | Full-text PDF : | 86 | References: | 39 | First page: | 4 |
|