An algorithm of non-conflict schedule with joint diagonals activation of connectivity matrix
Kiril Kolchakov, Tasho D. Tashev · 2012
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.