Title :
Broadcasting on incomplete hypercubes
Author :
Tien, Jenn-Yang ; Ho, Ching-Tien ; Yang, Wei-Pang
Author_Institution :
Chung Shan Inst. of Sci. & Technol., Lung-Tan, Taiwan
fDate :
11/1/1993 12:00:00 AM
Abstract :
Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes. The authors devise and analyze a broadcasting algorithm based on edge-disjoint spanning trees in an incomplete hypercube of 2n+2k nodes, where 0⩽k<n. The broadcasting algorithm is strictly optimal
Keywords :
delays; hypercube networks; trees (mathematics); broadcasting algorithm; edge-disjoint spanning trees; faulty nodes; incomplete hypercube; Algorithm design and analysis; Bandwidth; Broadcasting; Costs; Flexible manufacturing systems; Hardware; Hypercubes; Routing; Topology; Tree graphs;
Journal_Title :
Computers, IEEE Transactions on
