Virtual cut-through: A new computer communication switching technique
From MaRDI portal
Publication:4195990
DOI10.1016/0376-5075(79)90032-1zbMath0408.68090OpenAlexW2065742943MaRDI QIDQ4195990
Parviz Kermani, Leonard Kleinrock
Publication date: 1979
Published in: Computer Networks (1976) (Search for Journal in Brave)
Full work available at URL: https://academicworks.cuny.edu/nc_pubs/36
Computer CommunicationBuffer Storage RequirementMessage SwitchingNetwork DelaySwitching TechniqueTraffic Gain
Computing methodologies and applications (68U99) Circuits, networks (94C99) Communication theory (94A05) Theory of software (68N99)
Related Items (12)
Minimal fully adaptive wormhole routing on hypercubes ⋮ Flit-serial packet routing on meshes and tori ⋮ Optimal algorithms for dissemination of information in generalized communication modes ⋮ Fault-aware communication mapping for noCs with guaranteed latency ⋮ Deadlock-free routing in k-ary hypercube network in presence of processor failures ⋮ Adaptive and fault-tolerant routing algorithms for high performance 2D torus interconnection network ⋮ Stirling networks: A versatile combinatorial topology for multiprocessor systems ⋮ Communication in the two-way listen-in vertex-disjoint paths mode ⋮ Comparing four classes of torus-based parallel architectures: network parameters and communication performance ⋮ On the benefit of supporting virtual channels in wormhole routers ⋮ Fast algorithms for bit-serial routing on a hypercube ⋮ Deadlock-free message routing in multicomputer networks
This page was built for publication: Virtual cut-through: A new computer communication switching technique
