{"title":"Capacity-Latency Tradeoffs in CXL Memory Expander at Hyperscale","authors":"Haneul Park;Grant Ayers;Nam Sung Kim;Philip Levis;Brian Morris","doi":"10.1109/LCA.2026.3676988","DOIUrl":"https://doi.org/10.1109/LCA.2026.3676988","url":null,"abstract":"DRAM dominates the cost of hyperscale datacenter servers today and AI-driven memory supply shortages are pushing costs even higher. CXL memory expanders are a new technology to reduce server costs by reusing legacy DDR DRAM modules from older servers. Memory expanders further save cost through inline compression that increases the effective capacity. This paper investigates two critical design points of a memory expander: the compression algorithm and the compression block size. Both design points introduce tradeoffs between latency and capacity that involve complex interactions with the memory expander architecture, access patterns to the device, and the entropy of stored data. Current commercial devices use simple, fast compression and a 4 kB block as the default. Using a compressibility benchmark and the latest traces of cold memory accesses from a hyperscaler, we find that using a different compression algorithm and block size can simultaneously increase expander capacity <italic>and</i> reduce access latency. The key insight is counter-intuitive: using a slower, more complex compression algorithm improves latency because the reduction in DRAM traffic more than offsets the additional decompression time.","PeriodicalId":51248,"journal":{"name":"IEEE Computer Architecture Letters","volume":"25 1","pages":"122-125"},"PeriodicalIF":1.4,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11454555","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147665464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Simulator for LLM Inference Systems Exploiting CXL Memory Pools","authors":"Jinghan Huang;Hongkun Zeng;Mike Montano;Jaehong Cho;Hyunmin Choi;Jinin So;Junhyeok Im;Handeok Lee;Jongse Park;Nam Sung Kim","doi":"10.1109/LCA.2026.3691007","DOIUrl":"https://doi.org/10.1109/LCA.2026.3691007","url":null,"abstract":"The cost of large language model (LLM) inference is heavily tied to the immense memory capacity required to store model parameters—a challenge exacerbated by current systems that replicate these parameters across multiple servers to scale. To tackle this challenge, we may consider LLM inference systems exploiting a CXL memory pool to store and share model parameters across multiple servers, while keeping server-specific activations and KV-caches within each server’s local memory. Motivated by the lack of existing simulators for such systems, we first develop a simulator that extends LLMServingSim and integrates it with NS-3 and Mess to accurately model the CXL switch and the memory modules within the CXL pool, respectively. Second, we validate this simulator against a system connecting an industry CXL memory pool to two servers running two instances of the same LLM; across separate evaluations for OPT-1.6B and OPT-6.7B, the simulator demonstrates a <inline-formula><tex-math>$approx$</tex-math></inline-formula>3% error in inference latency. Lastly, using our simulator, we uncover a significant sensitivity between inference latency and the interconnect bandwidth of the CXL memory pool, demonstrating that adopting an emerging optical interconnect over the traditional electrical counterpart reduces inference latency by 67.9% and 64.4% for OPT-1.6B and OPT-6.7B, respectively.","PeriodicalId":51248,"journal":{"name":"IEEE Computer Architecture Letters","volume":"25 1","pages":"202-205"},"PeriodicalIF":1.4,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148171870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Near-HBM Tensor Core Acceleration for Fine-Grained Sparse Matrix-Matrix Multiplication","authors":"Lihan Hu;Shiju Li;Hoshik Kim;Jongryool Kim","doi":"10.1109/LCA.2026.3690418","DOIUrl":"https://doi.org/10.1109/LCA.2026.3690418","url":null,"abstract":"Fine-grained structured sparsity, especially the 2:4 pattern, is a practical way to reduce the computation and memory cost of deep learning workloads while preserving model accuracy. NVIDIA Sparse Tensor Cores support such sparsity through metadata-driven sparse matrix-matrix multiplication (SpMM). However, the compressed sparse format introduces indirect and irregular memory accesses, which disrupt data locality and limit performance. We propose TC-AIA, a processing-near-HBM framework for accelerating structured SpMM on Tensor Cores. TC-AIA offloads metadata-driven data gathering to logic near HBM, where scattered accesses are reorganized and packed into dense Tensor-Core-compatible inputs before computation. By removing most indirect accesses from the GPU-side execution path, TC-AIA improves Tensor Core utilization and memory efficiency. Experimental results show that TC-AIA achieves significant speedup and reduces memory traffic across a wide range of structured sparse workloads.","PeriodicalId":51248,"journal":{"name":"IEEE Computer Architecture Letters","volume":"25 1","pages":"186-189"},"PeriodicalIF":1.4,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148003573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Prerna Priyadarshini;Abhijat Bharadwaj;Biswabandan Panda
{"title":"Differential Privacy for Secure Cache Partitioning: Promises, Limits, and Fixes","authors":"Prerna Priyadarshini;Abhijat Bharadwaj;Biswabandan Panda","doi":"10.1109/LCA.2026.3697544","DOIUrl":"https://doi.org/10.1109/LCA.2026.3697544","url":null,"abstract":"The shared last-level cache (LLC) enables cross-core contention-based attacks. While LLC randomization mitigates conflict-based attacks, cache partitioning prevents all attack classes. Recent secure partitioning techniques dynamically allocate LLC space and claim security against cache occupancy attacks. We show that state-of-the-art LLC usage-based dynamic partitioning remains vulnerable. Focusing on Secure and Scalable Cache Partitioning (SCALE), which applies differential privacy–based noise to LLC way allocations, we demonstrate that allocations can be denoised over time to construct a reliable LLC occupancy channel. The key insight that drives the occupancy channel is that differential privacy protects individual allocations; it does not hide long-term statistics such as the mean, median, and standard deviation. We showcase a novel LLC occupancy attack that does application fingerprint exploiting statistical properties. Finally, we propose lightweight fixes that mitigate this leakage.","PeriodicalId":51248,"journal":{"name":"IEEE Computer Architecture Letters","volume":"25 1","pages":"206-209"},"PeriodicalIF":1.4,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148236235","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kyeonghyeon Ryu;Yunhyeong Jeon;Gyeongseo Park;Minho Kim;Daehoon Kim
{"title":"InfAMAX: Bridging the Compute-Memory Gap in Intel AMX for Efficient LLM Inference","authors":"Kyeonghyeon Ryu;Yunhyeong Jeon;Gyeongseo Park;Minho Kim;Daehoon Kim","doi":"10.1109/LCA.2026.3693303","DOIUrl":"https://doi.org/10.1109/LCA.2026.3693303","url":null,"abstract":"Intel Advanced Matrix Extensions (AMX) offers a theoretical peak of over 90 TFLOPS for LLM inference, yet practical efficiency often plateaus at 5–40% of its potential. Our analysis reveals that this performance gap stems from a fundamental architectural mismatch: bursty AMX memory accesses frequently saturate Line Fill Buffers (LFB), and naive multi-socket scaling triggers prohibitive synchronization overhead. To bridge this gap, we propose <monospace>InfAMAX</monospace>, an LLM inference framework built upon two key ideas. First, we introduce decoupled tile-pipelining and multi-level adaptive prefetching to maximize data reuse and mask LFB-induced latencies across the cache hierarchy. Second, we employ a NUMA-aware resource management strategy that enforces strict thread affinity and shape-aware partitioning to eliminate cross-socket cache coherence traffic. Experimental results show that <monospace>InfAMAX</monospace> improves end-to-end inference throughput by up to 2× (reducing decoding latency by 2×) over state-of-the-art libraries, providing a scalable and efficient foundation for high-performance LLM serving on modern CPUs.","PeriodicalId":51248,"journal":{"name":"IEEE Computer Architecture Letters","volume":"25 1","pages":"198-201"},"PeriodicalIF":1.4,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148236238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CMM-H PMEM: Performance Characterization of CXL Large Capacity Persistent Memory","authors":"Gongjin Sun;Mehdi Nik;Senthil Murugesapandian;Dongyang Li;Kwan Huen;Xuebin Yao;Caroline Kahn;Amir Beygi;Vitorio Cargnini;Ramdas Kachare","doi":"10.1109/LCA.2026.3668463","DOIUrl":"https://doi.org/10.1109/LCA.2026.3668463","url":null,"abstract":"System architectures place memory in close proximity of CPU to achieve high performance. However, this directly and locally attached memory comes with constraints. Compute Express Link (CXL) enables robust memory disaggregation and thereby opens up new possibilities to address some of the direct-attached memory constraints. Samsung CMM-H is a CXL memory module that combines best aspects of DRAM and NAND in a novel architecture to provide a large capacity persistent memory (PMEM) solution. While NVMe SSDs offer capacity, they suffer from higher latency and inevitable write amplification when subjected to the fine-grained writes of data-intensive workloads. This paper presents a comprehensive characterization of the CMM-H PMEM solution. CMM-H device performance profile is compared to NVMe SSD. It achieves up to 100 M random read IOPS, and latencies an order of magnitude lower for small I/Os. The large built-in DRAM cache is the architectural mechanism that enables this performance. The same mechanism also achieves a significant reduction in data written to the backend NAND thereby reducing write amplification factor (WAF). Lower WAF in turn provides benefits such as higher media endurance, lower power consumption, and lower latency. Direct measurement of real-world case studies demonstrates this mechanism reduces WAF by over 200x. This unique combination of high performance and significant write reduction establishes CMM-H as a compelling device solution in the PMEM landscape.","PeriodicalId":51248,"journal":{"name":"IEEE Computer Architecture Letters","volume":"25 1","pages":"93-96"},"PeriodicalIF":2.0,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11415655","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148480444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Heterogeneous Mapping for Analog In-Memory Computing Accelerators: A Unified Workflow","authors":"Corey Lammie","doi":"10.1109/LCA.2026.3699929","DOIUrl":"https://doi.org/10.1109/LCA.2026.3699929","url":null,"abstract":"Analog In-Memory Computing (AIMC) accelerators execute matrix–vector multiplications directly within memory arrays, reducing data movement and improving DNN inference efficiency. Their limited effective precision motivates heterogeneous architectures that combine analog compute tiles with digital processing units. This letter classifies existing methods for partitioning DNN workloads across these resources by mapping granularity, optimization strategy, and model support, and distills them into a unified four-stage workflow. To demonstrate the workflow on a model class not yet addressed by existing methods, we apply its first two stages to GPT-2, producing the first AIMC-specific precision sensitivity profile for a decoder-only transformer. Sensitivity is dominated by 4 of 49 projections, with the first decoder block’s attention output dominating by an order of magnitude. This suggests that projection-level mapping and selective digital execution of early-block and output-facing projections are important for reliable decoder-transformer deployment on AIMC hardware.","PeriodicalId":51248,"journal":{"name":"IEEE Computer Architecture Letters","volume":"25 1","pages":"235-238"},"PeriodicalIF":2.0,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148442290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jintae Kim;Byoungjun Jeong;Changdae Kim;Narae Ryu;Eunji Pak;Hunjun Lee
{"title":"Accurate and High-Throughput Analog-Digital DNN Acceleration Using Sub-Network Scheduling","authors":"Jintae Kim;Byoungjun Jeong;Changdae Kim;Narae Ryu;Eunji Pak;Hunjun Lee","doi":"10.1109/LCA.2026.3668766","DOIUrl":"https://doi.org/10.1109/LCA.2026.3668766","url":null,"abstract":"Analog Computing-in-Memory (ACiM) devices perform matrix operations directly within memory arrays, offering high throughput for deep neural network inference. At the same time, they are susceptible to various noise sources, which reduces the computational accuracy. This inherent trade-off limits the adoption of ACiM devices as a stand-alone accelerator. In this paper, we propose the first heterogeneous inference-serving framework that coordinates ACiM hardware and conventional digital processors during inference. The system dynamically partitions each neural network into an analog sub-network executed on highthroughput ACiM devices and a digital subnetwork handled by precise digital devices. Then, it integrates a transition layer and a custom training strategy to maintain accuracy across varying analog-digital partitions. Also, it adopts a two-level scheduler to adjust the partition ratio at runtime in response to varying query demands. We evaluate our system using five network models to demonstrate the benefits of our system.","PeriodicalId":51248,"journal":{"name":"IEEE Computer Architecture Letters","volume":"25 1","pages":"97-100"},"PeriodicalIF":1.4,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147557576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Characterizing System-Level Trade-Offs of Intel DSA for User-Space IPC Offloading","authors":"Misun Park;Richi Dubey;Yifan Yuan;Nam Sung Kim;Ada Gavrilovska","doi":"10.1109/LCA.2026.3680453","DOIUrl":"https://doi.org/10.1109/LCA.2026.3680453","url":null,"abstract":"Data movement accelerators such as Intel Data Streaming Accelerator (DSA) are increasingly proposed to address the rising cost of intra-node data movement in high-throughput IPC (Inter-Process Communication). Modern data-centric workloads transfer tens to hundreds of megabytes per request, making memory copies a primary bottleneck in latency and CPU utilization. Offloading appears attractive because it can reclaim CPU cycles and reduce cache pressure. However, without careful integration, it can degrade performance instead of improving it. This paper presents a system-level characterization of Intel DSA in user-space IPC and identifies three critical trade-offs: (1) synchronization overhead from polling-based completion, (2) sensitivity to memory state, especially page faults under shared virtual memory, and (3) cache locality and interference from cache injection. Although DSA can reduce latency by tens of microseconds for large transfers, inefficient polling, runtime page faults, or cache contention can eliminate these gains. Our results show that memory offload engines are not drop-in replacements for CPU <monospace>memcpy</monospace>. Their benefits depend on coordinated integration with synchronization, virtual memory, and cache subsystems. We therefore derive hardware-aware design guidelines for adaptive offloading, hybrid polling, pinned or pre-faulted memory management, and contention-aware cache control.","PeriodicalId":51248,"journal":{"name":"IEEE Computer Architecture Letters","volume":"25 1","pages":"146-149"},"PeriodicalIF":1.4,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147737043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CXL-Tracer: Accurate, Full-System Memory Tracing on Commercial Hardware via CXL Memory","authors":"Srikar Vanavasam;Austin Antony Cruz;Nam Sung Kim","doi":"10.1109/LCA.2026.3673181","DOIUrl":"https://doi.org/10.1109/LCA.2026.3673181","url":null,"abstract":"Accurate, full-system physical memory traces are critical for computer architecture research, but existing collection methods based on software instrumentation or simulation suffer from a lack of fidelity, while prior hardware-based solutions are often intrusive or proprietary. We introduce CXL-Tracer, a non-intrusive tracing framework that uses a commodity FPGA as a CXL Type-3 memory device to capture complete, high-fidelity memory traces from a real system. Traces are offloaded over a dedicated PCIe link to a separate collection server, ensuring no performance interference with the system under test. Our evaluation demonstrates that CXL-Tracer captures the full spectrum of system activity, recording up to 70x more memory traffic than binary instrumentation for I/O-heavy workloads. Furthermore, we show that replaying these real-system traces in a cycle-accurate DRAM simulator yields significantly more realistic memory latency results compared to traces generated by a full-system simulator such as gem5. CXL-Tracer provides an accessible and accurate platform for designing and evaluating future memory subsystems.","PeriodicalId":51248,"journal":{"name":"IEEE Computer Architecture Letters","volume":"25 1","pages":"114-117"},"PeriodicalIF":1.4,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11433038","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147557744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}