Intel Corporation

Other

Tahoe Research, Ltd.

Microsoft Technology Licensing, LLC

Sk Hynix Nand Product Solutions Corp.

Tsung-Yuan Charles Tai

Ren Wang

Jr-Shian Tsai

Christian Maciocco

Sameh Gobriel

Alexander W Min

Mesut A Ergin

Yipeng Wang

Andrew J Herdrich

Namakkal N Venkatesan

Kristoffer Fleming

Sanjay Bakshi

Prakash N Iyer

David B Andersen

Rajendra S Yavatkar

Ahmad A Samih

Kapil Sood

Patrick L Connor

Edwin Verplanke

Bruce L Fleming

Brian J Skerry

Bruce Richardson

Rajesh M Sankaran

Richard A Uhlig

Victor B Lortz

Stephen R Van Doren

Niall D McDonnell

Kevin C Kahn

Aamer Jaleel

Jeffrey R Jackson

Charles L Brabenac

Jesse R Walker

John Charles Weast

Arvind A Kumar

Debra Bernstein

Michelle Xiaohong Gong

John Joseph Browne

Yen-Cheng Liu

David Sonnier

Zeshan A Chishti

William G Burroughs

Hugh Wilkinson

Andrew Cunningham

James T Clee

Narender R Vangati

Ravi L Sahita

Eldad Perahia

Christopher J Hughes

Paul S Diefenbaugh

Ravishankar Iyer

Ohad Falik

Anil Vasudevan

Ben-Zion Friedman

Hang T Nguyen

Herbert H Hum

Jong Soo Park

Sanjeev Jain

Rajeev D Muralidhar

Iosif Gasparakis

Bradley A Burres

Harinarayanan Seshadri

Scott D Hahn

Adrian C Moga

Michael Mesnier

Shrikant M Shah

Francesc Guim Bernat

Gilbert A Neiger

Kshitij Arun Doshi

Emily H Qi

Adrian Paul Stephens

John R Douceur

Robert G Blankenship

Barry E Huntley

Raanan Sade

Christopher B Wilkerson

Nadav Shulman

Lakshman Krishnamurthy

Joseph Nuzman

Alexander Bachmutsky

Chris MacNamara

Raghu R Kondapalli

Stephen T Palermo

Guan-Yu Lin

Ashish V Choubal

Mona Vij

Xiaohong Gong

Rupin H Vakharwala

Yoram Bernet

Andrew D Henroid

Michael J Espig

Jeffrey D Chamberlain

Julius Yuli Mandelblat

Arun Raghunath

Samantika S Sury

Thomas M Slaight

Raj S Yavatkar

Nrupal R Jani

Ping Yu

Cunming Liang

Eric K Mann

Examples described herein relate to a work scheduler that includes at least one processor and at least one queue. In some examples, the work scheduler receives a request to allocate a region of memory and based on availability of a memory segment associated with a central cache to satisfy the request to allocate a region of memory, provide a memory allocation using an available memory segment entry associated with the central cache from the at least one queue. In some examples, the work scheduler assigns a workload to a processor and controls when to pre-fetch content relevant to the workload to store in a cache or memory accessible to the processor based on a position of the workload in a work queue associated with the processor.

Workload scheduler for memory allocation

Technologies for dynamically managing a batch size of packets include a network device. The network device is to receive, into a queue, packets from a remote node to be processed by the network device, determine a throughput provided by the network device while the packets are processed, determine whether the determined throughput satisfies a predefined condition, and adjust a batch size of packets in response to a determination that the determined throughput satisfies a predefined condition. The batch size is indicative of a threshold number of queued packets required to be present in the queue before the queued packets in the queue can be processed by the network device.

Technologies for dynamic batch size management

An apparatus and method for closed loop dynamic resource allocation. For example, one embodiment of a method comprises: collecting data related to usage of a plurality of resources by a plurality of workloads over one or more time periods, the workloads including priority workloads associated with one or more guaranteed performance levels and best effort workloads not associated with guaranteed performance levels; analyzing the data to identify resource reallocations from one or more of the priority workloads to one or more of the best effort workloads in one or more subsequent time periods while still maintaining the guaranteed performance levels; reallocating the resources from the priority workloads to the best effort workloads for the subsequent time periods; monitoring execution of the priority workloads with respect to the guaranteed performance level during the subsequent time periods; and preemptively reallocating resources from the best effort workloads to the priority workloads during the subsequent time periods to ensure compliance with the guaranteed performance level and responsive to detecting that the guaranteed performance level is in danger of being breached.

Apparatus and method for a closed-loop dynamic resource allocation control framework

In some examples, for process-to-process communication, such as in function linking, a virtual channel can be provisioned to provide virtual machine to virtual machine communications. In response to a transmit request from a source virtual machine, the virtual channel can cause a data copy from a source buffer associated with the source virtual machine without decryption or encryption. The virtual channel provisions a key identifier for the copied data. The destination virtual machine can receive an indication data is available and can cause the data to be decrypted using a key accessed using the key identifier and source address of the copied data. In addition, the data can be encrypted using a second, different key for storage in a destination buffer associated with the destination virtual machine. In some examples, the key identifier and source address is managed by the virtual channel and is not visible to virtual machine or hypervisor.

Process-to-process secure data movement in network functions virtualization infrastructures

In the present disclosure, functions associated with the central office of an evolved packet core network are co-located onto a computer platform or sub-components through virtualized function instances. This reduces and/or eliminates the physical interfaces between equipment and permits functional operation of the evolved packet core to occur at a network edge.

Cross-function virtualization of a telecom core network

Apparatus, methods, and systems for tuple space search-based flow classification using cuckoo hash tables and unmasked packet headers are described herein. A device can communicate with one or more hardware switches. The device can include memory to store hash table entries of a hash table. The device can include processing circuitry to perform a hash lookup in the hash table. The lookup can be based on an unmasked key include in a packet header corresponding to a received data packet. The processing circuitry can retrieve an index pointing to a sub-table, the sub-table including a set of rules for handling the data packet. Other embodiments are also described.

Flow classification apparatus, methods, and systems

A computer-implemented method can include receiving a queue depth for a receive queue of a network interface controller (NIC), determining whether a power state of a central processing unit (CPU) core mapped to the receive queue should be adjusted based on the queue depth, and adjusting the power state of the CPU core responsive to a determination that the power state of the CPU core should be adjusted.

Using network interface controller (NIC) queue depth for power state management

The present invention relates to platform power management.

Platform and processor power management

Examples described herein relates to a network interface apparatus that includes packet processing circuitry and a bus interface. In some examples, the packet processing circuitry to: process a received packet that includes data, a request to perform a write operation to write the data to a cache, and an indicator that the data is to be durable and based at least on the received packet including the request and the indicator, cause the data to be written to the cache and non-volatile memory. In some examples, the packet processing circuitry is to issue a command to an input output (IO) controller to cause the IO controller to write the data to the cache and the non-volatile memory. In some examples, the cache comprises one or more of: a level-0 (L0), level-1 (L1), level-2 (L2), or last level cache (LLC) and the non-volatile memory comprises one or more of: volatile memory that is part of an Asynchronous DRAM Refresh (ADR) domain, persistent memory, battery-backed memory, or memory device whose state is determinate even if power is interrupted to the memory device. In some examples, based on receipt of a second received packet that includes a request to persist data, the packet processing circuitry is to request that data stored in a memory buffer be copied to the non-volatile memory.

Data consistency and durability over distributed persistent memory systems

A central processing unit can offload table lookup or tree traversal to an offload engine. The offload engine can provide hardware accelerated operations such as instruction queueing, bit masking, hashing functions, data comparisons, a results queue, and a progress tracking. The offload engine can be associated with a last level cache. In the case of a hash table lookup, the offload engine can apply a hashing function to a key to generate a signature, apply a comparator to compare signatures against the generated signature, retrieve a key associated with the signature, and apply the comparator to compare the key against the retrieved key. Accordingly, a data pointer associated with the key can be provided in the result queue. Acceleration of operations in tree traversal and tuple search can also occur.

Offload of data lookup operations

One embodiment provides a network system. The network system includes an application layer to execute one or more networking applications to generate or receive data packets having flow identification (ID) information; and a packet processing layer having profiling circuitry to generate a sketch table indicative of packet flow count data; the sketch table having a plurality of buckets, each bucket includes a first section including a plurality of data fields, each data field of the first section to store flow ID and packet count data, each bucket also having a second section having a plurality of data fields, each data field of the second section to store packet count data.

Sketch table for traffic profiling and measurement

In an embodiment, an apparatus is provided that may include circuitry to generate, at least in part, and/or receive, at least in part, at least one request that at least one network node generate, at least in part, information. The information may be to permit selection, at least in part, of (1) at least one power consumption state of the at least one network node, and (2) at least one time period. The at least one time period may be to elapse, after receipt by at least one other network node of at least one packet, prior to requesting at least one change in the at least one power consumption state. The at least one packet may be to be transmitted to the at least one network node. Of course, many alternatives, modifications, and variations are possible without departing from this embodiment.

Generating, at least in part, and/or receiving, at least in part, at least one request

Methods and apparatus implementing Hardware/Software co-optimization to improve performance and energy for inter-VM communication for NFVs and other producer-consumer workloads. The apparatus include multi-core processors with multi-level cache hierarchies including and L1 and L2 cache for each core and a shared last-level cache (LLC). One or more machine-level instructions are provided for proactively demoting cachelines from lower cache levels to higher cache levels, including demoting cachelines from L1/L2 caches to an LLC. Techniques are also provided for implementing hardware/software co-optimization in multi-socket NUMA architecture system, wherein cachelines may be selectively demoted and pushed to an LLC in a remote socket. In addition, techniques are disclosure for implementing early snooping in multi-socket systems to reduce latency when accessing cachelines on remote sockets.

Processor and method implementing a cacheline demote machine instruction

Techniques and apparatus for dynamic data access mode processes are described. In one embodiment, for example, an apparatus may a processor, at least one memory coupled to the processor, the at least one memory comprising an indication of a database and instructions, the instructions, when executed by the processor, to cause the processor to determine a database utilization value for a database, perform a comparison of the database utilization value to at least one utilization threshold, and set an active data access mode to one of a low-utilization data access mode or a high-utilization data access mode based on the comparison. Other embodiments are described.

Techniques for dynamic database access modes

Growing community of inventors

Portland, OR, United States of America

Tsung-Yuan Charles Tai