Title :
All-to-all broadcasting in faulty hypercubes
Author :
Park, Seungjin ; Bose, Bella
Author_Institution :
Dept. of Comput. Sci., Kyonggi Univ., South Korea
fDate :
7/1/1997 12:00:00 AM
Abstract :
A new fault-tolerant all-to-all broadcasting algorithm in an n-dimensional hypercube with up to [n/2] faulty links is given. An extension of this algorithm that can tolerate up to [n/2] faulty nodes is also described. These algorithms assume a multiport I/O model, meaning each node can send and receive messages from all its adjacent nodes simultaneously. The total time steps taken by the proposed algorithms are near optimal, and they produce a factor of n less traffic than previously known algorithms
Keywords :
fault tolerant computing; hypercube networks; telecommunication network routing; all-to-all broadcasting; fault-tolerant all-to-all broadcasting algorithm; faulty hypercubes; multiport I/O model; n-dimensional hypercube; Algorithm design and analysis; Broadcasting; Computer science; Fault tolerance; Fault tolerant systems; Helium; Hypercubes; Routing; Telecommunication traffic; Traffic control;
Journal_Title :
Computers, IEEE Transactions on
