返回
Higher dimensional hexagonal networks
DOI:10.1016/j.jpdc.2003.07.001.png)
摘要
En 中文
We define the higher dimensional hexagonal graphs as the generalization of a triangular plane tessellation, and consider it as a multiprocessor interconnection network. Nodes in a k-dimensional (k-D) hexagonal network are placed at the vertices of a k-D triangular tessellation, so that each node has up to 2k + 2 neighbors. In this paper, we propose a simple addressing scheme for the nodes, which leads to a straightforward formula for computing the distance between nodes and a very simple and elegant routing algorithm. The number of shortest paths between any two nodes and their description are also provided in this paper. We then derive closed formulas for the surface area (volume) of these networks, which are defined as the number of nodes located at a given distance (up to a given distance, respectively) from the origin node. The number of nodes and the network diameter under a more symmetrical border conditions are also derived. We show that a k-D hexagonal network of size t has the same degree, the same or lower diameter, and fewer nodes than a (k + 1)-D mesh of size t. Simple embeddings between two networks are also described. That is, we show how to reduce the dimension of a mesh by removing some nodes, and converting it into a hexagonal network, while preserving the simplicity of basic data communication schemes such as routing and broadcasting. (C) 2003 Elsevier Inc. All rights reserved.
Keyword:
interconnection networks
hexagonal networks
addressing
routing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
Evaluating the Prevalence of Long COVID in Patients Exposed to SARS-COV2 During Pregnancy评估妊娠期间暴露于SARS-COV2的患者中长新冠的患病率
EVALUATION OF ANTICOAGULATION MANAGEMENT IN PATIENTS WITH SUSPECTED HEPARIN-INDUCED THROMBOCYTOPENIA AWAITING DIAGNOSIS CONFIRMATION疑似肝素诱导血小板减少症且待确诊患者的抗凝管理评估

