메뉴 건너뛰기




Volumn 46, Issue 11, 2000, Pages 1019-1032

An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors

Author keywords

Adaptive routing; Distributed shared memory multiprocessors; Interconnection networks; Tree based multicast; Wormhole switching

Indexed keywords


EID: 0000549171     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1383-7621(00)00007-2     Document Type: Article
Times cited : (33)

References (22)
  • 3
    • 0023346637 scopus 로고
    • Deadlock-free message routing in multiprocessor interconnection networks
    • W.J. Dally, C.L. Seitz, Deadlock-free message routing in multiprocessor interconnection networks, IEEE Trans. Comp. C-36 (5) (1987) 547-553.
    • (1987) IEEE Trans. Comp. , vol.C-36 , Issue.5 , pp. 547-553
    • Dally, W.J.1    Seitz, C.L.2
  • 4
    • 0027837827 scopus 로고
    • A new theory of deadlock-free adaptive routing in wormhole networks
    • J. Duato, A new theory of deadlock-free adaptive routing in wormhole networks, IEEE Trans. Parallel Distrib. Syst. 4 (12) (1993) 1320-1331.
    • (1993) IEEE Trans. Parallel Distrib. Syst. , vol.4 , Issue.12 , pp. 1320-1331
    • Duato, J.1
  • 5
  • 6
    • 0029373905 scopus 로고
    • A new theory of deadlock-free adaptive multicast routing in wormhole networks
    • J. Duato, A new theory of deadlock-free adaptive multicast routing in wormhole networks, IEEE Trans. Parallel Distrib. Syst. 6 (9) (1995) 976-987.
    • (1995) IEEE Trans. Parallel Distrib. Syst. , vol.6 , Issue.9 , pp. 976-987
    • Duato, J.1
  • 8
    • 0018518295 scopus 로고
    • Virtual Cut-through: A new computer communication switching technique
    • P. Kermani, L. Kleinrock, Virtual Cut-through: a new computer communication switching technique, Comput. Networks 3 (1979) 267-286.
    • (1979) Comput. Networks , vol.3 , pp. 267-286
    • Kermani, P.1    Kleinrock, L.2
  • 10
    • 0026839484 scopus 로고
    • The stanford dash multiprocessor
    • D. Lenoski, J. Laudon et al., The Stanford dash multiprocessor, IEEE Comput. 25 (3) (1992) 63-79.
    • (1992) IEEE Comput. , vol.25 , Issue.3 , pp. 63-79
    • Lenoski, D.1    Laudon, J.2
  • 15
    • 0029341372 scopus 로고
    • The message flow model for routing in wormhole-routed networks
    • X. Lin, P.K. McKinley, L.M. Ni, The message flow model for routing in wormhole-routed networks, IEEE Trans. Parallel Distrib. Syst. 6 (7) (1995) 755-760.
    • (1995) IEEE Trans. Parallel Distrib. Syst. , vol.6 , Issue.7 , pp. 755-760
    • Lin, X.1    McKinley, P.K.2    Ni, L.M.3
  • 20
    • 0029227322 scopus 로고
    • Global reduction in wormhole k-ary n-cube networks with multidestination exchange worms
    • April
    • D.K. Panda, Global reduction in wormhole k-ary n-cube networks with multidestination exchange worms, in: Proceedings of the International Parallel Processing Symposium, April 1995, pp. 652-659.
    • (1995) Proceedings of the International Parallel Processing Symposium , pp. 652-659
    • Panda, D.K.1
  • 21
    • 0002483291 scopus 로고
    • Fast Barrier synchronization in wormhole k-ary n-cube networks with multidestination worms
    • D.K. Panda, Fast Barrier synchronization in wormhole k-ary n-cube networks with multidestination worms, in: International Symposium on High Performance Computer Architecture, 1995, pp. 200-209.
    • (1995) International Symposium on High Performance Computer Architecture , pp. 200-209
    • Panda, D.K.1


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