Accelerating Sparse Linear Solvers with an Optical Laser Processing Unit
Dan Gluck, Yotam Mimran, Andrey Karenskih, Talya Vaknin, Omri Wolf, Ruti Ben-Shlomi, Johannes Gebert

TL;DR
This paper investigates the use of an optical laser processing unit (LPU) to accelerate the solution of large, sparse linear systems, demonstrating potential advantages over traditional digital methods in speed and energy efficiency.
Contribution
It introduces a novel optical computing architecture for solving linear systems, mapping general matrices onto the LPU, and benchmarks its performance against GPU-based methods.
Findings
LPU can achieve lower time-to-solution for certain sparse matrices.
Optical processing offers advantages in latency, parallelism, and energy efficiency.
Benchmarking shows promising results compared to Krylov subspace methods.
Abstract
Solving large, sparse linear systems is a fundamental workload in scientific computing and engineering simulations, often dominating runtime and energy consumption in high-performance computing (HPC) applications. In this work, we explore an alternative computing paradigm based on analog optical processing, implemented through the Laser Processing Unit (LPU). The LPU encodes linear systems into the dynamics of coupled lasers within an optical cavity, where the steady-state phases of the optical fields correspond to the solution of . We present a mapping of general linear systems, both dense and sparse, onto the LPU architecture and evaluate its performance using representative matrices from the SuiteSparse collection. Using an LPU emulator, we benchmark convergence behavior and time-to-solution for sparse, multi-banded matrices against established Krylov subspace methods (CG,…
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.
