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

Authors:
Tasho Tashev
Affiliations:
Institute of Information Technologies -- B.A.S.
Venue:
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
Year:
2010

Citing 3
Cited 3

High-speed switch scheduling for local-area networks

ACM Transactions on Computer Systems (TOCS)
Generalized Nets

Generalized Nets
Designing and Implementing a Fast Crossbar Scheduler

IEEE Micro

Local weighted approach to time series forecasting

Proceedings of the 12th International Conference on Computer Systems and Technologies
A study of modeling precision of an algorithm for crossbar switch node under scientific Linux SL release 5

Proceedings of the 12th International Conference on Computer Systems and Technologies
A simulation study of the throughput of a crossbar switch node by means of periodic input patterns

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of the paper is a check of the capability of Generalized nets (GN)apparatus for modelling of parallel processes in packet switch node. By means of Generalized nets is synthesised a model of PIM (Parallel Iterative Matching) algorithm for computing of non-conflict schedule in crossbar switch node. The results of computer simulation of a GN-model performing uniform load traffic are presented. It is shown that so obtained by the simulation evaluation for throughput of switch mode tend near the theoretical boundary. A simple model for uniform traffic is suggested for switch throughput calculating which is capable to estimate approximately but faster at a rate depending on the rank of switch.