This paper describes the performance of a multigrid method implemented on a transputer-based architecture. We show that the combination of fast floating-pointhardware, local memory and fast communication links between processors provide an excellent environment for the parallel implementation of multigrid algorithms. The gain in efficiency obtained by increasing the number of processors is shown to be nearly linear and comparisons are made with published figures for a parallel multigrid Poisson solver on an Intel iPSC 32-node hypercube.
We investigate the use of the processor virtualization technique in parallelizing the multigrid algo...
A SUPRENUM system consists of many independent processors connected by a hierarchical bus system. Ap...
We present an implementation of a finite-difference approximation for the solution of partial differ...
This paper describes the performance of a multigrid method implemented on a transputer-based archite...
The halfsweep multigrid algorithm, introduced by Othman et al in 1998 for solving a linear system, i...
The halfsweep multigrid algorithm, introduced by Othman et al in 1998 for solving a linear system, i...
Abstract: Making multigrid algorithms run efficiently on large parallel computers is a challenge. Wi...
The halfsweep multigrid algorithm, introduced by Othman et al in 1998 for solving a linear system, i...
The multigrid algorithm is a fast and efficient (in fact provably optimal) method for solving a wide...
The problem of finding the solution of partial differential equations (PDEs) plays a central role in...
AbstractThe problem of finding the solution of partial differential equations (PDEs) plays a central...
We consider the numerical solution of the stationary incompressible Navier-Stokes equations for a wi...
The scalable implementation of multigrid methods for machines with several thousands of processors i...
We study the potential performance of multigrid algorithms running on massively parallel computers w...
The paper considers the parallel implementation of an algebraic multigrid method. The sequential ver...
We investigate the use of the processor virtualization technique in parallelizing the multigrid algo...
A SUPRENUM system consists of many independent processors connected by a hierarchical bus system. Ap...
We present an implementation of a finite-difference approximation for the solution of partial differ...
This paper describes the performance of a multigrid method implemented on a transputer-based archite...
The halfsweep multigrid algorithm, introduced by Othman et al in 1998 for solving a linear system, i...
The halfsweep multigrid algorithm, introduced by Othman et al in 1998 for solving a linear system, i...
Abstract: Making multigrid algorithms run efficiently on large parallel computers is a challenge. Wi...
The halfsweep multigrid algorithm, introduced by Othman et al in 1998 for solving a linear system, i...
The multigrid algorithm is a fast and efficient (in fact provably optimal) method for solving a wide...
The problem of finding the solution of partial differential equations (PDEs) plays a central role in...
AbstractThe problem of finding the solution of partial differential equations (PDEs) plays a central...
We consider the numerical solution of the stationary incompressible Navier-Stokes equations for a wi...
The scalable implementation of multigrid methods for machines with several thousands of processors i...
We study the potential performance of multigrid algorithms running on massively parallel computers w...
The paper considers the parallel implementation of an algebraic multigrid method. The sequential ver...
We investigate the use of the processor virtualization technique in parallelizing the multigrid algo...
A SUPRENUM system consists of many independent processors connected by a hierarchical bus system. Ap...
We present an implementation of a finite-difference approximation for the solution of partial differ...