RO EN
About message routing in different hypercube interconnection network types
Authors: M. Popa, M. Stratulat
The different hypercube interconnection network types considered were: the cube connected cycles network, the extended hypercube, the hypernet network, the k array n hypercube and the composed hypercube.
The obtained relationships are useful to establish the performances of the considered networks, from the total communication time point of view, making comparisons between them and between them and the classical hypercube interconnection network with the same number of nodes. The most advantageous interconnection network from the above mentioned point of view, is the composed hypercube with the dynamic position of the nodes.
– 0.15 Mb
Abstract
The paper treats the problem of message routing in different hypercube interconnection network types. Because the communication algorithms frequently use a few basic communication operations, the purpose was to optain relationships for the total communication time at the implementation of these basic operations in different hypercube interconnection types. The basic communication operations considered were: simple message transfer between two processors, one to all broadcast, all to all broadcast, one to all personalized communication, and all to all personalized communication. For establishing the desired relationships, the starting point were the relationships for the total communication time for the above mentioned operations implemented on three basic interconnection networks: classical hypercube, ring and mesh.The different hypercube interconnection network types considered were: the cube connected cycles network, the extended hypercube, the hypernet network, the k array n hypercube and the composed hypercube.
The obtained relationships are useful to establish the performances of the considered networks, from the total communication time point of view, making comparisons between them and between them and the classical hypercube interconnection network with the same number of nodes. The most advantageous interconnection network from the above mentioned point of view, is the composed hypercube with the dynamic position of the nodes.
M.Popa, M.Stratulat
Computer Science Department
"Politehnica" University of Timisoara
2 V. Parvan blvd., 1900,
Timisoara, ROMANIA
e-mail: ,
Computer Science Department
"Politehnica" University of Timisoara
2 V. Parvan blvd., 1900,
Timisoara, ROMANIA
e-mail: ,
Fulltext
– 0.15 Mb
Contents
- An algorithm for testing of gas distribution phases in the internal combustion engines
- Approximation procedures for data acquisition in testing systems
- About some classes of periodic orbits in a problem of two fixed centres
- Methods of solving of the optimal stabilization problem for stationary smooth control systems. Part I
- About message routing in different hypercube interconnection network types
- A small local computer network for automation of manufacture and scientific researches
- The main principles of small systems development for manifacturing and research automation
