Poster Type: ACM SRC Posters
Author: Calvin Jialin Zhang (Cornell University)
Abstract: Sparse matrix–matrix multiplication (SpGEMM) is bandwidth-bound, the kind of kernel a memory-side accelerator ought to absorb, but the processing-in-memory hardware that ships is built for AI inference. We map 𝐶 = 𝐴 · 𝐴 onto SK hynix’s Accelerator-in-Memory (AiM), whose fixed-function units multiply dense bfloat16 vectors but cannot compute an address, so the host must place every product in advance. The mapping trades host planning for device time; we measure the trade over four designs, from almost no planning to a simulator-in-the-loop search. A single packing pass cuts device time 7×–122×, every further plan buys at most 8.5× more, and on a single product each plan costs more host time than it saves.
Best Poster Finalist (BP): no
Poster: PDF
Poster Summary: PDF