Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!elroy.jpl.nasa.gov!ncar!gatech!hubcap!fpst
From: mikeg@monsoon.c3.lanl.gov (M. P. Gerlek)
Newsgroups: comp.parallel
Subject: [comp.parallel post] Refs on routing algotrithms?
Message-ID: <1991Apr29.175346.19681@hubcap.clemson.edu>
Date: 28 Apr 91 00:24:53 GMT
Sender: fpst@hubcap.clemson.edu (Steve Stevenson)
Organization: Clemson University
Lines: 24
Approved: parallel@hubcap.clemson.edu
To: fpst@hubcap.clemson.edu


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