A comparison of input and output driven routers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1123, Issue , 1996, Pages 195-204

  Fulgham, Melanie L ^a   Snyder, Lawrence ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MESH NETWORKING;

INPUT AND OUTPUTS; LOW LATENCY; OUTPUT BUFFER; PARALLEL COMPUTER; TORUS NETWORKS; TRAFFIC PATTERN;

ROUTERS;

EID: 84955588076     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61626-8_25     Document Type: Conference Paper

References (20)

1. I. E Berman, L. Gravano, G. Pifarré, and J. Sanz. Adaptive deadlock- and livelock-free routing with all minimal paths in toms networks. In Proc. of SPAA, 1992.
2. M. Blumrich, K. Li, R. Alpert, C. Dubnicki, and E. Felten. Virtual memory mapped network interface for the SHRIMP multicomputer. In Proc. of lSCA, pages 142-153, 1994.
3. K. Bolding. Chaotic Routing: Design and Implementation of an Adaptive Multicomputer Network Router. PhD thesis, University of Washington, Seattle, July 1993.
4. K. Bolding, M. Fulgham, and L. Snyder. The case for chaotic adaptive routing. IEEE Transactions on Computers, to appear.
5. L. Cherkasova and T. Rokicki. Alpha message scheduling for packet-switched interconnects. Technical Report TR HPL-94-72, Hewlett-Packard Labs, 1994.
6. A. Chien and J. Kim. Planar-adaptive routing: Low-cost adaptive networks for multiprocessors. In Proc. of the Intl. Sym. on Computer Architecture, pages 268-277, 1992.
7. W. Daily. Virtual--channel flow control. In Proc. of the Intl. Sym. on Comp. Arch., May 1990.
8. W. Dally and C. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5):547-553, May 1987.
9. J. Duato. A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Transactions on Parallel and Distributed Systems, 4(4):466--475, Apr. 1993.
10. M. Fulgham and L. Snyder. A comparison of input and output driven routers. Technical Report UW-CSE-96-06-01, Univ. of Washington, Seattle, 1996.
11. M. Fulgham and L. Snyder. Triplex router: a versatile toms routing algorithm. Technical Report UW-CSE-96-01-11, Univ. of Washington, Seattle, 1996.
12. C. Glass and L. Ni. Adaptive routing in mesh-connected networks. In Proc. of the Intl. Conf. on Distributed Computing Systems, pages 12-19, 1992.
13. C. J. Glass and L. M. Ni. The turn model for adaptive routing. JACM, 41(5):874-902, 1994.
14. P. Kermani and L. Kleinrock. Virtual cut-through: A new computer communication switching technique. Computer Networks, 3:267-286, 1979.
15. S. Konstantinidou. The segment router: a novel router design for parallel computers. In Proc. of the Sym. of Parallel Algorithms and Architectures, pages 364-373, 1994.
16. S. Konstantinidon and L. Snyder. The chaos router. IEEE Transactions on Computers, 43(12):1386-97, Dec. 1994.
17. D. H. Linder and J. C. Harden. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Transactions on Computers, C-40(1):2-12, Jan. 1991.
18. N. McKenzie, K. Bolding, C. Ebeling, and L. Snyder. CRANIUM: An interface for message passing on adaptive packet routing networks. In Lecture Notes in Computer Science, volume 853, pages 266-80, 1994.
19. L. Schwiebert and D. Jayasimha. A universal proof technique for deadlock-free routing in interconnection networks. In Proc. of the Sym. on Par. Alg. and Arch., pages 175-184, 1995.
20. T. yon Eicken D.E. Culler, S. Goldstein, and K. Schauser. Active messages: a mechanism for integrated communication and computation. In Proc. of lSCA, pages 256-266, May 1992.