Detail výsledku

The CSP-Based Simulation of Interconnection Networks and Routing Algorithms

DVOŘÁK, V.; ČEJKA, R. The CSP-Based Simulation of Interconnection Networks and Routing Algorithms. Proceedings of the 33rd Spring International Conference Modelling and Simulation of Systems MOSIS'99, Vol. 2. Rožnov pod Radhoštěm: Marq software s.r.o., 1999. p. 43-50. ISBN: 80-85988-33-X.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Abstrakt

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.

Klíčová slova

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

Rok
1999
Strany
43–50
Sborník
Proceedings of the 33rd Spring International Conference Modelling and Simulation of Systems MOSIS'99, Vol. 2
Konference
33rd Spring International Conference Modelling and Simulation of Systems MOSIS'99
ISBN
80-85988-33-X
Vydavatel
Marq software s.r.o.
Místo
Rožnov pod Radhoštěm
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"
}
Výzkumné skupiny
Pracoviště
Nahoru