By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jang, J.E. ; Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA

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

Published in:

Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on

Date of Conference:

7-9 Mar 1990