### 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 - Feb 1994 |

Externally published | Yes |

### ASJC Scopus subject areas

- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence

## Fingerprint Dive into the research topics of 'A parallel algorithm for traffic control problems in three-stage connecting networks'. Together they form a unique fingerprint.

## Cite this

*Journal of Parallel and Distributed Computing*,

*20*(2), 236-240. https://doi.org/10.1006/jpdc.1994.1022