On-Line Algorithms for Path Selection in a Nonblocking Network

DOI10.1137/S0097539791221499MaRDI QIDQ4887019zbMATH OpenFDO

Authors Bruce M. Maggs, F. Thomson Leighton, Sanjeev Arora

Publication date 26 November 1996

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539791221499

zbMATH Keywords

multi-Beneš networkmultibutterfly networknonblocking network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15) Communication networks in operations research (90B18)

Recommendations

• Parallel algorithms for routing in nonblocking networks
• On-line routing of random calls in networks
• A fast parallel algorithm for routing in permutation networks
• Distributed and on-line routing on tori
• scientific article; zbMATH DE number 1305091

Cited in

(8)

• Real-time emulations of bounded-degree networks
• Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
• OptORAMa: optimal oblivious RAM
• Expander graphs and their applications
• Parallel algorithms for routing in nonblocking networks
• Sorting Short Keys in Circuits of Size ${o(n \log n)}$
• OptORAMa: Optimal oblivious RAM
• A framework for solving VLSI graph layout problems

This page was built for publication: On-Line Algorithms for Path Selection in a Nonblocking Network

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