A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square

DOI10.1016/J.INS.2007.10.028zbMath1141.68349OpenAlexW1983856038MaRDI QIDQ2476785

Dongmin Choi, Ilyong Chung, Okbin Lee

Publication date: 12 March 2008

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2007.10.028

zbMATH Keywords

recursive cube of ringsHamiltonian circuit Latin squareparallel routing algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Recursive cubes of rings as models for interconnection networks

Cites Work

• On reliability of the folded hypercubes
• Embedding meshes into crossed cubes
• A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Optimum broadcasting and personalized communication in hypercubes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square