Generalized nets model of the LPF-algorithm of the crossbar switch node for determining LPF-execution time complexity
The apparatus of the Generalized Nets (GN) is applied to describe the LPF-algorithm for modeling a conflict-free schedule for packet crossbar switch. Throughput calculation results for a switch node with the LPF- algorithm computer simulation with a family of load traffic patterns are presented. Stu...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The apparatus of the Generalized Nets (GN) is applied to describe the LPF-algorithm for modeling a conflict-free schedule for packet crossbar switch. Throughput calculation results for a switch node with the LPF- algorithm computer simulation with a family of load traffic patterns are presented. Studies show that the execution time depends on the degree of dimension O(n exp(4,7)). The necessary computations have been implemented on AVITOHOL supercomputer, location – Sofia, IICT-BAS, BG. |
---|---|
ISSN: | 0094-243X 1551-7616 |
DOI: | 10.1063/5.0042856 |