scientific article; zbMATH DE number 139908

MaRDI QIDQ4028248zbMATH OpenFDO

Authors Shahram Latifi

Publication date 28 March 1993

zbMATH Keywords

Hamming distancehypercubeconflict- free routesgeneralized dimension permutation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)

Recommendations

• Conflict-free routing for BPC-permutations on synchronous hypercubes
• Generalized shuffle permutations on Boolean cubes
• A method for data allocation and manipulation in hypercube computers
• Hypercube permutations routable under all dimension orderings
• Routing automorphisms of the hypercube

Cited in

(5)

• Routing automorphisms of the hypercube
• Nonblockability of switches with the Cayley graph structure for serial transfer of data blocks. Generalized hypercubes and multidimensional grids
• A method for data allocation and manipulation in hypercube computers
• Generalized shuffle permutations on Boolean cubes
• Conflict-free routing for BPC-permutations on synchronous hypercubes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028248)