A parallel algorithm for traffic control problems in three-stage connecting networks

Nobuo Funabiki, Yoshiyasu Takefuji

研究成果: Article査読

2 被引用数 (Scopus)

抄録

A parallel heuristic algorithm for traffic control problems in three-stage connecting networks is presented in this paper. A three-stage connecting network consists of an input crossbar switching stage, an intermediate crossbar switching stage, and an output crossbar switching stage. The goal of our algorithm is to quickly and efficiently find a conflict-free switching assignment for communication demands through the network. The algorithm requires n2 × m processing elements for the network composed of n input/output switches and m intermediate switches, where it runs not only on a sequential machine, but also on a parallel machine with maximally n2 × m processors. The algorithm was verified by 1100 simulation runs with the network size from 102 × 7 to 502 × 27. The simulation results show that the algorithm can find a solution in nearly constant time with n2 × m processors.

本文言語English
ページ(範囲)236-240
ページ数5
ジャーナルJournal of Parallel and Distributed Computing
20
2
DOI
出版ステータスPublished - 1994 2

ASJC Scopus subject areas

  • ソフトウェア
  • 理論的コンピュータサイエンス
  • ハードウェアとアーキテクチャ
  • コンピュータ ネットワークおよび通信
  • 人工知能

フィンガープリント

「A parallel algorithm for traffic control problems in three-stage connecting networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル