Virtual cut-through: A new computer communication switching technique

DOI10.1016/0376-5075(79)90032-1MaRDI QIDQ4195990zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Buffer Storage RequirementComputer CommunicationMessage SwitchingNetwork DelaySwitching TechniqueTraffic Gain

Mathematics Subject Classification ID

Theory of software (68N99) Computing methodologies and applications (68U99) Communication theory (94A05) Circuits, networks (94C99)

Cited in

(12)

• Adaptive and fault-tolerant routing algorithms for high performance 2D torus interconnection network
• Stirling networks: A versatile combinatorial topology for multiprocessor systems
• Minimal fully adaptive wormhole routing on hypercubes
• Optimal algorithms for dissemination of information in generalized communication modes
• Deadlock-free message routing in multicomputer networks
• Fast algorithms for bit-serial routing on a hypercube
• Flit-serial packet routing on meshes and tori
• Comparing four classes of torus-based parallel architectures: network parameters and communication performance
• Communication in the two-way listen-in vertex-disjoint paths mode
• On the benefit of supporting virtual channels in wormhole routers
• Fault-aware communication mapping for noCs with guaranteed latency
• Deadlock-free routing in k-ary hypercube network in presence of processor failures

This page was built for publication: Virtual cut-through: A new computer communication switching technique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4195990)