Abstract: 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.

Keywords: Network nodes, Message switching Node traffic, Crossbar switch, Conflict elimination, Packet messages, Sparse matrix.

ACM Classification Keywords: C.2.1 Network Architecture and Design, C.4 Performance of Systems

Link:

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

Kiril Kolchakov

http://www.foibg.com/ijita/vol20/ijita20-02-p09.pdf