密集高斯和艾森斯坦-雅可比网络中本地广播修复的常数时间证书选择
Constant-Time Certificate Selection for Local Broadcast Repair in Dense Gaussian and Eisenstein--Jacobi Networks
AI总结:
针对密集高斯和艾森斯坦-雅可比网络中的故障修复问题,提出常数时间证书选择器,仅根据故障坐标在O(1)时间和内存内选择修复边,保证连通性和深度界限。
摘要:
密集高斯和艾森斯坦-雅可比(EJ)网络是具有紧凑坐标球、固定度和简单模块寻址的代数互连网络。源中心的坐标归约树在无故障网络中提供无冗余的一对多广播,但处理器故障可能将树分割成多个健康组件。与需要线性扫描网络来选择修复计划的基于搜索的修复方法不同,本文引入的证书选择器在$O(1)$时间和$O(1)$内存内运行,仅查询故障坐标。本文针对单故障和双故障情况发展了这种更强的形式化:一个常数时间证书选择器。仅给定故障坐标,选择器分类相对故障几何,选择坐标归约方向,并返回一个有序的跨组件修复边集合。对于密集高斯网络$G_k$,每个无源故障集$|F|\le2$在深度最多$k+2$内被修复,并且对于选定的故障剪枝方向,恰好使用$c-1$条外部跨组件边。对于密集EJ网络$H_t$,每个单故障布局在深度$t+1$内被修复,每个双故障布局在深度$t+2$内被修复,同样恰好使用$c-1$条外部修复边。详尽的严格验证确认了高斯选择器在$k=5,\ldots,12$的$146{,}156$个单故障和双故障案例上的正确性,以及EJ选择器在$t=2,\ldots,8$的$52{,}395$个案例上的正确性,在连通性、无环性、精确修复计数或深度界限方面零失败。
英文摘要:
Dense Gaussian and Eisenstein--Jacobi (EJ) networks are algebraic interconnection networks with compact coordinate balls, fixed degree, and simple modular addressing. A source-centered coordinate-reduction tree gives a non-redundant one-to-all broadcast in the fault-free network, but processor faults can split the tree into multiple healthy components. Unlike search-based repair methods that require a linear scan of the network to select the repair plan, the certificate selectors introduced here operate in $O(1)$ time and $O(1)$ memory, consulting only the fault coordinates. This paper develops this stronger formulation for the one- and two-fault regime: a constant-time certificate selector. Given only the faulty coordinates, the selector classifies the relative fault geometry, chooses a coordinate-reduction orientation, and returns a bounded ordered set of component-crossing repair edges. For dense Gaussian networks $G_k$, every source-free fault set with $|F|\le2$ is repaired with depth at most $k+2$ and with exactly $c-1$ external component-crossing edges for the selected fault-pruned orientation. For dense EJ networks $H_t$, every one-fault placement is repaired within depth $t+1$, and every two-fault placement is repaired within depth $t+2$, again with exactly $c-1$ external repair edges. Exhaustive strict validation confirms the Gaussian selector over $146{,}156$ one- and two-fault cases for $k=5,\ldots,12$ and the EJ selector over $52{,}395$ cases for $t=2,\ldots,8$, with zero failures in connectivity, acyclicity, exact repair count, or depth bound.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。