Abstract
The paper analyzes the actual problem of architecture-dependent decomposition, allowing efficient planning of running a parallel task in a multiprocessor computer network. The procedure of planning means decomposition of a parallel task in a required number of processors accounting for balance restrictions and mapping of obtained portions to processors in order to minimize interprocessor communication costs. This procedure allows to reduce parallel program execution time and consequently expensive hardware usage time. The paper provides general mathematical formulation of this problem, and special cases are considered. Multilevel algorithms are suggested for a special and a general case of the problem. Results of experiments in well-known benchmarks as compared to renowned software METIS and SCOTCH.
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.
