Performance predictions for parallel diagonal-implicitly iterated Runge-Kutta methods
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Aspects of a distributed solution of the Brusselator equation
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Parallel simulation of equation-based models on CUDA-enabled GPUs
Proceedings of the 9th Workshop on Parallel/High-Performance Object-Oriented Scientific Computing
Parallel modeling of transient states analysis in electrical circuits
PVM/MPI'05 Proceedings of the 12th European PVM/MPI users' group conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
| Hi-index | 0.00 |
In this article, we consider the iterated Runge-Kutta (IRK) method which is an iteration method based on a predictor-corrector scheme for the solution of ordinary differential equations. The method uses embedded formulae to control the stepsize. We present different algorithms of the IRK method on distributed memory multiprocessors using appropriate communication primitives. The theoretical performance analysis and a runtime simulation allow us to value the presented algorithms. An implementation on the Intel iPSC/860 confirms the predicted runtimes.