An algorithm of non-conflict schedule with joint diagonals activation of connectivity matrix

A synthesis of an algorithm for non-conflict schedule with joint diagonals activation is done. A software model of the algorithm is built. Rapidity, performance and memory resources are analyzed. It is calculated the performance and memory resource for different switching matrix types and sizes. A comparison of the proposed algorithm with other algorithms for non-conflict schedules is done.

[1]  Panayotis Antoniadis,et al.  FIRM: a class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Si-Qing Zheng,et al.  Designing fully distributed scheduling algorithms for contention-tolerant crossbar switches , 2010, 2010 International Conference on High Performance Switching and Routing.

[3]  Kiril Kolchakov.  An approach for performance improvement of class of algorithms for synthesis of non-conflict schedule in the switch nodes , 2010, CompSysTech '10.

[4]  Tasho D. Tashev,et al.  A study of modeling precision of an algorithm for crossbar switch node under scientific Linux SL release 5 , 2011, CompSysTech '11.

[5]  Greg Lehman,et al.  Optimization and Decision Making , 2011 .