🚀 go-pugleaf

In article <285@hubcap.UUCP> ravi@CS.UCLA.EDU writes:
<>The obvious solution to this problem is to randomly choose the direction
 <in which the message should be routed, i.e. randomly choose one of the
 >bits that differ instead of scanning from right to left or left to right. 
 <Another possibility is that one could start the left to right scanning for 
 >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 |
+--------------------------------------------------------------------------+