知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

31 records (took 0.037 seconds)

    FLOW CLASSIFICATION APPARATUS, METHODS, AND SYSTEMS
    1.
    发明申请
    FLOW CLASSIFICATION APPARATUS, METHODS, AND SYSTEMS 有权

    公开(公告)号：US20210367887A1

    公开(公告)日：2021-11-25

    申请号：US17396553

    申请日：2021-08-06

    Applicant: Intel Corporation

    Inventor： Ren Wang ,  Tsung-Yuan C. Tai ,  Yipeng Wang ,  Sameh Gobriel

    IPC: H04L12/743 ,  H04L12/851 ,  H04L12/741 ,  H04L29/12

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

    TECHNOLOGIES FOR FLOW RULE AWARE EXACT MATCH CACHE COMPRESSION
    2.
    发明申请
    TECHNOLOGIES FOR FLOW RULE AWARE EXACT MATCH CACHE COMPRESSION 审中-公开

    公开(公告)号：US20190052719A1

    公开(公告)日：2019-02-14

    申请号：US15862311

    申请日：2018-01-04

    Applicant: Intel Corporation

    Inventor： Yipeng Wang ,  Ren Wang ,  Antonio Fischetti ,  Sameh Gobriel ,  Tsung-Yuan C. Tai

    IPC: H04L29/08 ,  H04L12/24 ,  H04L29/06

    Abstract: Technologies for flow rule aware exact match cache compression include multiple computing devices in communication over a network. A computing device reads a network packet from a network port and extracts one or more key fields from the packet to generate a lookup key. The key fields are identified by a key field specification of an exact match flow cache. The computing device may dynamically configure the key field specification based on an active flow rule set. The computing device may compress the key field specification to match a union of non-wildcard fields of the active flow rule set. The computing device may expand the key field specification in response to insertion of a new flow rule. The computing device looks up the lookup key in the exact match flow cache and, if a match is found, applies the corresponding action. Other embodiments are described and claimed.

    DYNAMIC QUANTIZATION AND MEMORY MANAGEMENT OF KEY-VALUE CACHE FOR SERVING LARGE LANGUAGE MODELS
    5.
    发明申请
    DYNAMIC QUANTIZATION AND MEMORY MANAGEMENT OF KEY-VALUE CACHE FOR SERVING LARGE LANGUAGE MODELS 有权

    公开(公告)号：US20250061316A1

    公开(公告)日：2025-02-20

    申请号：US18934700

    申请日：2024-11-01

    Applicant: Intel Corporation

    Inventor： Sameh Gobriel ,  Nilesh Jain ,  Vui Seng Chua ,  Juan Pablo Munoz ,  Gopi Krishna Jha

    IPC: G06N3/0495 ,  G06N3/082

    Abstract: Key-value (KV) cache paging schemes can improve memory management for KV caches by storing a KV cache page having key tensors and value tensors for a fixed number of tokens in a fixed-sized block in the KV cache of a worker. To further improve memory management, the schemes can be modified to implement dynamic variable quantization. Quantization level of a KV cache page can be set based on a runtime importance score of the KV cache page. In addition, the quantization level of the KV cache page can be set based on the system load. The end result is a scheme that can achieve a high compression ratio of KV cache pages in the KV cache. Fitting more KV cache pages in the KV cache can lead to higher inference throughput, higher system-level user capacity, and higher end-to-end service availability.

    Apparatus and method for prioritized quality of service processing for transactional memory
    7.
    发明授权
    Apparatus and method for prioritized quality of service processing for transactional memory 有权

    公开(公告)号：US10719442B2

    公开(公告)日：2020-07-21

    申请号：US16126907

    申请日：2018-09-10

    Applicant: Intel Corporation

    Inventor： Ren Wang ,  Raanan Sade ,  Yipeng Wang ,  Tsung-Yuan Tai ,  Sameh Gobriel

    IPC: G06F12/00 ,  G06F12/0811 ,  G06F9/38 ,  G06F16/18

    Abstract: An apparatus and method for prioritizing transactional memory regions. For example, one embodiment of a processor comprises: a plurality of cores to execute threads comprising sequences of instructions, at least some of the instructions specifying a transactional memory region; a cache of each core to store a plurality of cache lines; transactional memory circuitry of each core to manage execution of the transactional memory (TM) regions based on priorities associated with each of the TM regions; and wherein the transactional memory circuitry, upon detecting a conflict between a first TM region having a first priority value and a second TM region having a second priority value, is to determine which of the first TM region or the second TM region is permitted to continue executing and which is to be aborted based, at least in part, on the first and second priority values.

    TECHNOLOGIES FOR EFFICIENT NETWORK FLOW CLASSIFICATION WITH VECTOR BLOOM FILTERS
    9.
    发明申请
    TECHNOLOGIES FOR EFFICIENT NETWORK FLOW CLASSIFICATION WITH VECTOR BLOOM FILTERS 审中-公开

    公开(公告)号：US20180375773A1

    公开(公告)日：2018-12-27

    申请号：US15632592

    申请日：2017-06-26

    Applicant: Intel Corporation

    Inventor： Sameh Gobriel ,  Wei Shen ,  Tsung-Yuan C. Tai ,  Ren Wang

    IPC: H04L12/743 ,  H04L12/741 ,  H04L29/12

    Abstract: Technologies for efficient network flow classification include a computing device that receives a network packet that includes a header. The computing device generates a vector Bloom filter (VBF) key as a function of the header and searches multiple VBFs for a VBF that matches the VBF key. Each VBF is associated with a flow sub-table that includes one or more flow rules. Each flow sub-table is associated with a mask length. If a matching VBF is found, the computing device searches the corresponding flow sub-table for a flow rule that matches a masked header of the network packet. If no matching VBF is found or if no matching flow rule is found, the computing device searches all of the flow sub-tables for a flow rule that matches the header. The computing device applies a flow action of a matching flow rule. Other embodiments are described and claimed.

Patent Agency Ranking