Routing on the PADAM: Degrees of optimality

DOI10.1007/BFB0002744MaRDI QIDQ4536939zbMATH OpenFDO

Authors Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn

Publication date 25 June 2002

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

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)

Recommendations

• Algorithms for the parallel alternating direction access machine
• An optimal time bound for oblivious routing
• Packet Routing on grids of processors
• The generalized packet routing problem
• Optimal routing algorithms for mesh-connected processor arrays

Cited in

(3)

• Algorithms for the parallel alternating direction access machine
• Solving fundamental problems on sparse-meshes
• Parallelism versus memory allocation in pipelined router forwarding engines

This page was built for publication: Routing on the PADAM: Degrees of optimality

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