L-Networks: A Topological Model for Regular 2D Interconnection Networks
From MaRDI portal
Publication:5274445
Cited in
(4)- Effective algorithm for finding shortest paths in dense Gaussian networks
- The diameter of rectangular twisted torus
- Modeling and resource cost estimation of routing algorithms in networks on a chip with a two-dimensional circulant topology
- A scalable approach to co-design of topologies and routing algorithms for families of optimal degree-four circulant networks
This page was built for publication: L-Networks: A Topological Model for Regular 2D Interconnection Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5274445)