Parallel algorithms for routing in nonblocking networks

DOI10.1007/BF01187091zbMath0798.68014OpenAlexW4236500839MaRDI QIDQ4277375

Geng Lin, Nicholas J. Pippenger

Publication date: 31 October 1994

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01187091

zbMATH Keywords

parallel algorithmsroutingnonblocking networks

Mathematics Subject Classification ID

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

Cites Work

• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Wide-Sense Nonblocking Networks
• A fast parallel algorithm for routing in permutation networks
• Rearrangeable Networks with Limited Depth
• On non-blocking switching networks
• On-Line Algorithms for Path Selection in a Nonblocking Network
• Optimal Rearrangeable Multistage Connecting Networks

This page was built for publication: Parallel algorithms for routing in nonblocking networks