RE: Question on hypercube routing

Thread View: comp.hypercube

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by prismwarner.DECNET Tue, 14 Jul 1987 12:21

#11

Author: 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.

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads