An Estimation of Time Required for Modeling of an Algorithm Calculate a Non-conflict Schedule for Crossbar Switch Node by Means of Grid-structure

摘要

The problem of calculating a non-conflict schedule by packets commutation in crossbar switch node isone of the foremost problems at the stage of node design. From a mathematical point of view this task is NPcomplete.Constantly rising levels of traffic communication require developing of new algorithms. Thesealgorithms must be correctly compared with known algorithms. In this paper we presented the investigations onthe time execution of known PIM-algorithm for crossbar switch by means of CERN’s grid-structure. By computersimulation of switching and using synthesized Generalized Nets (GN) model of the PIM-algorithm the executiontime is obtained. Its assessment is based on the modeling of the throughput in the presence of uniform incomingtraffic. It is shown that direct receiving of the characteristics of simulation time with the required accuracy wouldrequire the introduction of strictly defined control points.