Optimally scaling permutation routing on reconfigurable linear arrays with optical buses

DOI10.1006/jpdc.2000.1643zbMath0966.68229OpenAlexW2072052580MaRDI QIDQ5926352

Jerry L. Trahan, Yi Pan, Anu G. Bourgeois, Ramachandran Vaidyanathan

Publication date: 28 February 2001

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.2000.1643

zbMATH Keywords

permutation routing algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items

SCALABLE AND EFFICIENT IMPLEMENTATIONS OF THE LDPC DECODER USING RECONFIGURABLE MODELS, Fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system*, Repetitions detection on a linear array with reconfigurable pipelined bus system