The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Le maillage bidimensionnel est largement considéré comme une architecture parallèle prometteuse en termes d’évolutivité. Dans cette architecture, les processeurs sont naturellement placés aux intersections de grilles horizontales et verticales, alors qu'il peut y avoir trois types différents de liens de communication : (i) Le premier type est le modèle le plus populaire, appelé ordinateur connecté au maillage: Chaque processeur est connecté à ses quatre voisins par des connexions locales. (ii) Chaque processeur du deuxième type est connecté à quelques bus (ligne et colonne). Le système est alors appelé un maillage de bus. (iii) Le troisième modèle est équipé à la fois de bus et de connexions locales, appelé ordinateur connecté au maillage avec bus. Le routage maillé a reçu une attention considérable au cours des deux dernières décennies et divers algorithmes ont été proposés. Cet article fournit un aperçu des limites inférieures et supérieures des algorithmes, avec des pointeurs vers la littérature, et suggère d'autres orientations de recherche pour le routage de maillage.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Kazuo IWAMA, Eiji MIYANO, "Recent Developments in Mesh Routing Algorithms" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 3, pp. 530-540, March 2000, doi: .
Abstract: The two dimensional mesh is widely considered to be a promising parallel architecture in its scalability. In this architecture, processors are naturally placed at intersections of horizontal and vertical grids, while there can be three different types of communication links: (i) The first type is the most popular model, called a mesh-connected computer: Each processor is connected to its four neighbours by local connections. (ii) Each processor of the second type is connected to a couple of (row and column) buses. The system is then called a mesh of buses. (iii) The third model is equipped with both buses and local connections, which is called a mesh-connected computer with buses. Mesh routing has received considerable attention for the last two decades, and a variety of algorithms have been proposed. This paper provides an overview of lower and upper bounds for algorithms, with pointers to the literature, and suggests further research directions for mesh routing.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_3_530/_p
Copier
@ARTICLE{e83-d_3_530,
author={Kazuo IWAMA, Eiji MIYANO, },
journal={IEICE TRANSACTIONS on Information},
title={Recent Developments in Mesh Routing Algorithms},
year={2000},
volume={E83-D},
number={3},
pages={530-540},
abstract={The two dimensional mesh is widely considered to be a promising parallel architecture in its scalability. In this architecture, processors are naturally placed at intersections of horizontal and vertical grids, while there can be three different types of communication links: (i) The first type is the most popular model, called a mesh-connected computer: Each processor is connected to its four neighbours by local connections. (ii) Each processor of the second type is connected to a couple of (row and column) buses. The system is then called a mesh of buses. (iii) The third model is equipped with both buses and local connections, which is called a mesh-connected computer with buses. Mesh routing has received considerable attention for the last two decades, and a variety of algorithms have been proposed. This paper provides an overview of lower and upper bounds for algorithms, with pointers to the literature, and suggests further research directions for mesh routing.},
keywords={},
doi={},
ISSN={},
month={March},}
Copier
TY - JOUR
TI - Recent Developments in Mesh Routing Algorithms
T2 - IEICE TRANSACTIONS on Information
SP - 530
EP - 540
AU - Kazuo IWAMA
AU - Eiji MIYANO
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2000
AB - The two dimensional mesh is widely considered to be a promising parallel architecture in its scalability. In this architecture, processors are naturally placed at intersections of horizontal and vertical grids, while there can be three different types of communication links: (i) The first type is the most popular model, called a mesh-connected computer: Each processor is connected to its four neighbours by local connections. (ii) Each processor of the second type is connected to a couple of (row and column) buses. The system is then called a mesh of buses. (iii) The third model is equipped with both buses and local connections, which is called a mesh-connected computer with buses. Mesh routing has received considerable attention for the last two decades, and a variety of algorithms have been proposed. This paper provides an overview of lower and upper bounds for algorithms, with pointers to the literature, and suggests further research directions for mesh routing.
ER -