The comparing analysis of two parallelization schemes for computations with round memory

Abstract

In this paper, we consider a tree-like recursion procedure of solving of binary decomposable problems. More specifically, we study some questions of parallelization of this procedure with using of shared round memory. We consider two parallelization schemes for parallel solving of binary decomposable problems by tree-like recursion procedures on a parallel computing system with shared round memory. We call these schemes the TAN-scheme and the TON-scheme of parallelization. We compare the efficiency of these schemes, using different parameters of parallelization. Based on this comparative analysis, we conclude the TON-scheme to be more effective.