Fig 1 - uploaded by Ташо Димитров Ташев
Content may be subject to copyright.
Source publication
The task which includes computing of non-conflict schedule for crossbar switch node of packet commutation is NP-hard. After checking their efficiency with throughput modelling by uniform load traffic, the check for non-uniform traffic is required. In the presented paper we propose a procedure of calculating the upper boundary of throughput for cros...
Contexts in source publication
Context 1
... goal of the traffic-scheduling for the crossbar switches is to maximize the throughput of packet through a switch and to minimize packet blocking probability and packet waiting time [1]. This is assured by the algorithm for calculation of non-conflict schedule which is running in the control unit of the switch (Scheduler - Fig.1) [2]. ...
Context 2
... the calculation of the boundary we used the curve of the pattern Chao 625 and the value of the parameter of convergence δ 3 =2,23 (Sn=0,8130). The boundary obtained if the curve of the pattern Chao 125 with δ 2 =2,22 (Sn=0,8196) is used is showed on Figure 10. The curve presented in that case is above this for Chao 625 . ...
Context 3
... of the boundary we used the curve of the pattern Chao 625 and the value of the parameter of convergence δ 3 =2,23 (Sn=0,8130). The boundary obtained if the curve of the pattern Chao 125 with δ 2 =2,22 (Sn=0,8196) is used is showed on Figure 10. The curve presented in that case is above this for Chao 625 . Which of the results is more accurate? Fig. 10 Upper boundary of throughput, ...
Context 4
... calculate the boundary using the curve of the pattern Chao 125 and the value of the parameter of convergence δ 3. The obtained result is showed on Figure 11. The correlation of the curves is better than on Figure 10. ...
Context 5
... calculate the boundary using the curve of the pattern Chao 125 and the value of the parameter of convergence δ 3. The obtained result is showed on Figure 11. The correlation of the curves is better than on Figure 10. Is this enough to accept that the value of δ 3 is the most accurate one? ...
Similar publications
The paper presents computer simulations of an algorithm for non-conflict packet commutation in a crossbar switch node. In particular, we study a version of the MiMa-algorithm with a new selection of the initial element of the traffic matrix as compared to the original version of the algorithm. Our simulations utilize independent, identically distri...
Achieving maximal throughput of crossbar switch depends on creation of non-conflict schedule for packet commutation. The first step while checking schedule efficiency with specified precision is throughput modeling by uniform load traffic. The next step requires a check for non-uniform traffic. In this paper we presented the investigations for depe...
Citations
... In this paper the problem for calculation of the upper bound of the THR is considered. In our computations we use a numerical procedure [7] with input data obtained from high performance calculations. The computer simulation of the THR is executed on the grid-structure of Institute IICT-BAS (www.hpc.acad.bg). ...
... We calculate the ratio δ j for differences res j between throughput for neighboring patterns [7,11] and the obtained curves for δ j are shown in figure 7 (for j=1) and figure 8 (for j=7). The values of δ 1 are varying above (1,5) -1 , and the values of δ 7 tend to (1,4) -1 =m -1/2 , which is the expected value without perturbation [11]. ...
The paper is concerned with the problem of calculating the bound of the throughput (THR) of a crossbar packet switch. For this purpose a suitable numerical procedure is used. The input data for the procedure are the results of computer simulations executed on a grid-computational structure ( www.hpc.acad.bg ). The modeling of the THR uses MiMa-algorithm for a crossbar packet switch, specified by the apparatus of Generalized Nets. For studying the stability of the numerical procedure we use a modified family of patterns for i.i.d. Bernoulli uniform load traffic simulation. The obtained results show that the numerical procedure is stable which means that small input perturbations result in small changes in the output.
In the present paper the problem concerning computation of the upper bound of the throughput (THR) of crossbar switch node is formulated. The task is solved using an appropriate numerical procedure. The input data for this procedure are the results of high performance simulations executed on the grid-structure of the IICT-BAS (www.grid.bas.bg). The modeling of the THR utilizes MiMa-algorithm for a node with \((n\times n)\) commutation field, specified by the Generalized Nets. For studying the stability of the numerical procedure we use a modified family of patterns for hotspot load traffic simulation. The obtained results give an upper bound of the THR for \(n\in [3,97]\) which enables us to estimate the limit of the THR for \(n\rightarrow \infty .\) This estimate is obtained to be \(100\%\) for the applied family of patterns. The numerical procedure is stable (small input perturbations lead to small changes in the output).
In the present paper we propose a family of patterns for hotspot load traffic simulating. The results from computer simulations of the throughput of a crossbar packet switch with these patterns are presented. The necessary computations have been performed on the grid-cluster of IICT-BAS. Our simulations utilize the MiMa-algorithm for non-conflict schedule, specified by the apparatus of Generalized Nets. A numerical procedure for computation of the upper bound of the throughput is utilized. It is shown that the throughput of the MiMa-algorithm with the suggested family of patterns tend to 100 %.
