RoMe: Row Granularity Access Memory System for Large Language Models

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Nam, Hwayong, Baek, Seungmin, Kim, Jumin, Kim, Michael Jaemin, Ahn, Jung Ho
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912740821434368
author Nam, Hwayong
Baek, Seungmin
Kim, Jumin
Kim, Michael Jaemin
Ahn, Jung Ho
author_facet Nam, Hwayong
Baek, Seungmin
Kim, Jumin
Kim, Michael Jaemin
Ahn, Jung Ho
contents Modern HBM-based memory systems have evolved over generations while retaining cache line granularity accesses. Preserving this fine granularity necessitated the introduction of bank groups and pseudo channels. These structures expand timing parameters and control overhead, significantly increasing memory controller scheduling complexity. Large language models (LLMs) now dominate deep learning workloads, streaming contiguous data blocks ranging from several kilobytes to megabytes per operation. In a conventional HBM-based memory system, these transfers are fragmented into hundreds of 32B cache line transactions. This forces the memory controller to employ unnecessarily intricate scheduling, leading to growing inefficiency. To address this problem, we propose RoMe. RoMe accesses DRAM at row granularity and removes columns, bank groups, and pseudo channels from the memory interface. This design simplifies memory scheduling, thereby requiring fewer pins per channel. The freed pins are aggregated to form additional channels, increasing overall bandwidth by 12.5% with minimal extra pins. RoMe demonstrates how memory scheduling logic can be significantly simplified for representative LLM workloads, and presents an alternative approach for next-generation HBM-based memory systems achieving increased bandwidth with minimal hardware overhead.
format Preprint
id arxiv_https___arxiv_org_abs_2512_01541
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle RoMe: Row Granularity Access Memory System for Large Language Models
Nam, Hwayong
Baek, Seungmin
Kim, Jumin
Kim, Michael Jaemin
Ahn, Jung Ho
Hardware Architecture
Modern HBM-based memory systems have evolved over generations while retaining cache line granularity accesses. Preserving this fine granularity necessitated the introduction of bank groups and pseudo channels. These structures expand timing parameters and control overhead, significantly increasing memory controller scheduling complexity. Large language models (LLMs) now dominate deep learning workloads, streaming contiguous data blocks ranging from several kilobytes to megabytes per operation. In a conventional HBM-based memory system, these transfers are fragmented into hundreds of 32B cache line transactions. This forces the memory controller to employ unnecessarily intricate scheduling, leading to growing inefficiency. To address this problem, we propose RoMe. RoMe accesses DRAM at row granularity and removes columns, bank groups, and pseudo channels from the memory interface. This design simplifies memory scheduling, thereby requiring fewer pins per channel. The freed pins are aggregated to form additional channels, increasing overall bandwidth by 12.5% with minimal extra pins. RoMe demonstrates how memory scheduling logic can be significantly simplified for representative LLM workloads, and presents an alternative approach for next-generation HBM-based memory systems achieving increased bandwidth with minimal hardware overhead.
title RoMe: Row Granularity Access Memory System for Large Language Models
topic Hardware Architecture
url https://arxiv.org/abs/2512.01541