Lookahead Algorithm for Node Placement Optimization in ShuffleNets

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2000-07-25

著者

• Yeung Kwan-l.

  The Department Of Electronic Engineering City University Of Hong Kong

• WONG Ho-Lun-T.

  The Department of Electronic Engineering, City University of Hong Kong

• Wong Ho-lun-t.

  The Department Of Electronic Engineering City University Of Hong Kong

関連論文

• Lookahead Algorithm for Node Placement Optimization in ShuffleNets

スポンサーリンク