A deadlock avoidance method that minimizes the number of turn restrictions in wormhole routed networks is described. Fewer restrictions generally result in lower message latency and higher network bandwidth. The method is based on recursive partitioning of a graph model of the network and then removing interpartition edges to eliminate cycles. The method is applicable to a variety of network topologies including bidirectional multistage networks (BMIN), hypercubes, meshes, and irregular networks. In comparison to other algorithms, the method produces fewer or same number of turn restrictions on a set of benchmark networks.
By: Bulent Abali
Published in: RC20644 in 1996
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .