← Thursday, October 8, 2026Performance & OSBenchmark
Multi-GPU mPDLP reaches 11.4× speedup on the largest tested linear programs
Benchmarks on DGX B200 GPUs show up to 11.4× speedup on PDLP steps and 1.2×–2.5× on most large instances; min-cut partitioning reduces cross-GPU communication. The results help engineers assess when distributing sparse optimization workloads across GPUs pays off.
- What
- NVIDIA cuOpt’s mPDLP solver distributes large linear programs across NVLink-connected GPUs.
- How
- Min-cut partitioning reduces edge cuts in a bipartite dependency graph to limit cross-GPU communication during sparse matrix-vector multiplications.
- Why it matters
- Multi-GPU execution targets problems that exceed a single GPU’s memory or take too long, allowing teams to tackle larger planning models.
Read on developer.nvidia.com →
Discussion
Discussion is not switched on yet. Use Note above to keep your own thoughts on this story.
Headline, summary, brief and diagram are written by a model from the source's own text; the link, byline and numbers come from the source. Read the original before relying on a claim.