-
Couldn't load subscription status.
- Fork 17
feat: [WIP] Find neighbourhood in MPI #295
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
base: master
Are you sure you want to change the base?
Conversation
|
At this point, the neighbourhood construction is working fine. |
|
At this point, I have an issue on Choleski with 32 ranks on advection-2d --min-level 4 or lower (the modified balanced case). This is because one cell is coarser than its subdomain. I don't think it is related to this PR anyway ... |
- Previously, in multirank MPI, m_cells was empty due to a bad n_cells per subdomains computation - Then I add a specific partitioning for 1D MPI : - We compute the number of cells in the original mesh - Each subdomain get a part of the nb_cells
- Not working FOR NOW - We need to reduce the neighbourhood size. Then, we need to construct it based on each subdomain - We construct a first extended nogihbourhood to get all the potential intersection - And then we intersect each subdomain - **BUT**, we need a kind of "expand" feature. - This expand allows us to detect neighbourhood - Nevertheless, maybe a expand of one is not enough.
- Previsouly, we use per-level ghost-and-cells - It is not the right method, we need to use subdomain mehs - Then we use translation to operate as an "expand"
- This is not really beautiful, it needs more work - Todo : - arbitrary nD - create a new special function
- Now we have a dedicated function to find neighbourhood
- We can use constexrp here.
b7951aa to
e0c1237
Compare
WIP do not merge, it is for CI testing.