A lower bound for permutation routing on two-dimensional bused meshes

DOI10.1016/0020-0190(93)90208-QzbMath0771.68062OpenAlexW2040519772WikidataQ127680221 ScholiaQ127680221MaRDI QIDQ2366068

Yanyan Li

Publication date: 29 June 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90208-q

zbMATH Keywords

lower boundpermutation routingmesh-connected computerMIMDmeshes with buses

Mathematics Subject Classification ID

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

Related Items (2)

Efficient randomized routing algorithms on the two-dimensional mesh of buses ⋮ Analysis of permutation routing algorithms

Cites Work

• Mesh-Connected Computers with Broadcasting

This page was built for publication: A lower bound for permutation routing on two-dimensional bused meshes