A study of modeling precision of an algorithm for crossbar switch node under scientific Linux SL release 5

Authors:
Tasho Tashev;Vladimir Monov
Affiliations:
Institute of Information and Communication Technologies (IICT) -Bulgarian Academy of Sciences;Institute of Information and Communication Technologies (IICT) - Bulgarian Academy of Sciences
Venue:
Proceedings of the 12th International Conference on Computer Systems and Technologies
Year:
2011

Citing 3
Cited 1

High-speed switch scheduling for local-area networks

ACM Transactions on Computer Systems (TOCS)
Designing and Implementing a Fast Crossbar Scheduler

IEEE Micro
Computering simulation of schedule algorithm for high performance packet switch node modelled by the apparatus of generalized nets

Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies

An algorithm of non-conflict schedule with joint diagonals activation of connectivity matrix

Proceedings of the 13th International Conference on Computer Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Achieving maximal throughput of a crossbar switch depends on creation of non-conflict schedule for packet commutation. The first step in checking the efficiency of commutation is throughput modeling of the switch by uniform demand traffic. In this paper we study the dependence between uniformity of the output sequences of a pseudo-random numbers generator and the required number of simulations to achieve a specified precision for this type of traffic under Linux SL with CERN-grid. The relationships have been obtained through computer simulated commutation using Generalized Nets model of the known PIM-algorithm. A possibility is shown for one to choose between precision and number of simulations.