A number of matrix decomposition schemes were reported for routing on Clos switching networks. These schemes occasionally fail to find the right decomposition, unless backtracking is used. This paper shows that a partition may occur during the decomposition process, and that this is the underlying reason these algorithms fail for some decompositions. It then presents a parallel algorithm which can recognize when a partition exists and set up the Clos network without backtracking.
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering