Deterministic Permutation Routing on Meshes

DOI10.1006/JAGM.1995.0804MaRDI QIDQ3125221zbMATH OpenOpenAlexFDO

Authors Bogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn

Publication date 13 October 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1995.0804

zbMATH Keywords

routing permutations

Mathematics Subject Classification ID

Computer system organization (68M99) Distributed algorithms (68W15)

Recommendations

• Permutation routing on reconfigurable meshes
• Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus
• PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH
• scientific article; zbMATH DE number 1003300
• Shorter queues for permutation routing on meshes
• Mesh permutation routing with locality
• Randomized multipacket routing and sorting on meshes
• A lower bound for permutation routing on two-dimensional bused meshes

Cited in

(22)

• Optimal routing algorithms for mesh-connected processor arrays
• Mesh permutation routing with locality
• Packet Routing on grids of processors
• Algorithms for the parallel alternating direction access machine
• Analysis of permutation routing algorithms
• A note on deflection worm routing on meshes.
• A lower bound for permutation routing on two-dimensional bused meshes
• Optimal permutation routing for low-dimensional hypercubes
• scientific article; zbMATH DE number 1003300 (Why is no real title available?)
• A unified framework for off-line permutation routing in parallel networks
• Flit-serial packet routing on meshes and tori
• Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus
• An optimal permutation routing algorithm on full-duplex hexagonal networks
• Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
• scientific article; zbMATH DE number 4054924 (Why is no real title available?)
• A fast parallel algorithm for routing in permutation networks
• An empirical study of off-line permutation packet routing on two-dimensional meshes based on the multistage routing method
• k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
• Shorter queues for permutation routing on meshes
• PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH
• Permutation routing on reconfigurable meshes
• Deterministic routing with bounded buffers: turning offline into online protocols

This page was built for publication: Deterministic Permutation Routing on Meshes

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