Browsing Department of Mathematics by Subject "Multistage interconnection network"

Now showing items 1-3 of 3

Analyzing permutation capability of multistage interconnection networks with colored Petri nets

Bashirov, Rza; Crespi, Valentino (Information Sciences, Elsevier, 2006)

In a multistage interconnection network (MIN) the calculation of the number of permutations of the input terminals into the output terminals is a classic difficult problem. In this paper, we introduce an innovative technique ...
Exploiting colored Petri nets to decide on permutation admissibility

Bashirov, Rza; Kordon, Fabrice; Lort, Hüseyin (Acta Informatica, Springer, 2009)

In this work, we propose an innovative approach to investigate the admissibility of permutations to multistage interconnection networks — a challenging problem of switching theory. The proposed approach is centered upon ...
Rearrangeability of (2 log n N− 1)-stage networks employing a uniform connection pattern

Bashirov, Rza (Calcolo, Springer, 2001)

In this paper, we study the rearrangeablity of multistage networks. Although the necessity of (2 lgN −1)1 stages for rearrangeability of a shuffle-exchange network has been known, the sufficiency of (2 lgN −1) stages has ...