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

Authors:
Kiril Kolchakov;Tasho Tashev
Affiliations:
Bulgarian Academy of Sciences -- Sofia, Bulgaria;Institute of Information and Communication Technologies (IICT) -- Bulgarian Academy of Sciences
Venue:
Proceedings of the 13th International Conference on Computer Systems and Technologies
Year:
2012

Citing 2
Cited 0

An approach for performance improvement of class of algorithms for synthesis of non-conflict schedule in the switch nodes

Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
A study of modeling precision of an algorithm for crossbar switch node under scientific Linux SL release 5

Proceedings of the 12th International Conference on Computer Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.