meta(distributed): multi-node and multi-GPU execution — backend API, IGG halo, tests, slab adjoint
まだ誰も着手していません。
評価
- 難易度
- 5/5
- 見積もり時間
- 1週間以上
- 初心者へのやさしさ
- 25/100
- issue の種類
- 機能追加
- 明瞭さ
- 説明が足りない
- 活発さ
- 活発
- 技術スタック
- julia
調査の方向性
Start with sub-issue #47 and the existing _dist_scatter!/_dist_reduce! seam, then read #46, #30, and #77 to understand the backend, multi-node, test, and slab-adjoint work. Check test/multigpu and test/mdla_gpu.jl; done means the listed sub-issues are addressed while preserving transpose invariants, one halo exchange per application, prepare-time coefficient exchange, and no new core dependency.
索引モデルが issue の本文から書いたものです。
説明
Umbrella for everything that makes a CartesianGrid operator run across more than one device or node. MDLA (single-node multi-GPU, CUDA-only) is done behind the _dist_scatter! / _dist_reduce! seam; what remains is the API to choose a backend, the multi-node backend itself, and the tests that prove ≥3 partitions. The perf gap on the slab transpose (#77) is closed.
Status (2026-09-30): #77 done via PR #91; #30's fold-in no longer waits on #47/#46; one open DESIGN question on ghost layout (from #81).
Sub-issues, in order
- #47 — explicit backend selection (
AbstractDistributedBackend,MDLABackend,IGGBackend), mirroringAbstractJVPBackend. First: it is the entry point #46 must implement against, and today a second extension definingprepare_distributed(::AbstractOperator, ::Integer)would be ambiguous. - #46 — ImplicitGlobalGrid halo backend for multi-node. Carries the κ-ghost note from the PR #66 review (the IGG backend owes one setup-time exchange of the coefficient's
Interfaceghosts) and, from #52, the comm/compute overlap idea: launch the interior stencil, run_exchange_storage!concurrently, then finish the boundary strips. Overlap is not to be built before a blocking exchange is measured. - #30 — instantiate
test/multigpu(≥3-GPU distributed tests). Upstream blockers cleared; also lifts themin(NGPUS_MDLA, 2)caps intest/mdla_gpu.jl. Not gated on #47/#46: the fold-in exercises the existing MDLA backend only, so includingtest/multigpu/mdla_3partition.jlbehind the existingNGPUS_MP >= 3self-skip and lifting the caps can land in parallel with 1–2. - ~~#77 — slab
Diffusionadjoint runs the generic masked gather at ~5.7× the forward stencil. Becomes a per-iteration cost the moment distributed reverse-mode AD lands.~~ **Done** — PR #91 (interior stencil + ghost-plane gather for the slabDiffusionadjoint).
Open design question
- Ghost layout: inline padding vs. ghosts beside the interior (from #81's addendum, Q3). Should
Fieldkeep ghosts inline in a padded array, or store the interior contiguously with ghosts held in separate face buffers? Face buffers are what MPI wants regardless — inline ghosts have to be packed into them — and would let a solver vector alias the interior and fill faces in O(surface) instead of two O(volume) staging passes. The cost lands on operator bodies: inline ghosts are what let one broadcast over shifted slices be correct at every cell (the "leaf bodies stay array-level" rule), whereas ghosts-beside splits each sweep into an interior core plus up to 3ᴺ−1 boundary regions, per leaf, per BC kind, and again for every declared adjoint and AD path. The one existing data point islaplacian_7pt_noflux(DESIGN.md §4), a flat halo-free primitive kept as a separate body, pinned to homogeneous no-flux, and locked to the halo-based leaf by a parity test. Outcome: if inline is right, an alternatives-considered note in DESIGN.md so it stops resurfacing; if not, its own issue.
Invariants that bind every sub-issue
_dist_reduce!must remain the exact transpose of_dist_scatter!across ranks, including the∂/∂κscatter-add — this is the part with no equivalent in the IGG/ParallelStencil ecosystem.- One halo exchange per operator application; coefficient exchanges belong at
preparetime. - No new core dependency: MPI/IGG live in
ext/.
—
🤖 Claude struck #77 off this list with great satisfaction.
claude-opus-5-5[1m] (high) · claude-code 2.1.285 · unreviewed
- 主要言語
- Julia
- スター
- 3
- フォーク
- 1
- 平均マージ
- 4日 19時間
- マージ済み PR(30日)
- 5
環境構築
このプロジェクトには開発コンテナ、Dockerfile、コントリビューションガイドがありません。まず README を読み、一般的な手順ははじめてのコントリビューションガイドを参照してください。
はじめの一歩
- issue を最後まで読み、次にプロジェクトのコントリビューションガイドを読みます。
- 着手することを issue にコメントします — 二人が同じ作業をするのを防げます。
- リポジトリをフォークし、ブランチを切って変更します。
- issue 番号を参照したプルリクエストを送ります。
RallypointOne/MatrixFreeOperators.jl のほかの issue
-
難易度 4/5 3〜5日 初心者へのやさしさ 45/100
-
enhancement
難易度 4/5 3〜5日 初心者へのやさしさ 48/100
-
performance
難易度 5/5 1週間以上 初心者へのやさしさ 45/100
-
perf(forest): thread the reference BlockForest path — leaf sweeps and exchange descriptor loopsオープンperformance
難易度 4/5 3〜5日 初心者へのやさしさ 48/100
-
enhancement
難易度 5/5 1週間以上 初心者へのやさしさ 25/100
RallypointOne/MatrixFreeOperators.jl の issue をすべて見る
似ている issue
-
難易度 1/5 1時間未満 初心者へのやさしさ 62/100
SciML/DataDrivenDiffEq.jl#694 ·
-
難易度 2/5 1〜3時間 初心者へのやさしさ 76/100
JuliaLang/LinearAlgebra.jl#1834 ·
メンテナーはふだん 1 日以内に返信
-
`RawAcquisitionData(acqData)` writes the repetition into the `average` counter対応中かも このイシューにリンクされたプルリクエストがオープン中、またはマージ済みです。 オープン
難易度 2/5 1〜3時間 初心者へのやさしさ 82/100
MagneticResonanceImaging/MRIReco.jl#332 ·
メンテナーはふだん 1 日以内に返信
-
Docstrings show df:DataFrame and an undefined function is exported対応中かも このイシューにリンクされたプルリクエストがオープン中、またはマージ済みです。 オープン
難易度 2/5 1〜3時間 初心者へのやさしさ 85/100
-
難易度 2/5 1〜3時間 初心者へのやさしさ 65/100
メンテナーはふだん 1 日以内に返信