메뉴 건너뛰기




Volumn 18, Issue , 2004, Pages 133-142

A multiple LID routing scheme for fat-tree-based InfiniBand networks

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; COMPUTER SOFTWARE; SERVERS; TELECOMMUNICATION TRAFFIC; THROUGHPUT; TOPOLOGY; TREES (MATHEMATICS);

EID: 12444300177     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (80)

References (14)
  • 4
    • 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, Vol. 3, 1979, pp. 267-286.
    • (1979) Computer Networks , vol.3 , pp. 267-286
    • Kermani, P.1    Kleinrock, L.2
  • 6
    • 0022141776 scopus 로고
    • Fat-trees: Universal networks for hardware-efficient supercomputing
    • October
    • C. E. Leiserson, "Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing," IEEE Transactions on Computers, vol. 34, no. 10, October 1985, pp. 892-901.
    • (1985) IEEE Transactions on Computers , vol.34 , Issue.10 , pp. 892-901
    • Leiserson, C.E.1


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