Optimal doublecast path in hexagonal honeycomb mesh

Xiaofan Yang; Yuan Yan Tang; Qing Lu; Zhenyu He

doi:10.1016/j.amc.2006.05.012

Optimal doublecast path in hexagonal honeycomb mesh

Xiaofan Yang^*
, Yuan Yan Tang
, Qing Lu
, Zhenyu He

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to journal › Journal article › peer-review

6 Citations (Scopus)

Abstract

The performance of a multicomputer is greatly dependent on the multicast strategy, i.e., how to deliver the same message from a source node to a number of destination nodes. Building an optimal multicast path is suited for multicast wormhole routing. A doublecast path is a multicast path with exactly two destination nodes. Hexagonal honeycomb mesh is a promising candidate for interconnection networks. This paper addresses the building of an optimal doublecast path on hexagonal honeycomb mesh. A theorem concerned with the length of an optimal doublecast path is established, and a time-optimal algorithm for building an optimal doublecast path is proposed.

Original language	English
Pages (from-to)	1267-1279
Number of pages	13
Journal	Applied Mathematics and Computation
Volume	182
Issue number	2
DOIs	https://doi.org/10.1016/j.amc.2006.05.012
Publication status	Published - 15 Nov 2006

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

User-Defined Keywords

Hexagonal honeycomb mesh
Interconnection network
Multicast routing
Optimal doublecast path

Access to Document

10.1016/j.amc.2006.05.012

Cite this

@article{78a76d0cb0024818bb07dd76599e785d,

title = "Optimal doublecast path in hexagonal honeycomb mesh",

abstract = "The performance of a multicomputer is greatly dependent on the multicast strategy, i.e., how to deliver the same message from a source node to a number of destination nodes. Building an optimal multicast path is suited for multicast wormhole routing. A doublecast path is a multicast path with exactly two destination nodes. Hexagonal honeycomb mesh is a promising candidate for interconnection networks. This paper addresses the building of an optimal doublecast path on hexagonal honeycomb mesh. A theorem concerned with the length of an optimal doublecast path is established, and a time-optimal algorithm for building an optimal doublecast path is proposed.",

keywords = "Hexagonal honeycomb mesh, Interconnection network, Multicast routing, Optimal doublecast path",

author = "Xiaofan Yang and Tang, \{Yuan Yan\} and Qing Lu and Zhenyu He",

note = "The work of this paper is financially supported by Funds for New Century{\textquoteright}s Excellent Talents of Educational Ministry of China (\# NCET-05-0759), Doctorate Funds of Education Ministry of China (No. 20050611001) and Natural Science Funds of Chongqing (No. CSTC, 2005BB2191). Publisher copyright: {\textcopyright} 2006 Elsevier Inc. All rights reserved.",

year = "2006",

month = nov,

day = "15",

doi = "10.1016/j.amc.2006.05.012",

language = "English",

volume = "182",

pages = "1267--1279",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

number = "2",

}

TY - JOUR

T1 - Optimal doublecast path in hexagonal honeycomb mesh

AU - Yang, Xiaofan

AU - Tang, Yuan Yan

AU - Lu, Qing

AU - He, Zhenyu

N1 - The work of this paper is financially supported by Funds for New Century’s Excellent Talents of Educational Ministry of China (# NCET-05-0759), Doctorate Funds of Education Ministry of China (No. 20050611001) and Natural Science Funds of Chongqing (No. CSTC, 2005BB2191). Publisher copyright: © 2006 Elsevier Inc. All rights reserved.

PY - 2006/11/15

Y1 - 2006/11/15

N2 - The performance of a multicomputer is greatly dependent on the multicast strategy, i.e., how to deliver the same message from a source node to a number of destination nodes. Building an optimal multicast path is suited for multicast wormhole routing. A doublecast path is a multicast path with exactly two destination nodes. Hexagonal honeycomb mesh is a promising candidate for interconnection networks. This paper addresses the building of an optimal doublecast path on hexagonal honeycomb mesh. A theorem concerned with the length of an optimal doublecast path is established, and a time-optimal algorithm for building an optimal doublecast path is proposed.

AB - The performance of a multicomputer is greatly dependent on the multicast strategy, i.e., how to deliver the same message from a source node to a number of destination nodes. Building an optimal multicast path is suited for multicast wormhole routing. A doublecast path is a multicast path with exactly two destination nodes. Hexagonal honeycomb mesh is a promising candidate for interconnection networks. This paper addresses the building of an optimal doublecast path on hexagonal honeycomb mesh. A theorem concerned with the length of an optimal doublecast path is established, and a time-optimal algorithm for building an optimal doublecast path is proposed.

KW - Hexagonal honeycomb mesh

KW - Interconnection network

KW - Multicast routing

KW - Optimal doublecast path

UR - https://www.scopus.com/pages/publications/33751546596

U2 - 10.1016/j.amc.2006.05.012

DO - 10.1016/j.amc.2006.05.012

M3 - Journal article

AN - SCOPUS:33751546596

SN - 0096-3003

VL - 182

SP - 1267

EP - 1279

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 2

ER -

Optimal doublecast path in hexagonal honeycomb mesh

Abstract

UN SDGs

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this