Abstract: The problem connected to computation of non-conflict schedule for crossbar switch node is NPcomplete
from mathematical point of view. It is the reason for constantly suggested new algorithms for schedule
calculations. The problem is that their efficiency has to be checked. The throughput of a “good” algorithm tends
monotonically to some boundary. We suggest a procedure for quantitative determination of the convergence
toward the boundary, utilizing data from computer simulation. In this paper are presented results of computer
simulation for PIM algorithm with a certain model of incoming traffic (Chao model), made by means of CERN grid
structure (lxplus.cern.ch). We check the hypothesis that convergence computation depends on the chosen
parameter m of the procedure. Checking is made for m=4 and m=3. The obtained data confirm validity of the
hypothesis for the chosen values m. As a result we reach a new conclusion: the derived values of the error for
the internal variable δ give (an independent) estimation of the simulation errors. Having this in mind we can plan
experiments that will give us the required accuracy for the determination of the boundary under the limited
computer power available.
Keywords: Modeling, Communication node, Crossbar switch, Algorithms.
Классификация ключевых слов ACM: B.4.4 Performance Analysis and Design Aids, C.2.1 Network
Architecture and Design, C.4 Performance of Systems
Link:
ОПРЕДЕЛЕНИЕ ИНТЕРВАЛА ЭФФЕКТИВНОСТИ ПАРАМЕТРОВ ПРОЦЕДУРЫ
ВЫЧИСЛЕНИЯ ГРАНИЦЫ ПРОПУСКНОЙ СПОСОБНОСТИ ПАКЕТНОГО
КОММУТАТОРА
(Efficiency Interval Determination of a Calculation Procedure for Throughput Boundary of Crossbar
Switch)
Ташо Ташев, Арсений Баканов, Радостина Ташева
http://www.foibg.com/ijitk/ijitk-vol08/ijitk08-02-p11.pdf