CLASS OF ALGORITHMS FOR SYNTHESSIS OF NON-CONFLICT SCHEDULE IN COMMUNICATION NODES

Kiril Kolchakov · 2013

In the paper are discussed six algorithms for non-conflict schedule obtaining in the switching nodes of type Crossbar. Comparative analysis of algorithms gives an overview of their potentiality related to the speed, required memory and performance as a function of the size N of the connection matrix T.

Read the paper · More papers on PaperTik