Detail publikace

The CSP-Based Simulation of Interconnection Networks and Routing Algorithms

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

Originální název

The CSP-Based Simulation of Interconnection Networks and Routing Algorithms

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

The paper shows that the model of communicating sequential processes is quite a natural tool for description of hardware systems composed of identical modules connected in a regular topology, such as interconnection networks for multiprocessors or multicomputers. Models have been developed for the most frequently used direct as well as indirect interconnections (torus, hypercube, Omega, fat-tree) and popular communication and routing algorithms have been implemented on these models. This makes possible measurement of communication times for various regular or random communication patterns in specific applications.

Klíčová slova

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

Autoři

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

Vydáno

1. 1. 1999

Místo

Rožnov pod Radhoštěm

ISBN

80-85988-33-X

Kniha

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

Strany od

43

Strany do

50

Strany počet

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",
  address="Rožnov pod Radhoštěm",
  isbn="80-85988-33-X"
}