Issue No. 08 - August (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.609284
<p><b>Abstract</b>—Recently, Gordon and Srikanthan gave a new approach to route a rearrangeable three-stage Clos network. However, their algorithm was suspected to be incomplete by Chiu and Siu, and by Lee and Carpinelli. We show that a modification of their algorithm assures a correct routing.</p>
Clos networks, graph coloring, permutation matrix, rearrangeable, routing algorithm.
F.k. Hwang, "A Modification to a Decomposition Algorithm of Gordon and Srikanthan", IEEE Transactions on Computers, vol. 46, no. , pp. 958-960, August 1997, doi:10.1109/12.609284