Large-Scale Computer Simulation of the Performance of the Generalized Nets Model of the LPF-algorithm

Large-scale simulation of the throughput (TP) of an existing LPF-algorithm (Longest Port First) for crossbar switch are presented. The throughput for Generalized Nets (GN) model of algorithm is studied for uniform independent and identically distributed Bernoulli traffic. The presented simulations are executed on the AVITOHOL supercomputer located at the IICT, Bulgaria. The modeling of the TP utilizes LPF for a switch with N is an element of [2, 60] commutation field size. Problems arise due to the time complicatedness of the implementation of the LPF-algorithm (O(N-4.7)). It is necessary to reduce the time complexity without introducing distortions into the results of simulation. One variant of the LPF with simplified random selection of a starting cell of weighting-matrix are discussed.