By Topic

Bounds on the performance of message routing heuristics

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)
Bernhard, P.J. ; Dept. of Comput. Sci., Clemson Univ., SC, USA

Let S be a set of messages to be routed on an N×N omega network. In addition, suppose that S contains communication conflicts. One strategy to deal with such conflicts is to partition S into some number of subsets, called rounds, such that each subset is conflict-free. The messages are then routed through the network by successively routing the messages in each subset. The minimum round partitioning problem is the problem of partitioning a given message set into a minimum number of rounds. The author establishes upper and lower bounds on the performance ratio for two heuristics for partitioning message patterns into rounds. For both of these heuristics they give upper and lower bounds of O (log N) and Ω(logN), respectively

Published in:

Computers, IEEE Transactions on  (Volume:42 ,  Issue: 10 )