|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
A.S. Acampora and S.i.A. Shah. Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing. In Pvoc. iEEE INFO- COM, pages 10-19. IEEE Computer Society Press, 1991.
|
 |
2
|
B. Aiello , F. T. Leighton , B. Maggs , M. Newman, Fast algorithms for bit-serial routing on a hypercube, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.55-64, July 02-06, 1990, Island of Crete, Greece
[doi> 10.1145/97444.97459]
|
| |
3
|
|
| |
4
|
|
| |
5
|
|
| |
6
|
W. J. Dally, Finite-grain message passing concurrent computers, Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues, p.2-12, January 19-20, 1988, Pasadena, California, United States
[doi> 10.1145/62297.62298]
|
| |
7
|
|
| |
8
|
|
| |
9
|
U. Feige and P. Raghavan. Exact analysis of Hot Potato routing. In 33rd Annual Symposium on Foundations of Computer Science, pages 553-562, October 1992.
|
| |
10
|
S. Felperin, P. Raghavan, and E. Upfal. A theory of wormhole routing in parallel computers. In 33rd Annual Symposium on Foundations of Computer Science, pages 563-572, October 1992.
|
| |
11
|
A.G. Greenberg and J. Goodman. Sharp approximate models of deflection routing in mesh networks. To appear in iEEE Trans. Communications.
|
| |
12
|
A.G. Greenberg and B. Hajek. Deflection routing in hypercube networks. IEEE Trans. Communications, 40:1070-1081, 1992.
|
| |
13
|
|
| |
14
|
|
| |
15
|
D.H. Lawrie and D.A. Padua. Analysis of message switching with shuffle-exchanges in multiprocessots. in Interconnection Networks. IEEE Computer Society Press, 1984.
|
| |
16
|
N.F. Maxemchuk. Comparison of deflection and store and forward techniques in the Manhattan street and shuffle exchange networks. In Proc. IEEE INFOCOM, pages 800-809. IEEE Computer Society Press, 1989.
|
| |
17
|
|
| |
18
|
i. Newman and A. Schuster. Hot-potato algorithms for permutation routing. Technical Report -9201, CS Department, Technion, Israel, November 1992.
|
| |
19
|
R. Prater. An algorithm for routing in hypercube networks. Master's thesis, University of Toronto, September 1986.
|
| |
20
|
D.S. Reeves, E.F. Gehringer, and A. Chandiramani. Adaptive routing and deadlock recovery: a simulation study. In Fourth Conference on Hypercube Concurrent Computersand Applications, pages 331-337. Golden Gate Enterprises, 1989.
|
| |
21
|
C. L. Seitz , W. C. Athas , C. M. Flaig , A. J. Martin , J. Seizovic , C. S. Steele , W-K. Su, The architecture and programming of the Ametek series 2010 multicomputer, Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues, p.33-37, January 19-20, 1988, Pasadena, California, United States
[doi> 10.1145/62297.62302]
|
| |
22
|
B. Smith. Architecture and applications of the HEP multiprocessor computer system. In Proc. Real Time Signal Processing IV, pages 241-248. SPIE, 1981.
|
| |
23
|
R.J. Smith Ii. Experimental system kit hardware. In Fourth Conference on Hypercube Concurrent Computers and Applications, pages 713-725. Golden Gate Enterprises, 1989.
|
| |
24
|
T. Szymanski. An analysis of "Hot Potato" routing in a fiber optic packet switched hypercube. In Proc. IEEE INFOCOM, pages 918-925. IEEE Computer Society Press, 1990.
|
| |
25
|
Z. Zhang and A.S. Acampora. Performance analysis of multihop lightwave networks with hot potato routing and distance age priorities. In Proc. IEEE INFOCOM, pages 1012-1021. IEEE Computer Society Press, 1991.
|
CITED BY 12
|
|
|
|
|
Robert Cypher , Friedhelm Meyer auf der Heide , Christian Scheideler , Berthold Vöcking, Universal algorithms for store-and-forward and wormhole routing, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.356-365, May 22-24, 1996, Philadelphia, Pennsylvania, United States
|
|
|
Stephen Alstrup , Jacob Holm , Kristian de Lichtenberg , Mikkel Thorup, Direct routing on trees, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.342-349, January 25-27, 1998, San Francisco, California, United States
|
|
|
|
|
|
Amir Ben-Dor , Shai Halevi , Assaf Schuster, Potential function analysis of greedy hot-potato routing, Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, p.225-234, August 14-17, 1994, Los Angeles, California, United States
|
|
|
Costas Busch , Maurice Herlihy , Roger Wattenhofer, Randomized greedy hot-potato routing, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.458-466, January 09-11, 2000, San Francisco, California, United States
|
|
|
Donald D. Chinn , Tom Leighton , Martin Tompa, Minimal adaptive routing on the mesh with bounded queue size, Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, p.354-363, June 27-29, 1994, Cape May, New Jersey, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
C.2