[comp.parallel] Refs on routing algotrithms?

mikeg@monsoon.c3.lanl.gov (M. P. Gerlek) (04/28/91)

I'm looking for references on specific routing algorithms for k-ary
n-cube packet-switch networks.  Can anyone recommend a couple good
survey papers or comparison papers?

I'm particularly interested in "hot-potato" schemes to avoid deadlock,
and also in schemes that have actually been implemented in real
machines (as opposed to more papers that prove cyclic buffer
dependency leads to deadlock :-)

Thnak you.


-[mpg]
 mikeg@lanl.gov
 "The ducks are back!"

-- 
=========================== MODERATOR ==============================
Steve Stevenson                            {steve,fpst}@hubcap.clemson.edu
Department of Computer Science,            comp.parallel
Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabell

tk@wheat-chex.ai.mit.edu (Tom Knight) (05/03/91)

I'd recommend you look at a forthcoming paper in SPAA '91 (July)
"Fully Adaptive Minimal Deadlock Free Packet Routing in Hypercubes
Meshes and Other Networks" by Gustavo Pifarre et al. from IBM Almaden.

-- 
=========================== MODERATOR ==============================
Steve Stevenson                            {steve,fpst}@hubcap.clemson.edu
Department of Computer Science,            comp.parallel
Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabell