Memory and Algorithmic Constraints of GPUs in Diffraction Data Processing
Zbyszek Otwinowski, Raquel Bromberg

TL;DR
This paper discusses the challenges and opportunities of using GPUs for diffraction data processing, emphasizing algorithm redesign and memory constraints.
Contribution
The paper introduces new GPU-oriented algorithms and libraries to better leverage GPU capabilities in diffraction data analysis.
Findings
Diffraction data analysis can benefit from GPU acceleration but requires algorithm redesign to overcome serial dependencies.
GPU-based FFTs and intuitive coordinate systems can streamline computational code development for diffraction data.
Grid-based parallelism on GPUs allows efficient handling of hundreds of thousands of simultaneous threads.
Abstract
GPUs offer significant potential for accelerating diffraction data processing leading to potential speed-ups of up to 10,000-fold. However, achieving this potential is substantially limited by the extensive effort required to redesign algorithms so that they are optimized for GPU architectures. Diffraction data analysis inherently lends itself to vectorization, yet existing data structures frequently introduce serial dependencies incompatible with the parallel architecture of GPUs, severely diminishing computational efficiency. Historically, diffraction data algorithms development was heavily influenced by memory constraints, as memory-efficient algorithms often performed better and were faster on CPUs. Transitioning to GPUs introduces distinct challenges, notably designing computations around two- or three-dimensional grids, wherein each grid point's calculation is handled…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptical Polarization and Ellipsometry
