An optimal routing algorithm for mesh-connected Parallel computers
From MaRDI portal
Publication:3856094
DOI10.1145/322169.322172zbMath0422.68009MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68N25: Theory of operating systems
68N99: Theory of software
Related Items
Simulating the Bitonic Sort Using P Systems, Some aspects of parallel and distributed iterative algorithms - a survey, 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