Mellanox Technologies, Ltd.

Mellanox Technologies Tlv Ltd.

Lion Levi

Eitan Zahavi

Liron Mula

Gil Bloch

George Elias

Richard Leigh Graham

Aviad Levy

Noam Bloch

Vladimir Koushnir

Daniel Marcovitch

Amiad Marelli

Jose Yallouz

Matty Kadosh

Oded Zemer

Idan Matari

Ofir Merdler

Yong Qin

Yaniv Blumenfeld

Gil Levy

Liran Liss

Zachy Haramaty

Itamar Rabenstein

Miriam Menes

Yuval Shpigelman

Oded Wertheim

Sagi Kuks

Ortal Bashan

Tamir Ronen

Daniel Klein

Michael Gandelman

Gil Mey-Tal

Alex Netes

Lior Hodaya Bezen

Evyatar Romlet

Yoav Benros

Elad Mentovich

Michael Kagan

Barak Gafni

Ariel Shahar

Aviv Kfir

Paraskevas Bakopoulos

Diego Crupnicoff

Benny Koren

Ioannis (Giannis) Patronas

Larry Robert Dennison

Niv Aibester

Boris Pismenny

Shahaf Shuler

Eyal Srebro

Guy Lederman

Nir Monovich

Ran Shani

Michael Tahar

Gal Shohet

Harold Rosenstock

Ortal Ben-Moshe

Noam Michaelis

Guy Rozenberg Kunievsky

Michael Gandelman Milgrom

Dvir Libhaber

Noam Avital

Neria Uzan

Guy Rozenberg

Aleksandr Minchiu

Michael Avimelech Gandelman Milgrom

Yoav Menes

Richard Graham

A networking device and system are described, among other things. An illustrative system is disclosed to include a switch programmed to route a received packet to an egress port based on a combination of a destination address associated with the received packet and an identification of an ingress port from which the packet was received by the switch.

Network partition filter

An apparatus, system, and method include, for each of two or more switches of a communication network, identifying a set of routing paths from the switch to a destination node based on a topology associated with the communication network. The set of routing paths include a first subset of routing paths and a second subset of routing paths. The topology includes an indication of a convergence of the first subset of routing paths at a node between the switch and the destination node. The apparatus, system, and method include allocating a data flow to a first routing path of the first subset of routing paths and a second routing path of the second subset of routing paths according to a target data flow rate common to the first routing path and the second routing path.

Adaptive routing for asymmetrical topologies

A network element includes a transmit-queue for transmitting packets from at least two sources, each source having a predefined priority level, to a headroom buffer in a peer network element. Flow-control circuitry receives from the peer network element signaling that indicates a number of credits for transmitting packets to the peer network element, manages a current number of credits available for transmission from the transmit-queue, responsive to the signaling, selects a threshold priority based on the current number of credits for the transmit-queue; and transmits packets associated with data sources of the transmit-queue that are higher in priority than the threshold priority, and refrain from transmitting other packets associated with the transmit-queue.

Head-of-queue blocking for multiple lossless queues

A method includes providing a plurality of processes interconnected by a network, each of the plurality of processes being configured to hold a block of data destined for others of the plurality of processes. A set of data for all-to-all data exchange is received from one or more of the processes. The set of data is configured as a plurality of blocks of data in a matrix as matrix data, the matrix being distributed among the plurality of processes. The matrix data is transposed by changing the position of selected blocks of data of the plurality of blocks of data relative to the other blocks of data of the plurality of the blocks of data, without changing the structure of each of the blocks of data. The transposed matrix data is over the network and is then received, repacked, and conveyed to destination processes.

Collective communication system and methods

A communication apparatus includes input circuitry, an encapsulator, transmission circuitry and flow control circuitry. The input circuitry is to receive packets from a data source in accordance with a first communication protocol that employs credit-based flow control. The encapsulator is to buffer the packets in a memory buffer and to encapsulate the buffered packets in accordance with a second communication protocol. The transmission circuitry is to transmit the encapsulated packets over a communication link in accordance with the second communication protocol. The flow control circuitry is to receive from the encapsulator buffer status indications that are indicative of a fill level of the memory buffer, and to exchange credit messages with the data source, in accordance with the credit-based flow control of the first communication protocol, responsively to the buffer status indications.

Reliable credit-based communication over long-haul links

A method for communication includes provisioning each node in a network with a respective set of two or more network addresses. Each node in succession is assigned a respective network address from the respective provisioned set that has not been assigned for use by any preceding node. Upon finding for a given node that all the network addresses in the respective provisioned set were assigned to preceding nodes, the preceding nodes are searched to identify a candidate node having an additional network address in the respective provisioned set, other than the assigned respective network address, that was not yet assigned to any of the nodes. The additional network address is assigned to the candidate node instead of the respective network address that was previously assigned to the candidate node, and the assigning of the network addresses to the nodes in the succession resumes following the candidate node.

Unique address assignment without reconfiguration

A method in which a plurality of process are configured to hold a block of data destined for other processes, with data repacking circuitry including receiving circuitry configured to receive at least one block of data from a source process of the plurality of processes, the repacking circuitry configured to repack received data in accordance with at least one destination process of the plurality of processes, and sending circuitry configured to send the repacked data to the at least one destination process of the plurality of processes, receiving a set of data for all-to-all data exchange, the set of data being configured as a matrix, the matrix being distributed among the plurality of processes, and transposing the data by each of the plurality of processes sending matrix data from the process to the repacking circuitry, and the repacking circuitry receiving, repacking, and sending the resulting matrix data to destination processes.

A network device includes processing circuitry and one or more ports. The one or more ports are configured to connect to a communication network. The processing circuitry is configured to receive a packet originating from a network node running an application program, the packet includes application-level metadata relating to the application program, to generate telemetry data based at least on the application-level metadata, and to transmit the telemetry data via one of the ports, over the communication network.

Network telemetry based on application-level information

A method for communication in a network that includes multiple nodes having respective network interfaces and interconnects between the network interfaces, which include at least first and second network interfaces connected by a physical interconnect having a given latency. The method includes defining a target latency, greater than the given latency, for communication between the first and second network interfaces. Data are transmitted between the first and second network interfaces over the physical interconnect while applying, by at least one of the first and second network interfaces, a delay in transmission of the data corresponding to a difference between the target latency and the given latency.

Controlling latency of cable interconnections

An apparatus includes one or more ports for connecting to a communication network, processing circuitry and a message aggregation circuit (MAC). The processing circuitry is configured to communicate messages over the communication network via the one or more ports. The MAC is configured to receive messages, which originate in one or more source processes and are destined to one or more destination processes, to aggregate two or more of the messages that share a common destination into an aggregated message, and to send the aggregated message using the processing circuitry over the communication network.

Small message aggregation

Switches for performing packet switching and associated methods are provided. An example switch includes an ingress port for receiving a packet. The switch includes a plurality of egress ports for discharging the packet from the switch. The switch includes a plurality of egress queues with each egress queue associated with one of the plurality of egress ports. The switch includes a control plane configured to determine a descriptor associated with a packet, determine a first egress port from which to discharge the at least one packet and to transmit the descriptor to an egress queue associated with the first egress port. The switch includes a descriptor crossbar configured to transmit the descriptor from the egress queue to a second egress port of the plurality of egress ports. The switch includes a packet crossbar configured to transmit the at least one packet from the ingress port to the second egress port.

Packet switches

A method including providing a SHARP tree including a plurality of data receiving processes and at least one aggregation node, designating a data movement command, providing a plurality of data input vectors to each of the plurality of data receiving processes, respectively, the plurality of data receiving processes each passing on the respective received data input vector to the at least one aggregation node, and the at least one aggregation node carrying out the data movement command on the received plurality of data input vectors. Related apparatus and methods are also provided.

High performance computing system

A computing system including network elements arranged in at least one group. A plurality of the network elements are designated as spines and another plurality are designated as leaves, the spines and leaves are interconnected in a bipartite topology, and at least some of the spines and leaves are configured to: receive in a first leaf, from a source node, packets destined to a destination node via a second leaf, forward the packets via a first link to a first spine and to the second leaf via a second link, in response to detecting that the second link has failed, apply a detour path from the first leaf to the second leaf, including a detour link in a spine-to-leaf direction and another detour link a leaf-to-spine direction, and forward subsequent packets, which are received in the first leaf and are destined to the second leaf, via the detour path.

Deadlock-free rerouting for resolving local link failures using detour paths

A network device includes multiple ports, multiple buffer slices, a controller, and buffer control circuitry. The multiple ports are configured to communicate packets over a network. The multiple buffer slices are linked respectively to the multiple ports. The controller is configured to allocate a group of two or more of the buffer slices to a selected port among the ports. The buffer control circuitry is configured to buffer the packets, communicated via the selected port, in the group of the buffer slices, using zero-copy buffering.

Zero-copy buffering of traffic of long-haul links

A network element includes processing circuitry and multiple ports. The ports connect using links to a communication network. The processing circuitry is configured to receive packets via the ports and forward the received packets to respective destination addresses via the ports. The destination addresses are organized in address groups, each address group including multiple destination addresses of nodes connected to a common network element in the communication network. The processing circuitry is further configured to, in response to identifying that a given port connects to a faulty link, determine one or more address groups that became unreachable via the given port due to the faulty link, generate a notification reporting one or more of the determined address groups that are unreachable via any port other than the given port, and transmit the notification to one or more other network elements, via one or more ports other than the given port.

Efficient propagation of fault routing notifications

Growing community of inventors

Yavne, Israel

Lion Levi