Search Results

You are looking at 1 - 3 of 3 items for

  • Author: V. Monov x
Clear All Modify Search
Open access

Kiril Kolchakov and V. Monov

Abstract

The aim of this study is to determine the influence of the size of submatrices in a lagre scale connections matrix on the performance of an algorithm for non conflict scheduling with diagonal activation of joint submatrices (ADAJS). We have used a software model (SMADAJS) of the algorithm developed in MATLAB programming environment. A comparison is made with similar algorithms with diagonal activation of the connections matrix with respect to performance time and memory required.

Open access

K. Kolchakov and V. Monov

Abstract

The paper deals with the problem of traffic scheduling in a crossbar switch node used in communication networks. In particular, we study the non-conflict scheduling in sub matrices of the connection matrix of an Algorithm with diagonal activations of joint sub matrices (ADAJS) and propose a scheduling algorithm which is optimal in terms of performance and the necessary memory. For comparison, we have examined six algorithms with their software models.

Open access

T. Tashev, V. Monov and R. Tasheva

Abstract

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.