The paper introduces a novel routing technique and a way to realize passable permutations in F and IADM redundant multistage interconnection networks. The simplicity of selecting alternate routes for a given source-destination pair is demonstrated by two examples. The concept of cycles is introduced and is used to develop an algorithm to realize conflict free permutations in these networks
Published in:
Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on
Date of Conference: 9-13 Dec 1990