GSE: a generalized full-access multistage interconnection network with minimum cost

We propose a new multistage interconnection network (MIN) called Generalized Shuffle Exchange (GSE) to connect N processors and N resources where N need not be a power of 2, but only an even number. It uses N/2 switches per stage and the number of stages is equal to [log N]. We show that GSE is a full-access network. Routing between any input-output pair in GSE is simple and can be done by using a routing vector, generated from the input and output addresses. When N is a power of 2, say 2/sup n/, GSE reduces to conventional n-stage network with unique path for each input-output pair. But, if 2/sup n-1/\n\n\t\t