| Key Words |
Network nodes; node traffic; crossbar switch; conflict elimination; packet messages |
| Abstract |
In this paper, we present the synthesis of an optimal conflict-free schedule in terms of performance of the sub matrices in the connection matrix of a scheduling algorithm with diagonal activations of joint sub-switching matrices for a crossbar switch node. The algorithm was recently proved to be optimal with respect performance. Here, we have made a comparison of this algorithm with two other algorithms in terms of needed memory and complex performance. |
| Article PDF | Download article (PDF) |
