Pushing Four Raspberry Pis to the Memory Wall: Bit-Exact 30B Mixture-of-Experts Inference, +16% over the Public Record | Hellomatik

A 30-billion-parameter Mixture-of-Experts language model (Qwen3-30B-A3B) runs on four Raspberry Pi 5 boards — roughly €500 of CPU-only hardware, with no GPU or NPU — at 15.143 tok/s decode, bit-exact. On identical 16 GB silicon this is +15.2% over the vanilla distributed-llama baseline (13.15 → 15.143 tok/s, n=20), a confound-free figure attributable to the software and configuration work reported here. It is also +16.1% above the highest publicly documented result for this model and hardware class (13.04 tok/s; b4rtaz #255, 8 GB SKU), a cross-SKU comparison we show carries no measurable hardware confound. We adopt distributed-llama v0.16.5 with twelve source-level changes (eight framework patches plus four bit-exact kernel and op-fusion optimisations) and persistent runtime kernel tuning. Every optimisation stage is validated bit-exact (SHA-256 of the generated token-id sequence at seed=42, temperature=0). The trajectory runs from a 5.70 tok/s Llama-3.1-8B dense baseline, through an 11.40 tok/s Qwen3-MoE baseline, to the result above; end-to-end sustained serving throughput (prefill included) is 14.449 tok/s. ARM PMU profiling locates the residual bottleneck in LPDDR4X memory bandwidth (49% backend-stalled cycles, 11.4 GB/s of ~17GB/s per node). We catalogue twenty-six unsuccessful configurations under strict constraints (bit-exact, no kernel rebuild, no model change, no overclock), and find that co-located telemetry agents tax this memory-bound decode by 5.18% while leaving compute-bound prefill unchanged — a clean confirmation that decode is bandwidth-bound. Code, patches, systemd units and reproducibility scripts: https://github.com/hellomatik-org/distributed-llama

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-05-23
DOI
https://doi.org/10.5281/zenodo.20357375
Primary Topic
Parallel Computing and Optimization Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Pushing Four Raspberry Pis to the Memory Wall: Bit-Exact 30B Mixture-of-Experts Inference, +16% over the Public Record | Hellomatik

Daniel Correa Villa
Zenodo (CERN European Organization for Nuclear Research)
Parallel Computing and Optimization Techniques
preprint

Pushing Four Raspberry Pis to the Memory Wall: Bit-Exact 30B Mixture-of-Experts Inference, +16% over the Public Record | Hellomatik

Daniel Correa Villa
preprint en

Abstract

A 30-billion-parameter Mixture-of-Experts language model (Qwen3-30B-A3B) runs on four Raspberry Pi 5 boards — roughly €500 of CPU-only hardware, with no GPU or NPU — at 15.143 tok/s decode, bit-exact. On identical 16 GB silicon this is +15.2% over the vanilla distributed-llama baseline (13.15 → 15.143 tok/s, n=20), a confound-free figure attributable to the software and configuration work reported here. It is also +16.1% above the highest publicly documented result for this model and hardware class (13.04 tok/s; b4rtaz #255, 8 GB SKU), a cross-SKU comparison we show carries no measurable hardware confound. We adopt distributed-llama v0.16.5 with twelve source-level changes (eight framework patches plus four bit-exact kernel and op-fusion optimisations) and persistent runtime kernel tuning. Every optimisation stage is validated bit-exact (SHA-256 of the generated token-id sequence at seed=42, temperature=0). The trajectory runs from a 5.70 tok/s Llama-3.1-8B dense baseline, through an 11.40 tok/s Qwen3-MoE baseline, to the result above; end-to-end sustained serving throughput (prefill included) is 14.449 tok/s. ARM PMU profiling locates the residual bottleneck in LPDDR4X memory bandwidth (49% backend-stalled cycles, 11.4 GB/s of ~17GB/s per node). We catalogue twenty-six unsuccessful configurations under strict constraints (bit-exact, no kernel rebuild, no model change, no overclock), and find that co-located telemetry agents tax this memory-bound decode by 5.18% while leaving compute-bound prefill unchanged — a clean confirmation that decode is bandwidth-bound. Code, patches, systemd units and reproducibility scripts: https://github.com/hellomatik-org/distributed-llama

Zenodo (CERN European Organization for Nuclear Research)
Diplomatique (FR)
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Pushing Four Raspberry Pis to the Memory Wall: Bit-Exact 30B Mixture-of-Experts Inference, +16% over the Public Record | Hellomatik — Daniel Correa Villa · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS