Computer simulations for determining of the upper bound of throughput of LPF-algorithm for crossbar switch

The Generalized Nets (GN) is applied here to describe the Longest_Port_First-algorithm (LPF) for computing a non-blocking schedule for crossbar switch. The results for throughput (TH) on a switch node with an LPF by simulations for the size of commutation field 2x2 to 60x60 with patterns of uniform load traffic are presented. For each size, 10 000 simulations are performed with the input buffer changed up to 256 cells. Using the numerical procedure, it is demonstrated that the upper bound of the TH of the LPF-algorithm tends to be 100 %. It is stated that to reduce the complexity of the algorithm time by one degree, it is necessary to sort only the first n (by "weight") elements of the "weight" matrix. The calculation needed has been executed on the supercomputer AVITOHOL, Bulgaria.