Heterogeneous Low-Cost Distributed Probing for LLM Observation

I describe a distributed probing protocol that runs a 100M-cell dense activation grid on thirteen open LLMs (124M to 7.6B parameters) using a small cluster of personal machines: a main workstation plus a few older laptops and an occasional accelerator, with a remote archive node holding the merged output. Calibration runs once on the host with enough RAM to hold the model; heat-fill runs in additive uint32 shards across whatever workers are available. The merge step uses element-wise sum and rejects shards with mismatched inputs by hashing. Wall-clock model: T = T_calib + T_fill * P / W for W workers on P probes. Heat tensor memory: |H| = L * d * Q * S * 4 bytes, where the product is at least 1e8. On commodity CPU at P=1200 and bfloat16, a 7B-class model completes in approximately one hour of calibration plus four worker-hours of heat-fill, all within ~400 MB of dense grid memory. No cloud burst. No data-center GPU.

Authors

Publication Details

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

Heterogeneous Low-Cost Distributed Probing for LLM Observation

Ho Yiing Chen
Zenodo (CERN European Organization for Nuclear Research)
Distributed and Parallel Computing Systems
preprint

Heterogeneous Low-Cost Distributed Probing for LLM Observation

Ho Yiing Chen
preprint en

Abstract

I describe a distributed probing protocol that runs a 100M-cell dense activation grid on thirteen open LLMs (124M to 7.6B parameters) using a small cluster of personal machines: a main workstation plus a few older laptops and an occasional accelerator, with a remote archive node holding the merged output. Calibration runs once on the host with enough RAM to hold the model; heat-fill runs in additive uint32 shards across whatever workers are available. The merge step uses element-wise sum and rejects shards with mismatched inputs by hashing. Wall-clock model: T = T_calib + T_fill * P / W for W workers on P probes. Heat tensor memory: |H| = L * d * Q * S * 4 bytes, where the product is at least 1e8. On commodity CPU at P=1200 and bfloat16, a 7B-class model completes in approximately one hour of calibration plus four worker-hours of heat-fill, all within ~400 MB of dense grid memory. No cloud burst. No data-center GPU.

Zenodo (CERN European Organization for Nuclear Research)
Decent work and economic growth
Distributed and Parallel Computing Systems
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.