Journal:Informatica
Volume 9, Issue 2 (1998), pp. 123–140
Abstract
In this paper we describe implementation of numerical adaptive algorithms for multi-dimensional quadrature on distributed-memory parallel systems. The algorithms are targeted at clusters of workstations with standard message passing interfaces, e.g., PVM or MPI. The most important issues are communication and load balancing. Static and dynamic partitioning of the region are considered. Numerical results on various workstation clusters are reported.
Journal:Informatica
Volume 7, Issue 3 (1996), pp. 295–310
Abstract
In this paper we consider the problem of solving 3D diffusion problems on distributed memory computers. We present a parallel algorithm that is suitable for the number of processors less or equal 8. The pipelining method is used to enlarge the number of processors till 64. The computational grid decomposition method is proposed for heterogenous clusters of workstations which preserves the load balancing of computers. The numerical results for two clusters of workstations are given.
Journal:Informatica
Volume 7, Issue 3 (1996), pp. 281–294
Abstract
This paper deals with load balancing of parallel algorithms for distributed-memory computers. The parallel versions of BLAS subroutines for matrix-vector product and LU factorization are considered. Two task partitioning algorithms are investigated and speed-ups are calculated. The cases of homogeneous and heterogeneous collections of computers/processors are studied, and special partitioning algorithms for heterogeneous workstation clusters are presented.