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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
