局部自调整超立方网络
Locally Self-Adjusting Hypercubic Networks
摘要:
在之前的工作(ICDCS 2017)中,我们提出了一种用于跳跃图的分布式自调整算法DSG。DSG对通信模式进行拓扑自适应,以最小化通信节点间的平均路由开销。在这项工作中,我们提出了一个分布式的自调整算法(称为DyHypes)的拓扑自适应超立方网络。超立方体和跳跃图的一个主要区别是超立方体在结构上比跳跃图更加刚性。这个性质使得超三次网络中的自调整与跳图有显著的不同。在任意一对节点之间进行通信时,DyHypes将网络转换为将频繁通信的节点彼此靠近以最大限度地提高通信效率,并在转换过程中使用随机化来加速转换并降低消息复杂性。我们发现,相比DSG,DyHypes降低了转换成本的一个因素的$O(\log n)$,其中$n$是参与转换的节点数。此外,尽管实现了更快的转换与较低的消息复杂性,组合成本(路由和转换)的DyHypes是最多一个$\log \log n$因素比任何算法,符合计算模型采用这项工作。与DSG类似,DyHypes是完全分散的,符合$\mathcal{CONGEST}$模型,并且每个节点需要$O(\log n)$位内存,其中$n$是节点的总数。
英文摘要:
In a prior work (ICDCS 2017), we presented a distributed self-adjusting algorithm DSG for skip graphs. DSG performs topological adaption to communication pattern to minimize the average routing costs between communicating nodes. In this work, we present a distributed self-adjusting algorithm (referred to as DyHypes) for topological adaption in hypercubic networks. One of the major differences between hypercubes and skip graphs is that hypercubes are more rigid in structure compared skip graphs. This property makes self-adjustment significantly different in hypercubic networks than skip graphs. Upon a communication between an arbitrary pair of nodes, DyHypes transforms the network to place frequently communicating nodes closer to each other to maximize communication efficiency, and uses randomization in the transformation process to speed up the transformation and reduce message complexity. We show that, as compared to DSG, DyHypes reduces the transformation cost by a factor of $O(\log n)$, where $n$ is the number of nodes involved in the transformation. Moreover, despite achieving faster transformation with lower message complexity, the combined cost (routing and transformation) of DyHypes is at most a $\log \log n$ factor more than that of any algorithm that conforms to the computational model adopted for this work. Similar to DSG, DyHypes is fully decentralized, conforms to the $\mathcal{CONGEST}$ model, and requires $O(\log n)$ bits of memory for each node, where $n$ is the total number of nodes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。