Execution schemes for parallel adams methods

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Many recent solvers for ordinary differential equations (ODEs) have been designed with an additional potential of method parallelism, but the actual effectiveness of exploiting method parallelism depends on the specific communication and computation requirements induced by the equation to be solved. In this paper we study mixed parallel execution schemes for specific (explicit and implicit) variants of general linear methods, the Parallel Adams-Bashforth methods and the Parallel Adams-Moulton methods, which are new methods providing additional method parallelism. The implementations are realized with a library for multiprocessor task programming. Experiments on a Cray T3E and a dual Xeon cluster show good efficiency results, also for sparse application problems. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Rauber, T., & Rünger, G. (2004). Execution schemes for parallel adams methods. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3149, 708–717. https://doi.org/10.1007/978-3-540-27866-5_93

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free