A heat-diffusion simulation of a metal plate updates a binary64 field on a grid using…
PHYSICS · Multi-part · Fermi University Physics · Computational Physics · High-performance and data-driven computational physics · High-performance and data-driven computational physics
Scientific Computing for Physicists, Ch Graphics processors: kernels, memory and the roofline
Problem
A heat-diffusion simulation of a metal plate updates a binary64 field on a 6144×6144 grid using two buffers, so that each step moves the perfect-reuse minimum of 16B per cell update. The run is ported to a GPU whose measured triad bandwidth is 900GBs−1; the host and device are connected by a PCIe 3.0 bus with peak bandwidth 16GBs−1. Every k steps the whole field is copied to the host and back (a round trip) for a checkpoint; between round trips the field stays resident on the device.
((a)) Write the fraction of the total wall time spent on this round-trip transfer as a function of k, the round-trip transfer time Tx and the one-step device time tstep, defining every symbol used.
((b)) Evaluate Tx and tstep for this grid and this device.
((c)) Find the least integer k for which the transfer's share of the wall time falls below 5%.