Search arXiv⌕ Search

arXiv · 2610.26985

Migrate Computation, Not Data: Fault Recovery in Neuromorphic Many-Core Systems

Abstract

As neuromorphic systems scale to thousands of near-memory cores, aging-induced permanent faults in neuron-update datapaths become an important obstacle to long-term deployment. Existing online recovery methods typically retire a faulty core and migrate its neurons, along with their weights and membrane states, to healthy cores. This whole-core treatment incurs high recovery traffic and makes recovery depend on scarce destinations; at high utilization, there may be enough surviving compute capacity but insufficient free storage to copy the affected neuron context. This paper presents SpikeRelay, an online recovery framework for diagnosed compute-unit faults. SpikeRelay exploits the fact that, in many neuromorphic cores, the compute datapath, local SRAM, and router are distinct modules: a compute fault need not destroy stored weights and states or disconnect the core from the NoC. Instead of retiring a faulty core and migrating its neuron data, SpikeRelay converts the faulty core into a storage-and-forwarding node while offloading neuron-update computation to a healthy rescue core. This decoupling of storage and computation eliminates recovery-time data migration and greatly reduces spare-SRAM requirements. Consequently, SpikeRelay sustains 100\% recovery at 92.2\% SRAM utilization and a 50\% fault rate, whereas the best baseline achieves only 22.1\%.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Muyang Cao, Di Yu, Peiling Zhu, Linshan Jiang, Xin Du, Shuiguang Deng, Gang Pan. 2026-10-19. Migrate Computation, Not Data: Fault Recovery in Neuromorphic Many-Core Systems. https://arxiv.org/abs/2610.26985

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

GC-LIF: Spiking Group-Equivariant Neural Network With Group-Coupled Membrane Dynamics

Spiking neural networks (SNNs) promise event-driven, low-power inference, but on vision tasks they still acquire rotation invariance only through data augmentation. Group-equivariant CNNs build such symmetries into the architecture, yet a faithful spiking analogue is missing: a leaky integrate-and-fire (LIF) neuron placed after a $G$-equivariant convolution can break equivariance through its membrane recurrence. We give a necessary and sufficient condition for this not to happen. The layer is equivariant at every time step if and only if the neuron parameters $(β, v_{\mathrm{th}})$ are constant along the joint orbits of the group action on the (group, space) index. We solve it in closed form, and it covers any elementwise stateful neuron. Its sufficiency half specialises a known result for equivariant recurrent networks; its necessity half rules out the heterogeneous per-neuron parameters common in SNNs. The per-channel parameterisation that satisfies it, Group-Coupled LIF (GC-LIF), is combined with $p4$ and $p4m$-equivariant convolutions and a spike-rate group max-pool into SGE-Net. On MNIST, KMNIST, Fashion-MNIST, CIFAR-10 and CIFAR-100, evaluating each checkpoint on the clean test set and all its group-transformed copies, SGE-Net trained without rotations is invariant under $C_4$ and $D_4$ and outperforms a plain SNN trained with rotations in nine of ten dataset-group pairs, whereas non-equivariant baselines lose up to $72$ percentage points in the worst case. Operator-level tests confirm the theory before and after training, and an analytical estimate places SGE-Net at $1.7\times$ the arithmetic energy of a standard CNN and $2.3\times$ below its ANN counterpart at eight time steps.

cs.NE↗

Diagnosing Optimizer-Landscape Interaction via Representation in Subset Selection Multitasking: Evidence from Piano Fingering

Continuous relaxations are commonly used as an encoding scheme for evolutionary multitasking optimization (EMTO), allowing heterogeneous tasks to be optimized within a unified search space. However, these continuous representations fundamentally reshape the induced fitness landscape, and their impact on optimization behavior and knowledge transfer remains underexplored. In this work, we bridge the gap by analyzing the interaction between the representation-induced fitness landscape and optimizer behavior through fitness landscape analysis. Using piano fingering estimation as a representative case of the subset selection problem, we introduce several encoding variants and investigate how their induced landscapes influence search dynamics and solution quality under EMTO. Our analysis indicates that transfer efficacy is strongly associated with changes in representation-induced landscape characteristics, rather than algorithmic factors alone, highlighting the representation design as the key factor of effective knowledge transfer in multitasking optimization.

cs.NE↗

HEMO: Harness Self-Evolution for Multi-Objective Combinatorial Optimization

Automatic operator design (AOD) has increasingly adopted large language models (LLMs) to generate problem-specific search and variation operators for multi-objective combinatorial optimization (MOCO). Yet most methods evolve the operators while leaving the process that discovers them fixed. This limits adaptation as new Pareto trade-offs and operator interactions change where and how the search should proceed. We introduce HEMO, which makes the AOD harness itself a self-evolving optimization target. HEMO maintains a persistent harness state and updates one module at a time, revising the logic that determines which experience to retrieve, which operators to improve, which parents to select, and how to formulate the orchestration of search steps. Downstream solution quality and runtime guide these updates, while a discounted UCB scheduler directs adaptation toward promising modules as their utility changes. A persistent memory filesystem preserves candidate outcomes and diagnostic feedback across harness states, enabling successive states to build on accumulated optimization experience. Experiments across eight MOCO tasks and two structurally distinct evolutionary backbones demonstrate strong performance against conventional evolutionary, neural, and LLM-based AOD baselines, together with effective transfer to related tasks. HEMO extends automatic operator design beyond evolving individual operators to improving the search process that discovers them.

cs.NE↗