利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

100 条记录 (耗时 0.033 秒)

    Packet coalescing
    3.
    发明授权
    Packet coalescing 有权
    分组聚合

    公开(公告)号：US08718096B2

    公开(公告)日：2014-05-06

    申请号：US12980682

    申请日：2010-12-29

    申请人： Srihari Makineni ,  Ravishankar Iyer ,  David Minturn ,  Sujoy Sen ,  Donald Newell ,  Li Zhao

    发明人： Srihari Makineni ,  Ravishankar Iyer ,  David Minturn ,  Sujoy Sen ,  Donald Newell ,  Li Zhao

    IPC分类号： H04J3/24

    CPC分类号： H04L45/74 ,  H04L49/20 ,  H04L69/16 ,  H04L69/161 ,  H04L69/166

    摘要： In general, in one aspect, the disclosures describes a method that includes receiving multiple ingress Internet Protocol packets, each of the multiple ingress Internet Protocol packets having an Internet Protocol header and a Transmission Control Protocol segment having a Transmission Control Protocol header and a Transmission Control Protocol payload, where the multiple packets belonging to a same Transmission Control Protocol/Internet Protocol flow. The method also includes preparing an Internet Protocol packet having a single Internet Protocol header and a single Transmission Control Protocol segment having a single Transmission Control Protocol header and a single payload formed by a combination of the Transmission Control Protocol segment payloads of the multiple Internet Protocol packets. The method further includes generating a signal that causes receive processing of the Internet Protocol packet.

    摘要翻译： 一般来说，一方面，本公开内容描述了一种方法，其包括接收多个入口因特网协议分组，所述多个入口因特网协议分组中的每一个具有因特网协议报头和具有传输控制协议报头和传输控制的传输控制协议段 协议有效载荷，其中属于相同传输控制协议/因特网协议的多个分组流。 该方法还包括准备具有单个因特网协议报头的互联网协议分组和具有单个传输控制协议报头的单个传输控制协议段和由多个因特网协议分组的传输控制协议段有效载荷的组合形成的单个有效载荷 。 该方法还包括产生导致因特网协议分组的接收处理的信号。

    Selectively inclusive cache architecture
    6.
    发明申请
    Selectively inclusive cache architecture 有权
    选择性包容性缓存架构

    公开(公告)号：US20080040555A1

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

    申请号：US11503777

    申请日：2006-08-14

    申请人： Ravishankar Iyer ,  Li Zhao ,  Srihari Makineni ,  Donald Newell

    发明人： Ravishankar Iyer ,  Li Zhao ,  Srihari Makineni ,  Donald Newell

    IPC分类号： G06F13/00 ,  G06F12/00

    CPC分类号： G06F12/0811 ,  G06F12/0831

    摘要： In one embodiment, the present invention includes a method for maintaining data in a first level cache non-inclusively with data in a second level cache coupled to the first level cache. At the same time, at least a portion of directory information associated with the data in the first level cache may be maintained inclusively with a directory portion of the second level cache. Other embodiments are described and claimed.

    摘要翻译： 在一个实施例中，本发明包括一种用于在与第一级高速缓存耦合的第二级高速缓存中的数据非包含地维护第一级高速缓存中的数据的方法。 同时，可以与第二级高速缓存的目录部分一起保持与第一级高速缓存中的数据相关联的目录信息的至少一部分。 描述和要求保护其他实施例。

    Providing quality of service (QoS) for cache architectures using priority information
    7.
    发明申请
    Providing quality of service (QoS) for cache architectures using priority information 有权
    使用优先级信息为缓存架构提供服务质量（QoS）

    公开(公告)号：US20080040554A1

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

    申请号：US11503633

    申请日：2006-08-14

    申请人： Li Zhao ,  Ravishankar Iyer ,  Ramesh Illikkal ,  Srihari Makineni ,  Donald Newell

    发明人： Li Zhao ,  Ravishankar Iyer ,  Ramesh Illikkal ,  Srihari Makineni ,  Donald Newell

    IPC分类号： G06F13/00

    CPC分类号： G06F12/126

    摘要： In one embodiment, the present invention includes a method for associating a first priority indicator with first data stored in a first entry of a cache memory to indicate a priority level of the first data, and updating a count value associated with the first priority indicator. The count value may then be used in determining an appropriate cache line for eviction. Other embodiments are described and claimed.

    摘要翻译： 在一个实施例中，本发明包括一种用于将第一优先级指示符与存储在高速缓冲存储器的第一条目中的第一数据相关联以指示第一数据的优先级，以及更新与第一优先级指示符相关联的计数值的方法。 然后可以将计数值用于确定用于驱逐的适当的高速缓存行。 描述和要求保护其他实施例。

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

    公开(公告)号：US07802057B2

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

    申请号：US11965131

    申请日：2007-12-27

    申请人： Ravishankar Iyer ,  Ramesh Milekal ,  Donald Newell ,  Li Zhao

    发明人： Ravishankar Iyer ,  Ramesh Milekal ,  Donald Newell ,  Li Zhao

    IPC分类号： G06F12/06 ,  G06F9/50

    CPC分类号： G06F12/126 ,  G06F9/5016 ,  G06F12/0888

    摘要： 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.

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

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

    公开(公告)号：US20090172315A1

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

    申请号：US11965131

    申请日：2007-12-27

    申请人： Ravishankar Iyer ,  Ramesh Milekal ,  Donald Newell ,  Li Zhao

    发明人： Ravishankar Iyer ,  Ramesh Milekal ,  Donald Newell ,  Li Zhao

    IPC分类号： G06F12/00

    CPC分类号： G06F12/126 ,  G06F9/5016 ,  G06F12/0888

    摘要： 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.

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