Lookahead Algorithm for Node Placement Optimization in ShuffleNets

Ho-Lun-T. WONG; Kwan-L. YEUNG

Lookahead Algorithm for Node Placement Optimization in ShuffleNets

Ho-Lun-T. WONG, Kwan-L. YEUNG

Full Text Views

0

Cite this

Summary :

Node placement optimization in ShuffleNets is a combinatorial optimization problem. In this paper, a new heuristic node placement algorithm, called Lookahead Algorithm, is proposed. Its performance is compared with the lower bounds derived in [1], as well as some existing algorithms in the literature. Significant reduction in weighted mean hop distance h_d is obtained, especially when the traffic distribution in ShuffleNets is highly skewed. Consider a ShuffleNet with 8 nodes, the h_d obtained using Lookahead Algorithm is only 1.90% above the lower bound under the skewed traffic distribution (with traffic skew factor γ = 100), and 16.04% under uniform random traffic distribution.

Publication: IEICE TRANSACTIONS on Communications Vol.E83-B No.7 pp.1527-1533

Publication Date: 2000/07/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Ho-Lun-T. WONG, Kwan-L. YEUNG, "Lookahead Algorithm for Node Placement Optimization in ShuffleNets" in IEICE TRANSACTIONS on Communications, vol. E83-B, no. 7, pp. 1527-1533, July 2000, doi: .
Abstract: Node placement optimization in ShuffleNets is a combinatorial optimization problem. In this paper, a new heuristic node placement algorithm, called Lookahead Algorithm, is proposed. Its performance is compared with the lower bounds derived in [1], as well as some existing algorithms in the literature. Significant reduction in weighted mean hop distance h_d is obtained, especially when the traffic distribution in ShuffleNets is highly skewed. Consider a ShuffleNet with 8 nodes, the h_d obtained using Lookahead Algorithm is only 1.90% above the lower bound under the skewed traffic distribution (with traffic skew factor γ = 100), and 16.04% under uniform random traffic distribution.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_7_1527/_p

Copy

@ARTICLE{e83-b_7_1527,
author={Ho-Lun-T. WONG, Kwan-L. YEUNG, },
journal={IEICE TRANSACTIONS on Communications},
title={Lookahead Algorithm for Node Placement Optimization in ShuffleNets},
year={2000},
volume={E83-B},
number={7},
pages={1527-1533},
abstract={Node placement optimization in ShuffleNets is a combinatorial optimization problem. In this paper, a new heuristic node placement algorithm, called Lookahead Algorithm, is proposed. Its performance is compared with the lower bounds derived in [1], as well as some existing algorithms in the literature. Significant reduction in weighted mean hop distance h_d is obtained, especially when the traffic distribution in ShuffleNets is highly skewed. Consider a ShuffleNet with 8 nodes, the h_d obtained using Lookahead Algorithm is only 1.90% above the lower bound under the skewed traffic distribution (with traffic skew factor γ = 100), and 16.04% under uniform random traffic distribution.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - Lookahead Algorithm for Node Placement Optimization in ShuffleNets
T2 - IEICE TRANSACTIONS on Communications
SP - 1527
EP - 1533
AU - Ho-Lun-T. WONG
AU - Kwan-L. YEUNG
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2000
AB - Node placement optimization in ShuffleNets is a combinatorial optimization problem. In this paper, a new heuristic node placement algorithm, called Lookahead Algorithm, is proposed. Its performance is compared with the lower bounds derived in [1], as well as some existing algorithms in the literature. Significant reduction in weighted mean hop distance h_d is obtained, especially when the traffic distribution in ShuffleNets is highly skewed. Consider a ShuffleNet with 8 nodes, the h_d obtained using Lookahead Algorithm is only 1.90% above the lower bound under the skewed traffic distribution (with traffic skew factor γ = 100), and 16.04% under uniform random traffic distribution.
ER -