메뉴 건너뛰기




Volumn , Issue , 2002, Pages 162-169

Layered shortest path (LASH) routing in irregular system area networks

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84929574892     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2002.1016559     Document Type: Conference Paper
Times cited : (59)

References (18)
  • 5
    • 0023346637 scopus 로고
    • Deadlock-free message routing in multiprocessor interconnection networks
    • W. J. Dally and C. L. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5):547-553, 1987.
    • (1987) IEEE Transactions on Computers , vol.C-36 , Issue.5 , pp. 547-553
    • Dally, W.J.1    Seitz, C.L.2
  • 7
    • 2142786105 scopus 로고
    • Autonet: A high-speed, self-configuring local area network using point-to-point links
    • Digital Equipment Corporation
    • M. D. S. et.al. Autonet: a high-speed, self-configuring local area network using point-to-point links. SRC Research Report 59, Digital Equipment Corporation, 1990.
    • (1990) SRC Research Report
    • S, M.D.1
  • 9
    • 0030819327 scopus 로고    scopus 로고
    • Spider: A high speed network interconnect
    • Feb.
    • M. Galles. Spider: A high speed network interconnect. IEEE Micro, pages 34-39, Feb. 1997.
    • (1997) IEEE Micro , pp. 34-39
    • Galles, M.1
  • 10
    • 0029252110 scopus 로고
    • Tnet: A reliable system area network
    • R. W. Horst. Tnet: A reliable system area network. IEEE Micro, 15(1):37-45, 1995.
    • (1995) IEEE Micro , vol.15 , Issue.1 , pp. 37-45
    • Horst, R.W.1
  • 11
    • 0018518295 scopus 로고
    • Virtual cut-through: A new computer communication switching technique
    • P. Kermani and L. Kleinrock. Virtual cut-through: A new computer communication switching technique. Computer Networks, 3:267-286, 1979.
    • (1979) Computer Networks , vol.3 , pp. 267-286
    • Kermani, P.1    Kleinrock, L.2
  • 12
    • 0025746735 scopus 로고
    • An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
    • D. H. Linder and J. C. Harden. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Transactions on Computers, 40(1):2-12, 1991.
    • (1991) IEEE Transactions on Computers , vol.40 , Issue.1 , pp. 2-12
    • Linder, D.H.1    Harden, J.C.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.