Sep 2026· Proceedings of the International Conference on Parallel Processing· pp. 1030-1040· 0 citations· 18 references
Abstract
While dynamic rerouting represents the predominant fault-tolerant strategy for Network-on-Chip (NoC) multicast communications, circumventing permanent hardware failures inevitably concentrates detour traffic at specific intermediate nodes. Rerouting exacerbates pre-existing traffic skew and accelerates hardware aging — a problem that existing solutions fundamentally fail to address. Furthermore, as modern application-specific system-on-chips (SoCs) increasingly adopt irregular topologies, an effective fault-tolerant architecture must extend to such custom topologies. To address these challenges, we introduce BEAM, which integrates three key components: (1) A sequential topology embedding algorithm that employs a heuristic search with Warnsdorff’s rule to construct a near-Hamiltonian path, abstracting any arbitrary physical network into a unified logical sequence. (2) A neighbor-aware route distribution scheme that partitions multicast destinations into independent subsets based on router indices, enabling concurrent packet forwarding to improve throughput and fairness. (3) A lightweight bypass router architecture featuring a dedicated fault control unit that instantly redirects incoming packets to a physical bypass channel upon fault detection, circumventing faulty components without the overhead of full structural redundancy. Evaluation results demonstrate that under two fault conditions on different 64-node topologies, BEAM achieves 20.4% higher saturation throughput and 16.0% higher fairness on average than the evaluated schemes, with negligible hardware overhead.
As Network-on-Chip (NoC)-based multiprocessor arrays continue to scale, permanent faults in processing elements (PEs) increasingly jeopardize system reliability and performance. Topology reconfiguration has become a critical mechanism to tolerate such faults by restoring logical interconnects. However, existing heurist...
Shujian Chen, Hao Ding, Shuo Cui et al.· ACM Transactions on Architec...· 0 citations
The effectiveness of SyOpt for minimizing link congestion for routings perfectly resilient for up to one link failure is demonstrated and its potential for continuous application in online monitoring and timely routing optimization, under dynamically fluctuating traffic demands is discussed.
Csaba Györgyi, Kim G. Larsen, Stefan Schmid et al.· 0 citations
This paper presents AdaptiveNet SDN, a software-defined networking simulation framework designed to maintain
communication when links, nodes, or groups of adjacent links fail. The system combines a multi-objective adaptive routing
algorithm with a self-healing controller, heartbeat-based failure detection, bandwidth-aw...
A. P., Bhoomika V., Hamsini G. R. et al.· International Journal of Inn...· 0 citations
Quantum networks face a fundamental challenge absent in classical networks; finite memory coherence times mean that queuing delay directly degrades information quality, causing decoherence that has no classical analog. Existing routing protocols optimize for hop count or channel fidelity while treating scheduling delay...
Results show that live-metric adaptive path selection yields large throughput gains where path diversity can be exploited and behaves as a safe drop-in replacement for shortest-path forwarding otherwise.
A. Wiranata, Intan Murniasih, Soleman Soleman· JITK (Jurnal Ilmu Pengetahua...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.