Packet Routing on grids of processors

DOI10.1007/BF01185337zbMath0766.68049OpenAlexW2074601535MaRDI QIDQ1207327

Manfred Kunde

Publication date: 1 April 1993

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

sortingparallel computationpermutation routingpacket routingmesh-connected arrayssynchronous computationdata movementparallel data transfers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer system organization (68M99) Distributed algorithms (68W15)

Related Items (1)

k-k Sorting on the multi-mesh

Cites Work

• Lower bounds for sorting on mesh-connected architectures
• A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
• Sorting on a mesh-connected parallel computer
• Unnamed Item
• Unnamed Item

This page was built for publication: Packet Routing on grids of processors