BLAM: A high-performance routing algorithm for virtual cut-through networks

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages

  Thottethodi, Mithuna ^a   Lebeck, Alvin R ^b   Mukherjee, Shubhendu S ^c  

^a PURDUE UNIVERSITY   (United States)

^b Duke University   (United States)

^c INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED PARAMETER NETWORKS; ROUTING ALGORITHMS;

COMMUNICATION PATTERN; HIGH PERFORMANCE ROUTING; IMPROVE PERFORMANCE; MINIMAL ADAPTIVE ROUTING; NETWORK CONFIGURATION; PROBABILISTIC GUARANTEES; ROUTING FLEXIBILITY; VIRTUAL CUT-THROUGH;

NETWORK ROUTING;

EID: 84947292530     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213133     Document Type: Conference Paper

References (31)

1. E. Baydal, P. Lopez, and J. Duato. A Simple and EfficientMechanism to Prevent Saturation in Wormhole Networks. In Proceedings. 14th International Parallel and Distributed Processing Symposium, pages 617-622, 2000.
2. The Chaotic Routing Project, Computer Science and Engineering Department, University of Washington. Standard for Presentation of Results. http://www. cs. washington. edu/research/projects/lis/chaos/www/presentation. html.
3. The Chaotic Routing Project, Computer Science and Engineering Department, University of Washington, Seattle. The Chaos Router Simulator. http://www. cs. washington. edu/research/projects/lis/chaos/ www/simulator. html.
4. A. Charlesworth. The Sun Fireplane Interconnect. IEEE Micro, 22(1):36-45, January/February 2002.
5. A. A. Chien and J. H. Kim. Planar-Adaptive Routing: Low-cost Adaptive Networks forMultiprocessors. In Proceedings of the 19th Annual International Symposium on Computer Architecture, pages 268-277, May 1992.
6. A. A. Chien and M. Konstantinidou. Workloads and Performance Metrics for Evaluating Parallel Interconnects. IEEE Computer Architecture Technical Committee Newsletter, pages 23-27, Summer-Fall 1994.
7. W. J. Dally. Virtual-Channel Flow Control. IEEE Transactions on Parallel and Distributed Systems, 3(2):194-205, March 1992.
8. W. J. Dally and C. L. Seitz. The TORUS routing chip. Journal of Distributed Computing, 1(3):187-196, October 1986.
9. W. J. Dally and C. L. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5):547-553, May 1987.
10. J. Duato. A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks. IEEE Transactions on Parallel and Distributed Systems, 4(12):1320-1331, December 1993.
11. J. Duato, S. Yalamanchili, and L. Ni. Interconnection Networks: An Engineering Approach, page 405. IEEE Computer Society Press, 1997.
12. P. T. Gaughan and S. Yalamanchili. Adaptive Routing Protocols for hypercube Interconnection Networks. IEEE Computer, 46(2):12-22, 1997.
13. C. J. Glass and L. M. Ni. The Turn Model for Adaptive Routing. In Proceedings of the 19th Annual International Symposium on Computer Architecture, pages 278-287, May 1992.
14. A. G. Greenberg and B. Hajek. Deflection routing in hypercube networks. IEEE Transactions on Communications, COM-40(6):1070-1081, June 1992.
15. P. Kermani and L. Kleinrock. Virtual Cut-Through : A New Computer Communication Switching technique. Computer Networks, 3:267-286, 1979.
16. J. H. Kim, Z. Liu, and A. A. Chien. Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing. In Proceedings of the 21st International Symposium on Computer Architecture, April 1994.
17. S. Konstantinidou and L. Snyder. The Chaos Router. IEEE Transactions on Computers, 43(12):1386-1397, December 1994.
18. Anjan K. V. And T. M. Pinkston. An Efficient, Fully Adaptive Deadlock Recovery Scheme : Disha. In Proceedings of the 22nd Annual International Symposium on Computer Architecture, pages 201-210, June 1995.
19. J. Laudon and D. Lenoski. The SGI Origin: A ccNUMA Highly Scalable Server. In Proceedings of the 24th International Symposium on Computer Architecture, pages 241-251, June 1997.
20. P. Lopez, J. M. Martinez, J. Duato, and F. Petrini. On the Reduction of Deadlock Frequency by Limiting Message Injection in Wormhole Networks. In Proceedings of Parallel Computer Routing and Communication Workshop, June 1997.
21. S. S. Mukherjee, P. Bannon, S. Lang, A. Spink, and D. Webb. The 21364 Network Architecture. IEEE Micro, 22(1):26-35, January/February 2002.
22. J. Y. Ngai and C. L. Seitz. A Framework for Adaptive Routing in Multicomputer Networks. In Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, pages 1-9, June 1989.
23. A. G. Nowatzyk, M. C. Browne, E. J. Kelly, and M. Parkin. S-Connect: from Networks ofWorkstations to Supercomputer Performance. In Proceedings of the 22nd Annual International Symposium on Computer Architecture, pages 71-82, June 1995.
24. S. L. Scott. Synchronization and Communication in the T3E Multiprocessor. In Proceedings of the Seventh Internation Conference on Architectural Support for Programming Languages and Operating Systems, pages 26-36, October 1996.
25. A. Smai and L. Thorelli. Global Reactive Congestion Control in Multicomputer Networks. In 5th International Conference on High Performance Computing, pages 179-186, 1998.
26. B. J. Smith. Architecture and Applications of the HEPMultiprocessor Computer System. In Proceedings of SPIE, pages 241-248, 1981.
27. C. B. Stunkel, D. G. Shea, and B. Abali et al. The SP2 High Performance Switch. IBM Systems Journal, 34(2):185-204, 1995.
28. The Superior Multiprocessor ARchiTecture (SMART) Interconnects Group, Electrical Engineering-Systems Department, University of Southern California. FlexSim. http://www. usc. edu/dept/ceng/pinkston/tools. html.
29. M. Thottethodi. Techniques for High Bandwidth, Low Latency Interconnection Network Operation at High Offered Loads. PhD thesis, Duke University, December 2002.
30. M. Thottethodi, A. R. Lebeck, and S. S. Mukherjee. Self-Tuned Congestion Control for Multiprocessor Networks. In Proceedings of the Seventh International Symposium on High Performance Computer Architecture (HPCA-7), pages 107-118, January 2001.
31. B. Towles and W. J. Dally. Worst-case Traffic for Oblivious Routing Functions. Computer Architecture Letters, 1, February 2002.