An optimal routing algorithm for mesh-connected Parallel computers

DOI10.1145/322169.322172MaRDI QIDQ3856094zbMATH OpenOpenAlexFDO

Authors David Nassimi, Sartaj Sahni

Publication date 1980

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322169.322172

zbMATH Keywords

data permutationsdata routingmesh-connected computerparallel algorithm

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Cited in

(9)

• Optimal routing algorithms for mesh-connected processor arrays
• Permutations on the block PRAM
• Matrix transpose on meshes with wormhole and XY routing
• Dense edge-disjoint embedding of complete binary trees in interconnection networks
• Parallel geometric algorithms on a mesh-connected computer
• Permutation algorithms on optical multi-trees
• A unified framework for off-line permutation routing in parallel networks
• Simulating the Bitonic Sort Using P Systems
• Some aspects of parallel and distributed iterative algorithms - a survey

This page was built for publication: An optimal routing algorithm for mesh-connected Parallel computers

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