A Parallel Algorithm for Traffic Control Problems in Three-Stage Connecting Networks

N. Funabiki, Yoshiyasu Takefuji

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)236-240
Number of pages5
JournalJournal of Parallel and Distributed Computing
Volume20
Issue number2
DOIs
Publication statusPublished - 1994 Feb

Fingerprint

Traffic Control
Traffic control
Parallel algorithms
Parallel Algorithms
Control Problem
Switches
Sequential machines
Switch
Heuristic algorithms
Output
Parallel Machines
Time Constant
Heuristic algorithm
Simulation
Assignment
Communication
Processing

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Hardware and Architecture
  • Computer Science Applications

Cite this

A Parallel Algorithm for Traffic Control Problems in Three-Stage Connecting Networks. / Funabiki, N.; Takefuji, Yoshiyasu.

In: Journal of Parallel and Distributed Computing, Vol. 20, No. 2, 02.1994, p. 236-240.

Research output: Contribution to journalArticle

@article{9343977e124f4387a47623d62dbed356,
title = "A Parallel Algorithm for Traffic Control Problems in Three-Stage Connecting Networks",
abstract = "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.",
author = "N. Funabiki and Yoshiyasu Takefuji",
year = "1994",
month = "2",
doi = "10.1006/jpdc.1994.1022",
language = "English",
volume = "20",
pages = "236--240",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - A Parallel Algorithm for Traffic Control Problems in Three-Stage Connecting Networks

AU - Funabiki, N.

AU - Takefuji, Yoshiyasu

PY - 1994/2

Y1 - 1994/2

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

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

UR - http://www.scopus.com/inward/record.url?scp=33747683570&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33747683570&partnerID=8YFLogxK

U2 - 10.1006/jpdc.1994.1022

DO - 10.1006/jpdc.1994.1022

M3 - Article

VL - 20

SP - 236

EP - 240

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 2

ER -