RE: Question on hypercube routing

Article View: comp.hypercube

Article #11

#11

From: prismwarner.DECNET
Date: Tue, 14 Jul 1987 12:21

7 lines
1068 bytes

The answer to David Pase's question on hypercube routing is that quite a
bit of research has been done on optimal communication algorithms.  Probably
the most important paper is "Spanning Graphs for Optimum Broadcasting and
Persnalized Communication in Hypercubes" by S. Lennart Johnsson and Chieng-
Tien Ho, Department of Computer Science Tech Report #500, Yale University,
November 1986.  The bottom line is that while there are a number of very
simple routing algorithms, optimal algorithms are quite subtle.

Technical Details

Message-ID: <289@hubcap.UUCP>

Path:

arc1-ca.pugleaf.net!utzoo!utgpu!water!watmath!clyde!cbosgd!ucbvax!ucbcad!zen!ucla-cs!rutgers!husc6!bloom-beacon!gatech!hubcap!prism::warner.DECNET

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: arc1-ca.pugleaf.net!utzoo!utgpu!water!watmath!clyde!cbosgd!ucbvax!ucbcad!zen!ucla-cs!rutgers!husc6!bloom-beacon!gatech!hubcap!prism::warner.DECNET
From: prism::warner.DECNET@hubcap.UUCP
Newsgroups: comp.hypercube
Subject: RE: Question on hypercube routing
Message-ID: <289@hubcap.UUCP>
Date: Tue, 14-Jul-87 08:21:35 EDT
Article-I.D.: hubcap.289
Posted: Tue Jul 14 08:21:35 1987
Date-Received: Fri, 17-Jul-87 01:23:23 EDT
Sender: fpst@hubcap.UUCP
Lines: 7
Approved: hypercube@hubcap.clemson.edu