A systolic update scheme to overcome memory bandwidth limitations in GPU-accelerated FDTD simulations

The exponential growth of artificial intelligence has fueled the development of high-bandwidth photonic interconnect fabrics as a critical component of modern AI supercomputers. As the demand for ever-increasing AI compute and connectivity continues to grow, the need for high-throughput photonic simulation engines to accelerate and even revolutionize photonic design and verification workflows will become an increasingly indispensable capability for the integrated photonics industry. Unfortunately, the mainstay and workhorse of photonic simulation algorithms, the finite-difference time-domain (FDTD) method, because it is a memory-intensive but computationally-lightweight algorithm, is fundamentally misaligned with modern computational platforms which are equipped to deal with compute intensive workloads instead. This paper introduces a systolic update scheme for the FDTD method, which circumvents this mismatch by reducing the need for global synchronization while also relegating the need to access global memory to the case of boundary values between neighboring subdomains only. We demonstrate a practical implementation of our scheme as applied to the full three-dimensional FDTD algorithm that achieves a performance of roughly 0.15 trillion cell updates per second (TCUPS) on a single Nvidia H100 GPU. Our work paves the way for the increasingly efficient, cost-effective, and high-throughput photonic simulation engines needed to continue powering the AI era.

Publication Details

Journal
ArXiv.org
Published
2025-02-27
Primary Topic
Electromagnetic Simulation and Numerical Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A systolic update scheme to overcome memory bandwidth limitations in GPU-accelerated FDTD simulations

ArXiv.org
Electromagnetic Simulation and Numerical Methods
article

A systolic update scheme to overcome memory bandwidth limitations in GPU-accelerated FDTD simulations

article en

Abstract

The exponential growth of artificial intelligence has fueled the development of high-bandwidth photonic interconnect fabrics as a critical component of modern AI supercomputers. As the demand for ever-increasing AI compute and connectivity continues to grow, the need for high-throughput photonic simulation engines to accelerate and even revolutionize photonic design and verification workflows will become an increasingly indispensable capability for the integrated photonics industry. Unfortunately, the mainstay and workhorse of photonic simulation algorithms, the finite-difference time-domain (FDTD) method, because it is a memory-intensive but computationally-lightweight algorithm, is fundamentally misaligned with modern computational platforms which are equipped to deal with compute intensive workloads instead. This paper introduces a systolic update scheme for the FDTD method, which circumvents this mismatch by reducing the need for global synchronization while also relegating the need to access global memory to the case of boundary values between neighboring subdomains only. We demonstrate a practical implementation of our scheme as applied to the full three-dimensional FDTD algorithm that achieves a performance of roughly 0.15 trillion cell updates per second (TCUPS) on a single Nvidia H100 GPU. Our work paves the way for the increasingly efficient, cost-effective, and high-throughput photonic simulation engines needed to continue powering the AI era.

ArXiv.org
Industry, innovation and infrastructure
Openalex Percentile: Top 53%
Electromagnetic Simulation and Numerical Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.