Worst-case traffic for oblivious routing functions

IEEE Computer Architecture Letters

Volumn 1, Issue 1, 2002, Pages 4-

  Towles, Brian ^a   Dally, William J ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85008024905     PISSN: 15566056     EISSN: None     Source Type: Journal    
DOI: 10.1109/L-CA.2002.12     Document Type: Article

References (12)

1. W. J. Dally, P. P. Carvey, and L. R. Dennison, “The Avici terabit switch/router,” in Conference Record of Hot Interconnects 6, August 1998, pp. 41–50.
2. InfiniBand Trade Association, “InfiniBand architecture specification,” http://www.infinibandta.org
3. T. Nesson and S. L. Johnsson, “ROMM routing on mesh and torus networks,” in Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures. 1995. pp. 275–287.
4. K. Bolding, M. Fulgham, and L. Snyder, “The case for chaotic adaptive routing,” IEEE Trans, on Computers, vol. 46, no. 12, pp. 1281–1292, December 1997.
5. A. Borodin and J. Hopcroft, “Routing, merging, and sorting on parallel models of computation,” Journal of Computer and System Sciences, vol. 30, pp. 130–145, 1985.
6. C. Kaklamanis, D. Krizanc, and A. Tsantilas, “Tight bounds for oblivious routing in the hypercube,” in Proc. 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990, pp. 31–36.
7. F. T. Leighton, B. M. Maggs, A. Ranade, and S. B. Rao, “Randomized routing and sorting on fixed connection networks,” Journal of Algorithms, vol. 17. no. 1. pp. 157–205. July 1994.
8. L. Peh and W. J. Dally, “A delay model and speculative architecture for pipelined routers,” in Proc. of the 7th Int. Symposium on High-Performance Computer Architecture, January 2001, pp. 255–266.
9. J. Duato, S. Yalamanchili, and L. Ni, Interconnection Networks: an engineering approach, IEEE Computer Society Press, 1997.
10. G. Birkhoff, “Tres observaciones sobre el algebra lineal,” Univ. Nac. Tucuman Rev. Ser. A, vol. 5, pp. 147–151, 1946.
11. H. Kuhn, “The Hungarian method for the assignment problem,” Naval Res. Logist. Q., vol. 2, pp. 83–97, 1955.
12. B. Towles, “Finding worst-case permutations for oblivious routing algorithms,” CVA Technical Report 121, Stanford University, December 2001.