利索-全球专利检索

  1. Login
  2. Sign Up

Search Results

94 records (took 0.024 seconds)

    Bread box
    1.
    外观设计
    Bread box 有权

    公开(公告)号：USD957887S1

    公开(公告)日：2022-07-19

    申请号：US29764592

    申请日：2020-12-31

    Applicant: Li Zhao

    Designer： Li Zhao

    Method for Route Transmission Based on Single IPv6 Address Prefix, and Wireless Device
    3.
    发明申请
    Method for Route Transmission Based on Single IPv6 Address Prefix, and Wireless Device 有权
    基于单IPv6地址前缀的路由传输方法和无线设备

    公开(公告)号：US20140215087A1

    公开(公告)日：2014-07-31

    申请号：US14241989

    申请日：2012-02-17

    Applicant: Li Zhao ,  Tao Lu ,  Jianfeng Li ,  Xiaoliang Ma

    Inventor： Li Zhao ,  Tao Lu ,  Jianfeng Li ,  Xiaoliang Ma

    IPC: H04W8/26 ,  H04W80/04 ,  H04W84/18 ,  H04L29/12 ,  H04L29/06

    CPC classification number: H04W8/26 ,  H04L45/74 ,  H04L61/2007 ,  H04L61/25 ,  H04L61/6004 ,  H04L61/6022 ,  H04L61/6059 ,  H04L61/6068 ,  H04L61/6077 ,  H04L61/6086 ,  H04L69/16 ,  H04W40/24 ,  H04W80/04 ,  H04W84/18

    Abstract: The present document provides a method and wireless device for implementing route transmission based on a single IPv6 address prefix. The method includes: when a wireless device succeeds in IPv6-based dialing and obtains one 64-bit-long IPv6 address prefix from a network side, the wireless device first setting apart a 126-bit IPv6 address prefix from the prefix, and then allocating the 126-bit IPv6 address prefix to a WAN interface, allocating the 64-bit-long IPv6 address prefix to a LAN interface, and notifying a user terminal connected to the LAN interface of the IPv6 prefix of the LAN interface, so that the user terminal connected to the LAN interface generates its own IPv6 address through a stateless address auto-configuration mechanism for communication. With the technical solutions of the present document, in an IPv4/IPv6 dual stack mode, IPv4 and IPv6 protocol stacks operate normally, and the radio resource consumption is reduced.

    Abstract translation: 本文提供了一种基于单个IPv6地址前缀实现路由传输的方法和无线设备。 该方法包括：当无线设备成功进行基于IPv6的拨号，并从网络侧获取一个64位长的IPv6地址前缀时，无线设备首先从前缀中分离出126比特的IPv6地址前缀，然后分配 向WAN接口提供126位IPv6地址前缀，将64位长的IPv6地址前缀分配给LAN接口，并将连接到LAN接口的用户终端通知LAN接口的IPv6前缀，以便用户 连接到LAN接口的终端通过无状态地址自动配置机制生成自己的IPv6地址进行通信。 通过本文档的技术方案，在IPv4 / IPv6双栈模式下，IPv4和IPv6协议栈运行正常，无线资源消耗减少。

    Controlling access to a cache memory using privilege level information
    5.
    发明授权
    Controlling access to a cache memory using privilege level information 有权
    使用特权级别信息控制对高速缓存的访问

    公开(公告)号：US08621149B2

    公开(公告)日：2013-12-31

    申请号：US12645788

    申请日：2009-12-23

    Applicant: Zhen Fang ,  Li Zhao ,  Ravishankar Iyer ,  Tong Li ,  Donald K. Newell

    Inventor： Zhen Fang ,  Li Zhao ,  Ravishankar Iyer ,  Tong Li ,  Donald K. Newell

    IPC: G06F12/00 ,  G06F13/00 ,  G06F13/28 ,  G06F9/26 ,  G06F9/34

    CPC classification number: G06F12/0895 ,  G06F12/1491 ,  Y02D10/13

    Abstract: In one embodiment, a cache memory includes entries each to store a ring level identifier, which may indicate a privilege level of information stored in the entry. This identifier may be used in performing read accesses to the cache memory. As an example, a logic coupled to the cache memory may filter an access to one or more ways of a selected set of the cache memory based at least in part on a current privilege level of a processor and the ring level identifier of the one or more ways. Other embodiments are described and claimed.

    Abstract translation: 在一个实施例中，高速缓冲存储器包括各自存储环电平标识符的条目，其可以指示存储在条目中的信息的权限级别。 该标识符可用于执行对高速缓冲存储器的读取访问。 作为示例，耦合到高速缓存存储器的逻辑可以至少部分地基于处理器的当前特权级别和一个或多个高速缓冲存储器的环电平标识符来过滤对所选择的高速缓冲存储器组的一种或多种方式的访问， 更多的方式 描述和要求保护其他实施例。

    Priority aware selective cache allocation
    6.
    发明授权
    Priority aware selective cache allocation 有权
    优先级识别选择性缓存分配

    公开(公告)号：US07802057B2

    公开(公告)日：2010-09-21

    申请号：US11965131

    申请日：2007-12-27

    Applicant: Ravishankar Iyer ,  Ramesh Milekal ,  Donald Newell ,  Li Zhao

    Inventor： Ravishankar Iyer ,  Ramesh Milekal ,  Donald Newell ,  Li Zhao

    IPC: G06F12/06 ,  G06F9/50

    CPC classification number: G06F12/126 ,  G06F9/5016 ,  G06F12/0888

    Abstract: A method and apparatus for is herein described providing priority aware and consumption guided dynamic probabilistic allocation for a cache memory. Utilization of a sample size of a cache memory is measured for each priority level of a computer system. Allocation probabilities for each priority level are updated based on the measured consumption/utilization, i.e. allocation is reduced for priority levels consuming too much of the cache and allocation is increased for priority levels consuming too little of the cache. In response to an allocation request, it is assigned a priority level. An allocation probability associated with the priority level is compared with a randomly generated number. If the number is less than the allocation probability, then a fill to the cache is performed normally. In contrast, a spatially or temporally limited fill is performed if the random number is greater than the allocation probability.

    Abstract translation: 本文描述了提供高速缓冲存储器的优先级感知和消耗引导的动态概率分配的方法和装置。 针对计算机系统的每个优先级测量利用高速缓冲存储器的样本大小。 基于所测量的消耗/利用率来更新每个优先级的分配概率，即对于消耗太多高速缓存的优先级降低了分配，并且对于消耗太多缓存的优先级来说，分配增加。 响应于分配请求，它被分配优先级。 将与优先级相关联的分配概率与随机生成的数字进行比较。 如果该数量小于分配概率，则正常地执行对高速缓存的填充。 相比之下，如果随机数大于分配概率，则执行空间或时间有限的填充。

    PRIORITY AWARE SELECTIVE CACHE ALLOCATION
    9.
    发明申请
    PRIORITY AWARE SELECTIVE CACHE ALLOCATION 有权
    优先注意选择性高速缓存分配

    公开(公告)号：US20090172315A1

    公开(公告)日：2009-07-02

    申请号：US11965131

    申请日：2007-12-27

    Applicant: Ravishankar Iyer ,  Ramesh Milekal ,  Donald Newell ,  Li Zhao

    Inventor： Ravishankar Iyer ,  Ramesh Milekal ,  Donald Newell ,  Li Zhao

    IPC: G06F12/00

    CPC classification number: G06F12/126 ,  G06F9/5016 ,  G06F12/0888

    Abstract: A method and apparatus for is herein described providing priority aware and consumption guided dynamic probabilistic allocation for a cache memory. Utilization of a sample size of a cache memory is measured for each priority level of a computer system. Allocation probabilities for each priority level are updated based on the measured consumption/utilization, i.e. allocation is reduced for priority levels consuming too much of the cache and allocation is increased for priority levels consuming too little of the cache. In response to an allocation request, it is assigned a priority level. An allocation probability associated with the priority level is compared with a randomly generated number. If the number is less than the allocation probability, then a fill to the cache is performed normally. In contrast, a spatially or temporally limited fill is performed if the random number is greater than the allocation probability.

    Abstract translation: 本文描述了提供高速缓冲存储器的优先级感知和消耗引导的动态概率分配的方法和装置。 针对计算机系统的每个优先级测量利用高速缓冲存储器的样本大小。 基于所测量的消耗/利用率来更新每个优先级的分配概率，即对于消耗太多高速缓存的优先级降低了分配，并且对于消耗太多缓存的优先级来说，分配增加。 响应于分配请求，它被分配优先级。 将与优先级相关联的分配概率与随机生成的数字进行比较。 如果该数量小于分配概率，则正常地执行对高速缓存的填充。 相比之下，如果随机数大于分配概率，则执行空间或时间有限的填充。

Patent Agency Ranking