.png){kind=icon}
Return
A PARALLEL ALGORITHM TO SOLVE LARGE STIFF ODE SYSTEMS ON GRID SYSTEMS
.png){kind=icon}
PRE
AI
DOI：10.1177/1094342009104010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces a parallel algorithm to solve large stiff ODE systems on distributed clusters, with computing nodes geographically distant from each other. This algorithm is based on the waveform relaxation method coupled with a sequential solver for differential equations systems. With respect to the standard PVODE algorithm (Parallel Variable-coefficient Ordinary Differential Equations solver; Byrne, George, and Hindmars 1999), it drastically reduces the number of messages exchanged between nodes which makes it less sensitive to slow communications. Thus, it is a coarse-grained algorithm well suited for grid environments connected via high latency networks. In this paper, we present various experiments which compare the PVODE solver and our algorithm and which show the benefits brought by this work.
Keywords:
waveform relaxation
parallel algorithms
heterogeneous distributed clusters
ODE
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.1K
Citations:
1.3K
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveFunctionalization and antioxidant activity of polyaniline–fullerene hybrid nanomaterials: a theoretical investigation.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAIShareSave no more
no more