An Efficient Buffered Wormhole Routing Scheme

J. Ge (USA)


torus interconnection network, buffered wormhole routing, deadlock-free, performance simulation.


A new dynamically balanced wormhole routing scheme uses balanced assignments of buffers to distribute the workload evenly throughout the rings of a torus network, resulting in significant performance improvement. The algorithms derived from it are demonstrated to be deadlock-free and are more efficient in using buffer space than their counterparts.

Important Links:

Go Back