System and method for predicting cache performance
    1.
    发明授权
    System and method for predicting cache performance 有权
    用于预测缓存性能的系统和方法

    公开(公告)号:US06952664B1

    公开(公告)日:2005-10-04

    申请号:US09834342

    申请日:2001-04-13

    IPC分类号: G06F17/50 G06G17/50

    CPC分类号: G06F17/5022

    摘要: A system and methods for simulating the performance (e.g., miss rate) of one or more caches. A cache simulator comprises a segmented list of buffers, with each buffer configured to store a data identifier and an identifier of the buffer's segment. Data references, which may be copied from an operational cache, are applied to the list to conduct the simulation. Initial estimates of each cache's miss rate include the number of references that missed all segments of the list plus the hits in all segments not part of the cache. A correction factor is generated from the ratio of actual misses incurred by the operational cache to the estimated misses for a simulated cache of the same size as the operational cache. Final predictions are generated by multiplying the initial estimates by the correction factor. The size of the operational cache may be dynamically adjusted based on the final predictions.

    摘要翻译: 用于模拟一个或多个高速缓存的性能(例如,错过率)的系统和方法。 缓存模拟器包括分段缓冲器列表,其中每个缓冲器被配置为存储数据标识符和缓冲器段的标识符。 可以从操作缓存复制的数据引用被应用于列表以进行模拟。 每个缓存的未命中率的初始估计包括丢失列表的所有段的引用数量加上不是高速缓存的一部分的所有段中的命中。 由操作缓存引起的实际未命中率与与操作缓存大小相同的模拟高速缓存的估计未命中的比率产生校正因子。 最终预测是通过将初始估计乘以校正因子而产生的。 可以基于最终预测来动态地调整操作高速缓存的大小。

    Sharing, updating data blocks among multiple nodes in a distributed
system
    2.
    发明授权
    Sharing, updating data blocks among multiple nodes in a distributed system 失效
    在分布式系统中的多个节点之间共享,更新数据块

    公开(公告)号:US6012060A

    公开(公告)日:2000-01-04

    申请号:US865651

    申请日:1997-05-30

    IPC分类号: G06F17/30

    摘要: A method for preventing multiple pings. An embodiment of the invention detects requests of data blocks entailing pings likely to cause additional pings. The servicing of requests involving a pings likely to cause additional pings is deferred until a service enabling conditions occurs. Another embodiment of the invention detects situations where by further updating a data block before pinging the data block use of resources on the remote node requesting the data block are reduced. The servicing of the request for the data block is deferred until a service enabling conditions occurs.

    摘要翻译: 一种防止多次ping的方法。 本发明的一个实施例检测到可能导致额外ping的点的数据块的请求。 涉及可能引起额外波的呼吸的请求的服务被推迟到发生服务使能条件。 本发明的另一实施例检测在ping数据块之前进一步更新数据块的情况,数据块在远程节点上的资源使用被请求数据块减少。 对数据块的请求的服务被延迟,直到发生服务使能条件。

    ELIMINATING FRAGMENTATION WITH BUDDY-TREE ALLOCATION
    7.
    发明申请
    ELIMINATING FRAGMENTATION WITH BUDDY-TREE ALLOCATION 有权
    用BUDDY-TREE分配来消除分类

    公开(公告)号:US20080244210A1

    公开(公告)日:2008-10-02

    申请号:US11694445

    申请日:2007-03-30

    IPC分类号: G06F12/00

    摘要: This disclosure describes solutions for reducing the amount of fragmentation on a computer memory device, such as a hard disk, random access memory device, and/or the like. In an aspect, this disclosure describes systems, methods and software for allocating storage space for variable-sized data chunks in a fashion that reduces or eliminates the need for periodic de-fragmentation of the memory device. In another aspect, this disclosure describes solutions that provide for the dynamic re-allocation of existing data blocks on the memory device to provide contiguous available space that can be allocated for new data blocks.

    摘要翻译: 本公开描述了用于减少计算机存储设备(例如硬盘,随机存取存储器设备等)上的碎片量的解决方案。 在一方面,本公开描述了用于以减少或消除对存储器件的周期性解片的需要的方式为可变大小的数据块分配存储空间的系统,方法和软件。 在另一方面,本公开描述了提供对存储器设备上的现有数据块的动态重新分配以提供可被分配给新数据块的连续可用空间的解决方案。