TY - JOUR T1 - Load balancing and routing on the hypercube and related networks JF - Journal of Parallel and Distributed Computing Y1 - 1992 A1 - JaJa, Joseph F. A1 - Ryu,Kwan Woo AB - Several results related to the load balancing problem on the hypercube, the shuffle-exchange, the cube-connected cycles, and the butterfly are shown. Implications of these results for routing algorithms are also discussed. Our results include the following: •⊎ Efficient load balancing algorithms are found for the hypercube, the shuffle-exchange, the cube-connected cycles, and the butterfly. • ⊎ Load balancing is shown to require more time on a p-processor shuffle-exchange, cube-connected cycle or butterfly than on a p-processor weak hypercube. • ⊎ Routing n packets on a p-processor hypercube can be done optimally whenever n = p1+1/k, for any fixed k > 0. VL - 14 SN - 0743-7315 UR - http://www.sciencedirect.com/science/article/pii/074373159290081W CP - 4 M3 - 10.1016/0743-7315(92)90081-W ER -