Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2509.21137

Help | Advanced Search

Computer Science > Distributed, Parallel, and Cluster Computing

arXiv:2509.21137 (cs)
[Submitted on 25 Sep 2025 ]

Title: From GPUs to RRAMs: Distributed In-Memory Primal-Dual Hybrid Gradient Method for Solving Large-Scale Linear Optimization Problem

Title: 从GPU到RRAM:用于解决大规模线性优化问题的分布式内存内原始对偶混合梯度方法

Authors:Huynh Q. N. Vo, Md Tawsif Rahman Chowdhury, Paritosh Ramanan, Gozde Tutuncuoglu, Junchi Yang, Feng Qiu, Murat Yildirim
Abstract: The exponential growth of computational workloads is surpassing the capabilities of conventional architectures, which are constrained by fundamental limits. In-memory computing (IMC) with RRAM provides a promising alternative by providing analog computations with significant gains in latency and energy use. However, existing algorithms developed for conventional architectures do not translate to IMC, particularly for constrained optimization problems where frequent matrix reprogramming remains cost-prohibitive for IMC applications. Here we present a distributed in-memory primal-dual hybrid gradient (PDHG) method, specifically co-designed for arrays of RRAM devices. Our approach minimizes costly write cycles, incorporates robustness against device non-idealities, and leverages a symmetric block-matrix formulation to unify operations across distributed crossbars. We integrate a physics-based simulation framework called MELISO+ to evaluate performance under realistic device conditions. Benchmarking against GPU-accelerated solvers on large-scale linear programs demonstrates that our RRAM-based solver achieves comparable accuracy with up to three orders of magnitude reductions in energy consumption and latency. These results demonstrate the first PDHG-based LP solver implemented on RRAMs, showcasing the transformative potential of algorithm-hardware co-design for solving large-scale optimization through distributed in-memory computing.
Abstract: 计算工作负载的指数增长正在超越传统架构的能力,这些架构受到基本限制的约束。 基于RRAM的存内计算(IMC)通过提供模拟计算,显著提高了延迟和能耗的效率,提供了有希望的替代方案。 然而,为传统架构开发的现有算法并不适用于IMC,特别是对于约束优化问题,频繁的矩阵重新编程对IMC应用来说成本过高。 在这里,我们提出了一种分布式存内原始对偶混合梯度(PDHG)方法,专门针对RRAM器件阵列进行协同设计。 我们的方法减少了昂贵的写入周期,增强了对器件非理想性的鲁棒性,并利用对称块矩阵公式在分布式交叉条中统一操作。 我们集成了一种基于物理的仿真框架MELISO+,以在现实设备条件下评估性能。 与大规模线性规划的GPU加速求解器进行基准测试表明,我们的RRAM求解器在能耗和延迟方面实现了高达三个数量级的减少,同时保持了相当的准确性。 这些结果展示了第一个基于PDHG的在线性规划求解器在RRAM上的实现,展示了算法-硬件协同设计在通过分布式存内计算解决大规模优化问题方面的变革潜力。
Comments: Main Article (12 Pages, 3 Figures), Appendix (4 Pages)
Subjects: Distributed, Parallel, and Cluster Computing (cs.DC) ; Hardware Architecture (cs.AR); Emerging Technologies (cs.ET)
Cite as: arXiv:2509.21137 [cs.DC]
  (or arXiv:2509.21137v1 [cs.DC] for this version)
  https://doi.org/10.48550/arXiv.2509.21137
arXiv-issued DOI via DataCite

Submission history

From: Md Tawsif Rahman Chowdhury [view email]
[v1] Thu, 25 Sep 2025 13:27:50 UTC (1,287 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs.AR
cs.DC
cs.ET

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号