Intel Corporation

Tahoe Research, Ltd.

Ben-Zion Friedman

Eliezer Tamir

Eliel Louzoun

Theodore L Willke

Ohad Falik

Eliezer Weissmann

James B Crossland

Phil C Cayton

Vadim Makhervaks

Sarig Livne

Arvind Srinivasan

Steven Bernard McGowan

Robert O Sharp

Sanjeev Jain

Jacob Doweck

Donald Wood

Simoni Ben-Michael

Tony Hurson

Ygdal Naouri

Matthew R Wilcox

Tsung-Yuan Charles Tai

Ren Wang

Christian Maciocco

Hang T Nguyen

Sameh Gobriel

Ilango S Ganga

Anjali Singhai Jain

Namakkal N Venkatesan

Nrupal R Jani

Shrikant M Shah

Robert J Munoz

Noam Elati

Vladislav Kopzon

Jack Doweck

Michael A O'Hanlon

Eli Sorin

Adam Conyers

Hemanth Krishnan

Nir Haber

Miles J Penner

Radia Joy Perlman

Anil Vasudevan

John Joseph Browne

Scott P Dubal

Parthasarathy Sarangam

Stephen T Palermo

Frank L Berry

Yadong Li

Manasi Deval

Robert G Southworth

Niall D McDonnell

Tomasz Kantecki

Brian J Skerry

Daniel Daly

John R Fastabend

Bruce Richardson

Ronen Chayat

Itamar Fredi Levin

Steen K Larsen

Ronen Aharon Hyatt

Alain Gravel

Neerav Parikh

Elizabeth M Kappler

Chih-Jen Chang

Yue Yang

Itamar Levin

Boris Kleiman

Calin Gherghe

Suyog Kulkarni

Partick Fleming

Nir Tiser

Alexey Puzhevich

Shai Krigman

Eliel Louzon

Akeem Abodunrin

Lev Faerman

Disclosed is a mechanism for maintaining a single lookup table entry for symmetric/bidirectional flows. Multiple recipes are stored for each flow. A recipe is employed to select address information from an incoming packet header based on the packet's direction. The address information and an index are employed to generate a lookup key to find the single lookup table entry with the pertinent switching information. The recipe further indicates action pointers in the lookup table entry that are specific to direction. The action pointers point to an address in an action table that contains instructions for actions that are applied to the packet during switching based on the packet's direction.

Single lookup entry for symmetric flows

Techniques to use descriptors for packet transmit scheduling include grouping a plurality of data descriptors associated with blocks of data with a single descriptor. The single descriptor to include information related to the plurality of data descriptors. The single descriptor to be used to schedule transmission of the blocks of data from a computing platform.

Techniques to use descriptors for packet transmit scheduling

Disclosed herein are systems and methods for multi-architecture computing. For example, in some embodiments, a computing system may include: a processor system including at least one first processor core having a first instruction set architecture (ISA); a memory device coupled to the processor system, wherein the memory device has stored thereon a first binary representation of a program for the first ISA; and control logic to suspend execution of the program by the at least one first processor core and cause at least one second processor core to resume execution of the program, wherein the at least one second processor core has a second ISA different from the first ISA; wherein the program is to generate data having an in-memory representation compatible with both the first ISA and the second ISA.

Systems and methods for multi-architecture computing

Disclosed is a mechanism maintain flow rate limits to flows in a server operating in a single root input/output virtualization (SR-IOV) environment. A transmit pipeline assigns a dedicated transmit queue to a flow. A scheduler allocates a flow transmit bandwidth to the dedicated transmit queue to enforce the flow rate limit. The transmit pipeline assigns the dedicated transmit queue to the flow upon receiving a packet of the flow. A queue identifier (ID) for the dedicated transmit queue is forwarded to a tenant process acting as a source of the flow to support forwarding of packets of the flow to the proper transmit queue. The transmit pipeline maintains security by comparing packet destinations of packets with the destination of the flow associated with the dedicated transmit queue. Packets in the dedicated destination queue with destinations that do not match the flow destination may be dropped.

Flow based rate limit

Examples are disclosed for access to a storage device maintained at a server. In some examples, a network input/output device coupled to the server may allocate, in a memory of the server, a buffer, a doorbell, and a queue pair accessible to a client remote to the server. For these examples, the network input/output device may assign an Non-Volatile Memory Express (NVMe) namespace context to the client. For these examples, indications of the allocated buffer, doorbell, queue pair, and namespace context may be transmitted to the client. Other examples are described and claimed.

Techniques for command validation for access to a storage device by a remote client

A transmitter can manage when a transmit queue is permitted to transmit and an amount of data permitted to be transmitted. After a transmit queue is permitted to transmit, the transmit queue can be placed in a sleep state if the transmit queue has exceeded its permitted data transmission quota. The wake time of the transmit queue can be scheduled based on a token accumulation rate for the transmit queue. The token accumulation rate can be increased if the transmit queue has other data to transmit after the data transmission. The token accumulation rate can be decreased if the transmit does not have other data to transmit.

Techniques to manage data transmissions

At a network-connected device, congestion at an egress queue can be detected. A potential source of congestion can be identified based on characteristics of a packet that caused the egress queue to become congested. The source of congestion can be a congestion group of transmitters. A group congestion message can be sent to the group of transmitters. The message can identify the packet that caused the egress queue to become congested. Transmitters can respond to the message by reducing their peak transmission rate.

Techniques to reduce network congestion

Examples described herein relate to an apparatus including at least one memory and at least one processor communicatively coupled to the at least one memory, the at least one processor to: allocate a scheduler to an egress port and based on unavailability of an egress port, allocate the scheduler to a second egress port to cause any packet allocated to a transmit queue associated with the scheduler to be transmitted using the second egress port. In some examples, a system receives a packet at a port on a network interface, associates a port group with the packet, determines a receive queue for the packet, and copies the packet to the determined receive queue. The port group can be adjusted to remove the port or to add a second port.

Queue-to-port allocation

Technologies for control plane separation at a network interface controller (NIC) of a compute device configured to transmit, by a resource of the compute device, commands to a physical function managed by a network interface controller (NIC) of the compute device. The NIC is further to establish a data plane separate from a control plane, wherein the control plane comprises one of the trusted control path and the untrusted control path. Additionally, the resource is configured to transmit the commands via one of the trusted control path or the untrusted control path based on a trust level associated with the physical function. Other embodiments are described herein.

Technologies for control plane separation in a network interface controller

Scalable techniques for data transfer between virtual machines (VMs) are described. In an example embodiment, an apparatus may include circuitry and memory storing instructions for execution by the circuitry to assign each one of a plurality of shared virtual memory spaces to a respective one of a plurality of virtual machines, wherein a first shared virtual memory space of the plurality of shared virtual memory spaces is assigned to a first virtual machine of the plurality of virtual machines, write, by the first virtual machine to the first shared virtual memory space, data to be provided to a second virtual machine of the plurality of virtual machines, and read, by the second virtual machine, the data in the first shared virtual memory space.

Scalable techniques for data transfer between virtual machines

Technologies for I/O device virtualization include a computing device with an I/O device that includes a physical function, multiple virtual functions, and multiple assignable resources, such as I/O queues. The physical function assigns an assignable resource to a virtual function. The computing device configures a page table mapping from a virtual function memory page located in a configuration space of the virtual function to a physical function memory page located in a configuration space of the physical function. The virtual function memory page includes a control register for the assignable resource, and the physical function memory page includes another control register for the assignable resource. A value may be written to the control register in the virtual function memory page. A processor of the computing device translates the virtual function memory page to the physical function memory page using the page mapping. Other embodiments are described and claimed.

Technologies for flexible virtual function queue assignment

Growing community of inventors

Jerusalem, Israel

Ben-Zion Friedman