In the process of complex objects and systems design the graph and multiple models of their structures are widely applied. Representation of structure models in a form of binary trees is the most economical and optimal for a number of databases designing and creating tasks. Parallel reduction is one of the best methods of binary trees formation. The complexity assessment of basic formation procedure of the reduction binary tree for complex objects (especially with significantly irregular structure) results in О(n3), which causes problems in the process of solving the large dimension tasks, where n is the number of system elements. It is possible to reduce the task complexity artificially increasing parallelism of the reduction process. Several studies have revealed the possibility to reduce the task complexity assessment up to О(n2) without any loss of the result quality.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.