Analysis of permutation routing algorithms

DOI10.1016/S0377-2217(99)00455-5zbMATH Open0952.90002MaRDI QIDQ1580969FDOQ1580969

Authors: József Békési, Gábor Galambos, Péter Hajnal 

Publication date: 14 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Recommendations

• Deterministic Permutation Routing on Meshes
• Packet Routing on grids of processors
• Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus
• Routing Problems on the Mesh of Buses
• A lower bound for permutation routing on two-dimensional bused meshes

zbMATH Keywords

analysis of algorithmsparallel processingnetwork communicationpermutation routingmesh architecture

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Deterministic network models in operations research (90B10) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
• Mesh permutation routing with locality
• On multidimensional packet routing for meshes with buses
• A lower bound for permutation routing on two-dimensional bused meshes

Cited In (4)

• A note on deflection worm routing on meshes.
• Title not available (Why is that?)
• Efficient randomized routing algorithms on the two-dimensional mesh of buses
• Mesh permutation routing with locality

This page was built for publication: Analysis of permutation routing algorithms

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