Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!utgpu!water!watmath!clyde!cbosgd!ucbvax!hplabs!gatech!hubcap!Wen-King From: Wen-King@hubcap.UUCP Newsgroups: comp.hypercube Subject: Re: Question on hypercube routing Message-ID: <291@hubcap.UUCP> Date: Tue, 14-Jul-87 08:25:58 EDT Article-I.D.: hubcap.291 Posted: Tue Jul 14 08:25:58 1987 Date-Received: Fri, 17-Jul-87 04:25:56 EDT Sender: fpst@hubcap.UUCP Lines: 17 Approved: hypercube@hubcap.clemson.edu In article <285@hubcap.UUCP> ravi@CS.UCLA.EDU writes: <>The obvious solution to this problem is to randomly choose the directionbits that differ instead of scanning from right to left or left to right. each message at a randomly chosen bit for that message. If you do this, you may have problems with deadlock due to lack of queue space along the path of the message. One reason for using the routing algorithm described by pase in his article is that the algorithm is proven to be deadlock free provided that the destination node will eventually consumes all messages it receives. This particular routing algorithm is call the e-cube routing algorithm. +--------------------------------------------------------------------------+ | Wen-King Su wen-king@vlsi.caltech.edu Caltech Corp of Cosmic Engineers | +--------------------------------------------------------------------------+