Metraipolis › archive › dc_82dbc4e0a910

MCHA: A Memory-Centric Hierarchical Architecture for Parallel-Sequential Computing — arXiv:2608.04443

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.04443
License (as archived)
CC0-1.0
Archived
2026-10-31T11:11:34.202Z
SHA-256 of the archived text
7dc19d2664fa755e3c28581c6603bb1c2207fa4c3b0805f3164424ad80ab263b
Stable URL of this page
https://metraipolis.com/documento/dc_82dbc4e0a910

How to cite

MCHA: A Memory-Centric Hierarchical Architecture for Parallel-Sequential Computing — arXiv:2608.04443 — arXiv (en), https://arxiv.org/abs/2608.04443 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_82dbc4e0a910 (Metraipolis archive dc_82dbc4e0a910, sha256 7dc19d2664fa755e3c28581c6603bb1c2207fa4c3b0805f3164424ad80ab263b)
BibTeX
@misc{dc82dbc4e0a910,
  title = {MCHA: A Memory-Centric Hierarchical Architecture for Parallel-Sequential Computing — arXiv:2608.04443},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.04443},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_82dbc4e0a910; sha256 7dc19d2664fa755e3c28581c6603bb1c2207fa4c3b0805f3164424ad80ab263b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04443. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Emerging workloads, such as Multi-Agent Reinforcement Learning (MARL), large-scale neuromorphic computing, and probabilistic graphical models, intrinsically exhibit parallel-sequential computing patterns. While these tasks demand massive parallelism to achieve high throughput, they are severely bottlenecked by irregular data access patterns centralized to main memory. Consequently, conventional architectures face fundamental limitations when executing these workloads, primarily manifesting as global buffer saturation and memory-bound bottlenecks. To address these challenges, we propose the Memory-Centric Hierarchical Architecture (MCHA), a reconfigurable hardware solution tailored for parallel-sequential execution. MCHA leverages a hierarchical communication strategy that facilitates distributed, inter-core data routing, thereby significantly reducing the bandwidth burden on the global memory. Complementing the hardware, MCHA introduces a novel parallel-sequential programming model that utilizes event-driven conditional triggers to effectively hide data transmission latency within the execution pipeline. We benchmark MCHA against a diverse suite of parallel-sequential tasks, including MARL, motor variable control, and Markov random fields. Validated through our open-source, cycle-accurate simulator, MCHA demonstrates performance speedups ranging from 153.06$\times$ to 2456.96$\times$ over NVIDIA A100 GPUs on MARL workloads, while maintaining robust programming flexibility across other application domains. Furthermore, the architecture successfully reduces main memory access from 96% to 5.44%. When synthesized in a 28 nm process, the MCHA implementation occupies an area footprint of 2.92mm$^2$ and consumes 115.36 mW of power at 200 MHz. MCHA is open-sourced at this https URL .

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-06 in cs.MA).
Categorie arXiv: Hardware Architecture (cs.AR) ; Distributed, Parallel, and Cluster Computing (cs.DC); Multiagent Systems (cs.MA).
Pagina del lavoro: https://arxiv.org/abs/2608.04443 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T11:00:35.638Z dalla pagina https://arxiv.org/catchup/cs.MA/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).