Bounds on the Performance of Message Routing Heuristics

Authors:
P. J. Bernhard
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1993

Citing 4
Cited 0

Improving the performance guarantee for approximate graph coloring

Journal of the ACM (JACM)
Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks

IEEE Transactions on Computers - The MIT Press scientific computation series
An efficient method for representing and transmitting message patterns on multiprocessor interconnection networks

Journal of Parallel and Distributed Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	14.98

Visualization

Abstract

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 Omega (logN), respectively.