Publication detail

The CSP-Based Simulation of Interconnection Networks and Routing Algorithms

DVOŘÁK, V. ČEJKA, R.

Original Title

The CSP-Based Simulation of Interconnection Networks and Routing Algorithms

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

The paper shows that the model of communicating sequential processes isquite a natural tool for description of hardware systems composed ofidentical modules connected in a regular topology, such asinterconnection networks for multiprocessors or multicomputers. Modelshave been developed for the most frequently used direct as well asindirect interconnections (torus, hypercube, Omega, fat-tree) andpopular communication and routing algorithms have been implemented onthese models. This makes possible measurement of communication timesfor various regular or random communication patterns in specificapplications.

Keywords

Interconnection networks, communicating sequential processes (CSP), communication algorithms

Authors

DVOŘÁK, V.; ČEJKA, R.

Released

1. 1. 1999

Publisher

Marq software s.r.o.

Location

Rožnov pod Radhoštěm

ISBN

80-85988-33-X

Book

Proceedings of the 33rd Spring International Conference Modelling and Simulation of Systems MOSIS'99, Vol. 2

Pages from

43

Pages to

50

Pages count

8

BibTex

@inproceedings{BUT192271,
  author="Václav {Dvořák} and Rudolf {Čejka}",
  title="The CSP-Based Simulation of Interconnection Networks and Routing Algorithms",
  booktitle="Proceedings of the 33rd Spring International Conference Modelling and Simulation of Systems MOSIS'99, Vol. 2",
  year="1999",
  pages="43--50",
  publisher="Marq software s.r.o.",
  address="Rožnov pod Radhoštěm",
  isbn="80-85988-33-X"
}