Parallel algorithms for routing in nonblocking networks

DOI10.1007/BF01187091MaRDI QIDQ4277375zbMATH OpenOpenAlexFDO

Authors Geng Lin, Nicholas 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

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

Recommendations

• On-Line Algorithms for Path Selection in a Nonblocking Network
• On Nonblocking Multiconnection Networks
• A fast parallel algorithm for routing in permutation networks
• Wide-Sense Nonblocking Networks
• scientific article; zbMATH DE number 1305091

Cites work

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

Cited in

(16)

• Competitive routing and flow control in communication networks of parallel links.
• A fast parallel algorithm for routing in permutation networks
• A Parallel Routing Algorithm for Traffic Optimization
• scientific article; zbMATH DE number 176074 (Why is no real title available?)
• Stackelberg Routing on Parallel Networks With Horizontal Queues
• scientific article; zbMATH DE number 3916184 (Why is no real title available?)
• Wide-Sense Nonblocking Networks
• On-Line Algorithms for Path Selection in a Nonblocking Network
• Parallelism versus memory allocation in pipelined router forwarding engines
• Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
• Network-oblivious algorithms
• scientific article; zbMATH DE number 2090659 (Why is no real title available?)
• Parity conditions in homotopic knock-knee routing
• A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square
• Efficient Parallel Routing Algorithms for Cartesian and Composition Networks
• Routing in series parallel networks

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

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