The generalized packet routing problem

DOI10.1016/0304-3975(87)90069-7zbMath0626.68015OpenAlexW2043560882MaRDI QIDQ580964

Eli Upfal, David Peleg

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90069-7

zbMATH Keywords

communication networksparallel and distributed computationexpander graphsefficient packet routingload balancing problem in distributed systemspermutation packet routingtoken distribution problem

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (9)

Strongly adaptive token distribution ⋮ TOKEN DISTRIBUTION AND LOAD BALANCING ON RECONFIGURABLEd-DIMENSIONAL MESHES ⋮ Representing shared data on distributed-memory parallel computers ⋮ A note on the token distribution problem ⋮ Unnamed Item ⋮ Near-perfect token distribution ⋮ Optimal dimension-exchange token distribution on complete binary trees ⋮ Rapid convergence of a local load balancing algorithm for asynchronous rings ⋮ AN EXTENDED DIMENSION ORDER TOKEN DISTRIBUTION ALGORITHM ON k-Ary d-CUBES AND ITS COMPLEXITY

Cites Work

• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Efficient Schemes for Parallel Communication

This page was built for publication: The generalized packet routing problem