Dynamic partitioning of the divide-and-conquer scheme with migration in PVM environment

Abstract

We present a new C++ framework which enables writing of divide-and-conquer (DaC) applications very easily which are then automatically parallelized by dynamic partitioning of the DaC tree and process migration. The solution is based on DAMPVM – the extension of PVM. The proposed system handles irregular applications and dynamically adapts the allocation to minimize execution time which is shown for numerical adaptive quadrature integration examples of two different functions.