### 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 n^{2} × 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 n^{2} × m processors. The algorithm was verified by 1100 simulation runs with the network size from 10^{2} × 7 to 50^{2} × 27. The simulation results show that the algorithm can find a solution in nearly constant time with n^{2} × m processors.

Original language | English |
---|---|

Pages (from-to) | 236-240 |

Number of pages | 5 |

Journal | Journal of Parallel and Distributed Computing |

Volume | 20 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1994 Feb |

### Fingerprint

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

Research output: Contribution to journal › Article

*Journal of Parallel and Distributed Computing*, vol. 20, no. 2, pp. 236-240. https://doi.org/10.1006/jpdc.1994.1022

}

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 -