DEADLOCK-FREE ROUTING IN LOSSLESS MULTIDIMENSIONAL CARTESIAN TOPOLOGIES WITH MINIMAL NUMBER OF VIRTUAL BUFFERS

An apparatus (36) includes a network interface (28) and a processor (40). The network interface is configured to communicate with a network that includes a plurality of switches (32) interconnected in a Cartesian topology having multiple dimensions. The processor is configured to predefine an order...

Full description

Saved in:
Bibliographic Details
Main Authors ZAHAVI, Eitan, ZDORNOV, Vladimir
Format Patent
LanguageEnglish
French
German
Published 30.05.2018
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
PHYSICS
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
Online AccessGet full text

Cover

More Information
Summary:An apparatus (36) includes a network interface (28) and a processor (40). The network interface is configured to communicate with a network that includes a plurality of switches (32) interconnected in a Cartesian topology having multiple dimensions. The processor is configured to predefine an order among the dimensions of the Cartesian topology, to search for a preferred route via the network from a source switch to a destination switch, by evaluating candidate routes based at least on respective numbers of switches along the candidate routes for which traversal to a next-hop switch changes from one of the dimensions to another of the dimensions opposite to the predefined order, and to configure (124) one or more of the switches in the network to route packets from the source switch to the destination switch along the preferred route.
Bibliography:Application Number: EP20170202641