Loading...
Please wait, while we are loading the content...
An Estimation of Time Required for Modeling of an Algorithm Calculate a Non-conflict Schedule for Crossbar Switch Node by Means of Grid-structure
| Content Provider | Semantic Scholar |
|---|---|
| Author | Tashev, Tasho |
| Copyright Year | 2012 |
| Abstract | The problem of calculating a non-conflict schedule by packets commutation in crossbar switch node is one of the foremost problems at the stage of node design. From a mathematical point of view this task is NP- complete. Constantly rising levels of traffic communication require developing of new algorithms. These algorithms must be correctly compared with known algorithms. In this paper we presented the investigations on the time execution of known PIM-algorithm for crossbar switch by means of CERN's grid-structure. By computer simulation of switching and using synthesized Generalized Nets (GN) model of the PIM-algorithm the execution time is obtained. Its assessment is based on the modeling of the throughput in the presence of uniform incoming traffic. It is shown that direct receiving of the characteristics of simulation time with the required accuracy would |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.foibg.com/ijita/vol19/ijita19-2-p07.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
