AbstractMultiprocessor systems offer large gains in performance if algorithms for real problems can be found. We show how one algorithm for solving time dependent partial differential equations, local uniform mesh refinement, can be implemented on a multiprocessor system. Care is taken to insure that communications costs are kept under control, and an estimate of the performance of this algorithm for a range of configurations is presented. Experiments on a multiprocessor system are compared with the theory
In this thesis we propose a new algorithm for solving PDEs on massively parallel computers. The Nest...
Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are pro...
We studyscalable parallel computational geometry algorithms for the coarse grained multicomputer mod...
AbstractMultiprocessor systems offer large gains in performance if algorithms for real problems can ...
Efficient solution of partial differential equations require a match between the algorithm and the t...
Efficient solution of partial differential equations require a match between the algorithm and the t...
This paper describes the use of a parallel computer system in applying a finite difference method to...
We present an implementation of a finite-difference approximation for the solution of partial differ...
In this paper, we discuss some of the issues in obtaining high performance for block-structured adap...
Abstract: Making multigrid algorithms run efficiently on large parallel computers is a challenge. Wi...
The partitioning of a problem on a domain with unequal work estimates in different subddomains is co...
This paper describes the performance of a multigrid method implemented on a transputer-based archite...
We study the potential performance of multigrid algorithms running on massively parallel computers w...
The solution of elliptic partial differential equations is a common performance bottleneck in scient...
Computer simulations that solve partial differential equations (PDEs) are common in many fields of s...
In this thesis we propose a new algorithm for solving PDEs on massively parallel computers. The Nest...
Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are pro...
We studyscalable parallel computational geometry algorithms for the coarse grained multicomputer mod...
AbstractMultiprocessor systems offer large gains in performance if algorithms for real problems can ...
Efficient solution of partial differential equations require a match between the algorithm and the t...
Efficient solution of partial differential equations require a match between the algorithm and the t...
This paper describes the use of a parallel computer system in applying a finite difference method to...
We present an implementation of a finite-difference approximation for the solution of partial differ...
In this paper, we discuss some of the issues in obtaining high performance for block-structured adap...
Abstract: Making multigrid algorithms run efficiently on large parallel computers is a challenge. Wi...
The partitioning of a problem on a domain with unequal work estimates in different subddomains is co...
This paper describes the performance of a multigrid method implemented on a transputer-based archite...
We study the potential performance of multigrid algorithms running on massively parallel computers w...
The solution of elliptic partial differential equations is a common performance bottleneck in scient...
Computer simulations that solve partial differential equations (PDEs) are common in many fields of s...
In this thesis we propose a new algorithm for solving PDEs on massively parallel computers. The Nest...
Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are pro...
We studyscalable parallel computational geometry algorithms for the coarse grained multicomputer mod...