An optimal fault-tolerant broadcasting algorithm for a cube-connected cycles multiprocessor

The author develops a novel broadcasting algorithm in cube-connected-cycles (CCC) multiprocessors using a binomial tree. The initiating processor takes [h-1/2]+s (1+[h-1/2]) steps to broadcast the message to all other processors. The proposed broadcasting algorithm is a procedure by which a processor can pass a message to all other processors in the network nonredundantly: it is extremely important for diagnosis of the network, distribution agreement, or clock synchronization. The author also describes an optimal fault-tolerant broadcasting algorithm in the CCC which tolerates s-1 processors or s-1 ring failures. The algorithm takes 1+2* ([h-1/2])+s(1+[h-1/2]) steps to broadcast the message to all other processors in optimal fault-tolerant broadcasting