Paper Info
Title
High Performance Computations for Study the Stability of a Numerical Procedure for Crossbar Switch Node.
Abstract
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 x 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. [3, 97] which enables us to estimate the limit of the THR for n ->infinity. 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).
Year
DOI
Venue
2016
10.1007/978-3-319-57099-0_76
Lecture Notes in Computer Science
Keywords
Field
DocType
Numerical methods,Generalized nets,Switch node,Modeling
Topology,Upper and lower bounds,Traffic simulation,Throughput,Numerical analysis,Crossbar switch,Perturbation (astronomy),Mathematics,Commutation,Computation
Conference
Volume
ISSN
Citations 
10187
0302-9743
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Tasho D. Tashev100.34
Vladimir Monov293.87
Radostina P. Tasheva300.34