Multilevel procedure for decomposition and mapping graphs

Abstract

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.