Speak at Bengaluru Systems meet-up
Call for talks & demos for monthly meet-ups
Mar 2026
23 Mon
24 Tue
25 Wed
26 Thu
27 Fri
28 Sat 11:00 AM – 01:00 PM IST
29 Sun
Pranav M
@prawns
Submitted Oct 27, 2026
LLM decode is memory-bound, so near-memory compute (PIM/PNM) looks like an easy win. But how much of the ideal speedup survives the interface?
This talk looks at where the speedup goes, using a case study from my own small near-memory engine for binary similarity search, HADES, and a few recent PIM papers.
Length: 12–13 minutes. No PIM background needed.
About me: Pranav M, undergrad ECE at PESU, working on computer architecture, processing near memory and RTL.
Hosted by
Supported by
Venue host
{{ gettext('Login to leave a comment') }}
{{ gettext('Post a comment…') }}{{ errorMsg }}
{{ gettext('No comments posted yet') }}