Analysis and simulation of multiplexed single-bus networks with and without buffering

Performance issues of a single-bus interconnection network for multiprocessor systems, operating in a multiplexed way, are presented in this paper. Several models are developed and used to allow system performance evaluation. Comparisons with equivalent crossbar systems are provided. It is shown how crossbar EBW values can be reached and exceeded when appropriate operation parameters are chosen in a multiplexed single-bus system. Another architectural feature is considered, concerning the utilization of buffers at the memory modules. With the buffering scheme, memory interference can be reduced so that the system performance is practically improved.Peer ReviewedPostprint (published version

Les micromàquines : l'alternativa per les PME

Partint de l'evident interès que per a les petites i mitjanes empreses presenta actualment un projecte d'automatitzar la seva estructura de gestió, tractarem de presentar breument algunes consideracions generals que ajuden a abordar el problema de seleccionar material microinformàtic

Les micromàquines : l'alternativa per les PME

Partint de l'evident interès que per a les petites i mitjanes empreses presenta actualment un projecte d'automatitzar la seva estructura de gestió, tractarem de presentar breument algunes consideracions generals que ajuden a abordar el problema de seleccionar material microinformàtic.Postprint (published version

Les micromàquines : l'alternativa per les PME

Partint de l'evident interès que per a les petites i mitjanes empreses presenta actualment un projecte d'automatitzar la seva estructura de gestió, tractarem de presentar breument algunes consideracions generals que ajuden a abordar el problema de seleccionar material microinformàtic

Optimal distance networks of low degree for parallel computers

We introduce and study a family of interconnection schemes, the Midimew networks, based on circulant graphs of degree 4. A family of such circulants is determined and shown to be optimal with respect to two distance parameters simultaneously, namely maximum distance and average distance, among all circulants of degree 4.. These graphs are regular, point-symmetric, and maximally connected, and one such optimal graph exists for any given number of nodes. The proposed interconnection schemes consist of mesh-connected networks with wrap-around links, and are isomorphic to the optimal distance circulants previously considered. Ways to construct one such network for any number of nodes are shown, their good properties to build interconnection schemes for multicomputers are examined, and some interesting particular cases are discussed. The problem of routing is also addressed, and a basic algorithm is provided which is adequate for implementing the routing policy required to convey messages, traversing shortest paths between nodes

Optimal distance networks of low degree for parallel computers

We introduce and study a family of interconnection schemes, the Midimew networks, based on circulant graphs of degree 4. A family of such circulants is determined and shown to be optimal with respect to two distance parameters simultaneously, namely maximum distance and average distance, among all circulants of degree 4.. These graphs are regular, point-symmetric, and maximally connected, and one such optimal graph exists for any given number of nodes. The proposed interconnection schemes consist of mesh-connected networks with wrap-around links, and are isomorphic to the optimal distance circulants previously considered. Ways to construct one such network for any number of nodes are shown, their good properties to build interconnection schemes for multicomputers are examined, and some interesting particular cases are discussed. The problem of routing is also addressed, and a basic algorithm is provided which is adequate for implementing the routing policy required to convey messages, traversing shortest paths between nodes

Reducción de la degradación y el conflicto en las redes de interconexión para sistemas multiprocesadores

Uno de los parámetros causante de una disminuación potencial de la eficiencia de un sistema multiprocesador es el tiempo de respuesta del subsistemas de memoria. En este trabajo se presentan diversas técnicas que mejoran el rendimiento del mecanismo que conecta procesadores a módulos de memoria (la red de la interconexión). El objetivo es conseguir reducir el conflicto (en los accesos a memoria) y la degradación (por el uso de lo enlaces de lared). Se consideran aquí redes de tipo crossbar, de buses y barajadas. La base de estas técnicas reside en proponer métodos que optimizen la selección de los enlaces (arbitraje inteligente), en usar multiplexado temporal de tales enlaces, y en la utilización de memorias rápidas.Postprint (published version

Analysis and simulation of multiplexed single-bus networks with and without buffering

Performance issues of a single-bus interconnection network for multiprocessor systems, operating in a multiplexed way, are presented in this paper. Several models are developed and used to allow system performance evaluation. Comparisons with equivalent crossbar systems are provided. It is shown how crossbar EBW values can be reached and exceeded when appropriate operation parameters are chosen in a multiplexed single-bus system. Another architectural feature is considered, concerning the utilization of buffers at the memory modules. With the buffering scheme, memory interference can be reduced so that the system performance is practically improved.Peer Reviewe