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...
Main Authors: | Antoine Bossard, Keiichi Kaneko |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-11-01
|
Series: | Sensors |
Subjects: | |
Online Access: | https://www.mdpi.com/1424-8220/18/11/3912 |
Similar Items
-
Pairwise Disjoint Paths Routing in Tori
by: Keiichi Kaneko, et al.
Published: (2020-01-01) -
Set-to-Set Disjoint Path Routing in Bijective Connection Graphs
by: Keiichi Kaneko, et al.
Published: (2022-01-01) -
Cluster-Fault Tolerant Routing in a Torus
by: Antoine Bossard, et al.
Published: (2020-06-01) -
Set-to-Set Disjoint Paths Problem in Möbius Cubes
by: Hiroyuki Ichida, et al.
Published: (2022-01-01) -
Torus–Connected Cycles: A Simple and Scalable Topology for Interconnection Networks
by: Bossard Antoine, et al.
Published: (2015-12-01)