Towards a better understanding of pure packet routing

DOI10.1007/3-540-57155-8_230MaRDI QIDQ5060094zbMATH OpenOpenAlexFDO

Authors Allan Borodin

Publication date 18 January 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57155-8_230

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cites work

• A Scheme for Fast Parallel Communication
• Bounds on evacuation time for deflection routing
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Efficient Schemes for Parallel Communication
• How much can hardware help routing?
• How to emulate shared memory
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 1256693 (Why is no real title available?)
• scientific article; zbMATH DE number 1142304 (Why is no real title available?)
• scientific article; zbMATH DE number 1142307 (Why is no real title available?)
• Oblivious routing with limited buffer capacity
• On the complexity of an optimal non-blocking commutation scheme without reorganization
• Optimal routing algorithms for mesh-connected processor arrays
• Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
• Routing, merging, and sorting on parallel models of computation
• Tight bounds for oblivious routing in the hypercube
• Tight Bounds on the Complexity of Parallel Sorting

This page was built for publication: Towards a better understanding of pure packet routing

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