AI & ML
Concurrent Use of FP32 and FP64 Computing Units on GPUs and Mixed-Precision Placement in WENO Reconstruction
arXiv cs.DC0 views
arXiv:2611.09651v1 Announce Type: new Abstract: Scientific computing often requires FP64 arithmetic, although FP64 performance is limited on NVIDIA GPUs. Double-float (DF) emulation, which represents a value using two FP32 values with about 48 bits of significand, outperforms native FP64 where FP64 units are limited. On the other hand, mixed-precision strategies offload to FP32 the operations that do not determine accuracy. In both approaches, the native FP64 units remain idle during FP32 instruction execution. We investigated whether this idle resource can be recovered on A100, GH200, GB200, and RTX PRO 6000 Blackwell Max-Q. A microbenchmark shows that co-resident FP32 and native-FP64 kernels exceed the throughput of the faster kernel alone on A100 but not on GH200 and GB200; on RTX 6000 Blackwell, they do so against FFMA but, against DF emulation, only when the issue density of the DF kernel is reduced. We then tested whether this gain carries over to computing the WENO-Z reconstruction with the nonlinear weights in FP32 and the candidate polynomials in native FP64 (W32P64). We observe substantial overlap on A100, whereas GH200, GB200, and RTX 6000 Blackwell show little overlap. Importantly, the fastest placement does not always preserve the design accuracy of WENO-Z: for a one-dimensional entropy wave problem, W32P64 fails to achieve the design order of accuracy for WENO7 and WENO9. In contrast, DF emulation of the entire reconstruction comes close to it on the grids tested for WENO5, WENO7, and WENO9 while delivering a $2.51-3.94 \times$ speedup over FP64 on RTX 6000 Blackwell. For WENO5 on the two-dimensional Euler vortex problem the W32P64 error at $n=256$ is $1.26 \times$ that of FP64 and 1/104 of that of the all-FP32 reconstruction.
Source:https://arxiv.org/abs/2611.09651PreviousFast and Actionable Classification of HPC I/O Time SeriesNextMeshRT: Compile-Time Governed Wafer-Scale Runtime for Low-Latency High-Throughput Inference
Related posts
A small business running 8 projects on Claude Code for 30 days: rules ignored, projects crossing into each other, and what finally helped
0dev.to AI
L'IA trouve les peptides, la VR les révèle : pourquoi Antigravity change la donne pour la découverte de médicaments
0dev.to AI
Why Tesseract Fails on Cursive Handwriting (And How We Built a Two-Tier Vision Pipeline in Node.js)
0dev.to AI
OFX looks like XML. It isn't, and QuickBooks will reject it
0dev.to WebDev
Before You Buy GEO Monitoring Software, Build a 50-Line Baseline
0dev.to Python
Building Self-Improving AI Models Without Blinding Yourself to Failure
0dev.to Python