Set-to-Set Disjoint Path Routing in Bijective Connection Graphs

Set-to-Set Disjoint Path Routing in Bijective Connection Graphs

The bijective connection graph encompasses a family of cube-based topologies, and <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>-dimensional bijective connection graphs include the hypercube and almost all of its variants with the order...

Full description

Bibliographic Details
Main Authors: Keiichi Kaneko, Antoine Bossard, Frederick C. Harris
Format: Article
Language:English
Published: IEEE 2022-01-01
Series:IEEE Access
Subjects:
Dependable computing
interconnection network
hypercube
multicomputer
parallel processing
performance evaluation supercomputers
Online Access:https://ieeexplore.ieee.org/document/9815582/

Internet

https://ieeexplore.ieee.org/document/9815582/

Similar Items