메뉴 건너뛰기




Volumn , Issue , 1998, Pages 416-421

Virtual cut-through implementation of the HB packet switching routing algorithm

Author keywords

Fault tolerance; Full adaptive; Routing; Virtual cut through

Indexed keywords

FAULT TOLERANCE; PACKET NETWORKS; ROUTING ALGORITHMS; SWITCHING NETWORKS;

EID: 0007985641     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMPDP.1998.647228     Document Type: Conference Paper
Times cited : (7)

References (10)
  • 2
    • 0003271373 scopus 로고    scopus 로고
    • A Cost and Speed Model for k-ary n-cube Wormhole Routers
    • August 5-7, Palo Alto, California
    • Chien A.A.: 'A Cost and Speed Model for k-ary n-cube Wormhole Routers'. Proc. of Hot Interconnects '93, August 5-7, Palo Alto, California
    • Proc. Of Hot Interconnects '93
    • Chien, A.A.1
  • 5
    • 0023346637 scopus 로고
    • Deadlock free message routing in multiprocessor interconnection networks
    • May
    • Dally W.J., Seitz C.L.: 'Deadlock Free Message Routing in Multiprocessor Interconnection Networks'. IEEE Trans. On Computers, vol. C 36, May 1987
    • (1987) IEEE Trans. On Computers , vol.C 36
    • Dally, W.J.1    Seitz, C.L.2
  • 6
    • 0029390484 scopus 로고
    • A necessary and sufficient condition for deadlock free adaptive routing in wormhole networks
    • Oct
    • Duato J.: 'A Necessary and Sufficient Condition for Deadlock Free Adaptive Routing in Wormhole Networks'. IEEE Trans. On Parallel and Distributed Systems, vol. 6, n. 10, Oct. 1995.
    • (1995) IEEE Trans. On Parallel and Distributed Systems , vol.6 , Issue.10
    • Duato, J.1
  • 8
    • 0018518295 scopus 로고
    • Virtual cut-through: A new computer communication switching technique
    • Sept
    • Kermani P., Kleinrock L.: 'Virtual Cut-Through: A New Computer Communication Switching Technique'. Computer Networks, vol.3, Sept. 1979
    • (1979) Computer Networks , vol.3
    • Kermani, P.1    Kleinrock, L.2
  • 9
    • 0028401537 scopus 로고
    • Fully adaptive minimal deadlock free packet routing in hypercubes, meshes and other networks: Algorithms and simulation
    • Mar
    • Pifarre G.G. et Al.: 'Fully Adaptive Minimal Deadlock Free Packet Routing in Hypercubes, Meshes and Other Networks: Algorithms and Simulation'. IEEE Trans. On Parallel and Distributed Systems, vol. 5, n. 3, Mar. 1994.
    • (1994) IEEE Trans. On Parallel and Distributed Systems , vol.5 , Issue.3
    • Pifarre, G.G.1
  • 10
    • 0025551794 scopus 로고
    • An analysis of hot potato routing in a fiber optic packet switched hypercube
    • Apr
    • Szymanski T.: 'An Analysis of Hot Potato Routing in a Fiber Optic Packet Switched Hypercube'. Proc. Of IEEE INFOCOM '90, Apr. 1990.
    • (1990) Proc. Of IEEE INFOCOM '90
    • Szymanski, T.1


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