An optimal routing algorithm for mesh-connected Parallel computers

DOI10.1145/322169.322172zbMath0422.68009OpenAlexW1969370624MaRDI QIDQ3856094

David Nassimi, Sartaj K. 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

parallel algorithmmesh-connected computerdata routingdata permutations

Mathematics Subject Classification ID

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

Related Items

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