Randomized routing on generalized hypercubes

DOI10.1016/0304-3975(95)00041-0MaRDI QIDQ1351447zbMATH OpenOpenAlexFDO

Authors Afonso G. Ferreira, Miltos D. Grammatikakis

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(95)00041-0

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10) Computer system organization (68M99)

Recommendations

• Almost optimal permutation routing on hypercubes
• Fast algorithms for bit-serial routing on a hypercube
• Randomized Single-Target Hot-Potato Routing
• Some permutation routing algorithms for low-dimensional hypercubes

Cites work

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A Scheme for Fast Parallel Communication
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• On the Distribution of the Number of Successes in Independent Trials

Cited in

(5)

• A collision model for randomized routing in fat-tree networks
• Routing properties of supercubes
• scientific article; zbMATH DE number 1222837 (Why is no real title available?)
• Almost optimal permutation routing on hypercubes
• Congestion-free Optimal Routings of Hypercube Automorphisms

This page was built for publication: Randomized routing on generalized hypercubes

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