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

A near-optimal algorithm for gossiping in a d-dimensional mesh bus interconnection network

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)
Jagota, A. ; Dept. of Math. Sci., Memphis Univ., TN, USA

We present a near-optimal algorithm for gossiping in a d-dimensional mesh interconnection network (for arbitrary d⩾2) of busses, under the assumptions that a processor may send/receive simultaneously on all its ports, and message transmission takes unit time regardless of length. For d>2, this significantly improves the known upper bound for gossiping on the d-dimensional mesh bus. The algorithm has an interesting geometric characterization for d=3. We speculate on a possible improvement which, if realizable, would make the algorithm optimal for d=3

Published in:

Parallel Processing Symposium, 1995. Proceedings., 9th International

Date of Conference:

25-28 Apr 1995

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.