Conflict-free routing for BPC-permutations on synchronous hypercubes
From MaRDI portal
Publication:1208525
DOI10.1016/0167-8191(93)90040-RzbMath0794.68005MaRDI QIDQ1208525
Publication date: 16 May 1993
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(93)90040-r
permutations; routing algorithms; communication bandwidth; hypercube systems; localized communication