A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square
From MaRDI portal
Publication:2476785
Recommendations
- Computational and Information Science
- Application of the special Latin square to a parallel routing algorithm on a recursive circulant network.
- A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square
- scientific article; zbMATH DE number 1240772
- Parallel routing algorithms for incomplete hypercube interconnection networks
Cites work
- scientific article; zbMATH DE number 3906496 (Why is no real title available?)
- scientific article; zbMATH DE number 3458508 (Why is no real title available?)
- scientific article; zbMATH DE number 3633709 (Why is no real title available?)
- scientific article; zbMATH DE number 3443668 (Why is no real title available?)
- A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Embedding meshes into crossed cubes
- On reliability of the folded hypercubes
- Optimum broadcasting and personalized communication in hypercubes
Cited in
(4)- Application of the special Latin square to a parallel routing algorithm on a recursive circulant network.
- Computational and Information Science
- A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square
- Recursive cubes of rings as models for interconnection networks
This page was built for publication: A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476785)