Cargando…
Torus Pairwise Disjoint-Path Routing †
Modern supercomputers include hundreds of thousands of processors and they are thus massively parallel systems. The interconnection network of a system is in charge of mutually connecting these processors. Recently, the torus has become a very popular interconnection network topology. For example, t...
Autores principales: | Bossard, Antoine, Kaneko, Keiichi |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6264114/ https://www.ncbi.nlm.nih.gov/pubmed/30428614 http://dx.doi.org/10.3390/s18113912 |
Ejemplares similares
-
Cluster-Fault Tolerant Routing in a Torus
por: Bossard, Antoine, et al.
Publicado: (2020) -
Canine Algorithm for Node Disjoint Paths
por: Ananthalakshmi Ammal, R., et al.
Publicado: (2020) -
A Self-stabilizing One-To-Many Node Disjoint Paths Routing Algorithm in Star Networks
por: Hadid, Rachid, et al.
Publicado: (2020) -
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
por: Ganian, Robert, et al.
Publicado: (2020) -
The Edge-Disjoint Path Problem on Random Graphs by Message-Passing
por: Altarelli, Fabrizio, et al.
Publicado: (2015)