Cart (Loading....) | Create Account
Close category search window
 

Algorithms and lower bounds for p-gossiping in circulant networks

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

1 Author(s)
Monakhova, E.A. ; Comput. Center, Acad. of Sci., Novosibirsk, Russia

In this paper we consider the broadcast and gossiping problems in circulant networks. The circulant graphs are studied extensively as reliable interconnection networks for the multiprocessor systems. We consider gossiping in the store-and-forward, full-duplex and shouting model for the case when communicating nodes can exchange up to a fixed number p of packets at each round of gossiping (p-gossiping). A general method for evaluation of the lower bounds for p-gossiping in circulant graphs is established. The parallel decentralized node-invariant broadcast and p-gossiping algorithms are proposed which provide a minimum execution time and a minimum of message loading of a network during message-passing

Published in:

Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings., Third International Symposium on

Date of Conference:

18-20 Dec 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.