By Topic

Optimal fault-tolerant communication algorithms on product networks using spanning trees

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
$31 $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

2 Author(s)
Ohring, S.R. ; Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA ; Hohndel, D.H.

Over the last years cartesian product graphs have started to receive increasing attention as general class of networks for multiprocessor systems. One reason is that many efficient and popular networks such as the meshes, tori, hypercubes, hyper de Bruijn, product shuffle, and the newly proposed folded Petersen networks belong to this class of networks. Secondly, with the help of cartesian product graphs, a unique method for the design and analysis of a class of networks as well as techniques for embedding and communication algorithms can be provided. In this paper, first multiple arc-disjoint spanning trees are constructed on product networks with bidirectional links. These trees are utilized to design fault-tolerant algorithms for several important communication primitives assuming all-port communication. The problems under consideration include broadcasting, gossiping, scattering, and total exchange

Published in:

Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on

Date of Conference:

26-29 Oct 1994