-
-
Notifications
You must be signed in to change notification settings - Fork 11
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Performance of partitioning and joining #179
Comments
For partitioning, I still recommend keeping the implementation in C++. The naming convention in the |
@davidscn I might have a chance to stitch my prototypes for partitioning as well in the coming days. Would you give an insight about the |
We have
precice-aste-partition
andprecice-aste-join
as part of the toolchain to partition/join mesh files. However, for a large core count or large mesh files, their python implementation is rather slow. A canonical alternative to investigate here is Julia as programming language, as the interface/implementation could be considered similar while gaining performance upgrades. However, as of now, the Julia wrapping of the VTK libraries is not flexible enough for such purposes. Instead of one VTK package (python), there are two packages available in Julia, ReadVTK and WriteVTK. Reading VTK files comes with a few constraints (see also the what does not work section of the docs):both constraints don't apply to our current 'frequently used' mapping meshes and are also not compatible with
precice-aste-evaluate
, which would then also require a porting to Julia. Reading the files is mostly compatible with the corresponding VTK writer. It could become a valid approach though, once the reader becomes more general.For the joining part, there is still an open PR which features a C++ implementation #156
The text was updated successfully, but these errors were encountered: