中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

131 records (took 0.027 seconds)

    Concurrent network application scheduling for reduced power consumption
    91.
    发明授权
    Concurrent network application scheduling for reduced power consumption 有权

    公开(公告)号：US10042414B2

    公开(公告)日：2018-08-07

    申请号：US14129783

    申请日：2013-10-01

    Applicant: Intel Corporation

    Inventor： Zhongghong Ou ,  Ren Wang

    IPC: G06F1/26 ,  G06F1/32 ,  H04W52/02 ,  G06F9/48

    Abstract: Technologies for scheduling network requests to reduce power consumption include a mobile computing device configured to receive a network request from a network application, and determine whether the network request is delayable, based on execution constraints of the application. Execution constraints may include required processing resources, acceptable latency, priority, application class, and others. If the request is delayable, the mobile computing device may delay the request until a threshold number of delayable requests are received, or until a non-delayable request is received. The mobile computing device performs the delayed request and any subsequently received requests concurrently. The execution constraints may be supplied by each network application, or may be determined by the mobile computing device through observation. Other embodiments are described and claimed.

    METHOD AND APPARATUS TO SECURELY MEASURE QUALITY OF SERVICE END TO END IN A NETWORK
    94.
    发明申请
    METHOD AND APPARATUS TO SECURELY MEASURE QUALITY OF SERVICE END TO END IN A NETWORK 审中-公开

    公开(公告)号：US20170093677A1

    公开(公告)日：2017-03-30

    申请号：US14865136

    申请日：2015-09-25

    Applicant: Intel Corporation

    Inventor： Brian J. Skerry ,  Thomas M. Slaight ,  Ren Wang ,  Kapil Sood

    IPC: H04L12/26 ,  H04L12/931

    CPC classification number: H04L43/12 ,  H04L43/04 ,  H04L43/087 ,  H04L43/106 ,  H04L49/70

    Abstract: Methods and apparatus to securely measure quality of service end to end in a network. First and second endpoints are configured to detect packets marked for QoS measurements, associate a timestamp using a secure clock with such marked packets, and report the timestamp along with packet identifying metadata to an external monitor. The external monitor uses the packet identifying metadata to match up timestamps and calculates a QoS measurement corresponding to the latency incurred by the packet when traversing a packet-processing path between the first and second endpoints. The endpoints may be implemented in physical devices, such as Ethernet controllers and physical switches, as well as virtual, software-defined components including virtual switches.

    LOADING DATA USING SUB-THREAD INFORMATION IN A PROCESSOR
    95.
    发明申请
    LOADING DATA USING SUB-THREAD INFORMATION IN A PROCESSOR 审中-公开
    在处理器中使用子螺纹信息加载数据

    公开(公告)号：US20170039144A1

    公开(公告)日：2017-02-09

    申请号：US14820802

    申请日：2015-08-07

    Applicant: Intel Corporation

    Inventor： Ren Wang ,  Kevin B. Theobald ,  Sameh Gobriel ,  Tsung-Yuan C. Tai

    IPC: G06F12/12 ,  G06F12/08

    CPC classification number: G06F12/123 ,  G06F12/0875 ,  G06F12/126 ,  G06F2212/1021 ,  G06F2212/30 ,  G06F2212/452 ,  G06F2212/602

    Abstract: In one embodiment, a processor includes a core to execute instructions, a cache memory coupled to the core, and a cache controller coupled to the cache memory. The cache controller, responsive to a first load request having a first priority level, is to insert data of the first load request into a first entry of the cache memory and set an age indicator of a metadata field of the first entry to a first age level, the first age level greater than a default age level of a cache insertion policy for load requests, and responsive to a second load request having a second priority level to insert data of the second load request into a second entry of the cache memory and to set an age indicator of a metadata field of the second entry to the default age level, the first and second load requests of a first thread. Other embodiments are described and claimed.

    Abstract translation: 在一个实施例中，处理器包括执行指令的核心，耦合到核心的高速缓冲存储器以及耦合到高速缓存存储器的高速缓存控制器。 高速缓存控制器响应于具有第一优先级的第一加载请求，将第一加载请求的数据插入到高速缓冲存储器的第一条目中，并将第一条目的元数据字段的年龄指示符设置为第一年龄 级别，所述第一年龄级别大于用于加载请求的高速缓存插入策略的默认年龄级别，并响应于具有第二优先级的第二加载请求，以将所述第二加载请求的数据插入所述高速缓存存储器的第二条目;以及 将第二条目的元数据字段的年龄指示符设置为默认年龄级别，第一线程的第一和第二加载请求。 描述和要求保护其他实施例。

    Channel aware job scheduling
    97.
    发明授权
    Channel aware job scheduling 有权
    信道感知作业调度

    公开(公告)号：US09253793B2

    公开(公告)日：2016-02-02

    申请号：US13720169

    申请日：2012-12-19

    Applicant: Intel Corporation

    Inventor： Ren Wang ,  Alexander W. Min ,  Jr-Shian Tsai ,  Tsung-Yuan C. Tai ,  Mesut A. Ergin

    IPC: H04W4/00 ,  H04W72/12

    CPC classification number: H04W72/1226

    Abstract: Methods and systems may provide for determining quality of service (QoS) information for a job associated with an application, and determining a condition prediction for a wireless channel of a mobile platform. Additionally, the job may be scheduled for communication over the wireless channel based at least in part on the QoS information and the condition prediction. In one example, scheduling the job includes imposing a delay in the communication if the condition prediction indicates that a throughput of the wireless channel is below a threshold and the delay complies with a latency constraint of the QoS information.

    Abstract translation: 方法和系统可以提供用于确定与应用相关联的作业的服务质量（QoS）信息，以及确定移动平台的无线信道的条件预测。 另外，可以至少部分地基于QoS信息和条件预测来调度该作业通过无线信道进行通信。 在一个示例中，如果条件预测指示无线信道的吞吐量低于阈值并且延迟符合QoS信息的等待时间约束，则调度该作业包括在通信中施加延迟。

    Apparatus and method for a closed-loop dynamic resource allocation control framework
    99.
    发明授权
    Apparatus and method for a closed-loop dynamic resource allocation control framework 有权

    公开(公告)号：US12210434B2

    公开(公告)日：2025-01-28

    申请号：US16914305

    申请日：2020-06-27

    Applicant: Intel Corporation

    Inventor： Bin Li ,  Ren Wang ,  Kshitij Arun Doshi ,  Francesc Guim Bernat ,  Yipeng Wang ,  Ravishankar Iyer ,  Andrew Herdrich ,  Tsung-Yuan Tai ,  Zhu Zhou ,  Rasika Subramanian

    IPC: G06F11/34 ,  G06F9/50 ,  G06F18/21 ,  G06N20/00

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

    Technologies for dynamic batch size management
    100.
    发明授权
    Technologies for dynamic batch size management 有权

    公开(公告)号：US11757802B2

    公开(公告)日：2023-09-12

    申请号：US17838872

    申请日：2022-06-13

    Applicant: Intel Corporation

    Inventor： Ren Wang ,  Mia Primorac ,  Tsung-Yuan C. Tai ,  Saikrishna Edupuganti ,  John J. Browne

    IPC: H04L49/90 ,  H04L47/36 ,  H04L49/9005

    CPC classification number: H04L49/9068 ,  H04L47/365 ,  H04L49/9005

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

Patent Agency Ranking