Efficient CRC generation utilizing parallel table lookup operations
    2.
    发明授权
    Efficient CRC generation utilizing parallel table lookup operations 失效
    使用并行表查找操作的高效CRC生成

    公开(公告)号:US06223320B1

    公开(公告)日:2001-04-24

    申请号:US09021516

    申请日:1998-02-10

    IPC分类号: H03M1300

    摘要: An improved CRC generation mechanism for generating a CRC value of relevant data in a digital data stream is disclosed wherein relevant data in the data stream is identified and partitioned into a plurality of intervals. A CRC value is determined for each interval by partitioning the interval into a plurality of chunks, loading from persistent storage a table of CRC values for a range of chunks, determining a CRC value for each of the chunks with parallel table lookup operations on the table, and combining the CRC values for the chunks. The CRC values for each of the intervals is combined to generate the CRC for the relevant data. The parallel table look operation is preferably a vector permute instruction that is executed by a SIMD-style vector unit.

    摘要翻译: 公开了一种用于在数字数据流中生成相关数据的CRC值的改进的CRC生成机制,其中识别数据流中的相关数据并将其划分为多个间隔。 通过将间隔划分成多个块来确定每个间隔的CRC值,从持久存储器加载块范围的CRC值表,使用表上的并行表查找操作确定每个块的CRC值 ,并组合块的CRC值。 每个间隔的CRC值被组合以产生相关数据的CRC。 平行表看法操作优选地是由SIMD式向量单元执行的向量置换指令。

    Policy decision stash for storage lifecycle management
    4.
    发明授权
    Policy decision stash for storage lifecycle management 有权
    存储生命周期管理的策略决策

    公开(公告)号:US08315993B2

    公开(公告)日:2012-11-20

    申请号:US11129275

    申请日:2005-05-13

    申请人: Marc Adam Kaplan

    发明人: Marc Adam Kaplan

    IPC分类号: G06F7/00 G06F17/00

    CPC分类号: G06F17/30085

    摘要: There is provided, in a computer processing system, an apparatus for storage lifecycle management for a plurality of managed objects. The apparatus includes a policy decision manager for creating and managing a policy decision stash. The policy decision stash is associated with predictive policy decisions for the plurality of managed objects and is configured to allow the predictive policy decisions for the plurality of managed objects to be incrementally updated and accessed in the policy decision stash by a policy identifier and an effective timestamp.

    摘要翻译: 在计算机处理系统中提供了一种用于多个管理对象的存储生命周期管理的装置。 该设备包括用于创建和管理策略决策存储的策略决策管理器。 策略决策存储与多个被管理对象的预测策略决定相关联,并且被配置为允许在策略确定存储空间中通过策略标识符和有效时间戳来增量更新和访问多个被管理对象的预测策略决策 。

    Changed files list with time buckets for efficient storage management
    6.
    发明授权
    Changed files list with time buckets for efficient storage management 失效
    使用时间桶更改文件列表以实现高效的存储管理

    公开(公告)号:US08548965B2

    公开(公告)日:2013-10-01

    申请号:US12061323

    申请日:2008-04-02

    IPC分类号: G06F7/00 G06F17/00 G06F13/14

    CPC分类号: G06F17/30091 G06F17/30144

    摘要: There is provided, in a computer processing system, an apparatus for managing object data. The apparatus includes a changed objects manager for creating and managing a changed objects list that at least identifies the objects that have changed based on time of change. The changed objects list is associated with a plurality of time buckets. Each of the plurality of time buckets is associated with a respective date and time period and with object change records for objects having a timestamp falling within the respective date and time period. Each of the object change records is associated with a unique object identifier and the timestamp for a corresponding one of the objects. The timestamp specifies a date and a time corresponding to a latest one of a creation time or a most recent update time for the corresponding one of the objects.

    摘要翻译: 在计算机处理系统中提供了一种用于管理对象数据的装置。 该装置包括用于创建和管理改变的对象列表的改变的对象管理器,其至少基于改变时间识别已经改变的对象。 更改的对象列表与多个时间桶相关联。 多个时间段中的每一个与相应的日期和时间段以及具有落在相应日期和时间段内的时间戳的对象的对象改变记录相关联。 每个对象改变记录与唯一的对象标识符和对应的一个对象的时间戳相关联。 时间戳指定对应于对应的一个对象的创建时间或最近的更新时间中的最新的一个的日期和时间。

    Dynamic online multi-parameter optimization system and method for autonomic computing systems
    7.
    发明授权
    Dynamic online multi-parameter optimization system and method for autonomic computing systems 失效
    动态在线多参数优化系统和自主计算系统的方法

    公开(公告)号:US08032615B2

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

    申请号:US12126291

    申请日:2008-05-23

    IPC分类号: G06F15/177

    摘要: A method and system performs dynamic online multi-parameter optimization for autonomic computing systems. A simplex is maintained. The system's performance is measured for the particular setting of configuration parameters associated with each point in the simplex. A new sample point is determined using the geometric transformations of the simplex. A current best point in the simplex can be resampled to determine if the environment has changed. If a sufficiently different utility value is obtained from a previously sampled utility value for the point in the simplex, the simplex is expanded. If the difference is not sufficient enough, then contraction of the simplex is performed.

    摘要翻译: 一种方法和系统对自主计算系统进行动态在线多参数优化。 保持简单。 系统的性能是针对单纯形中与每个点相关联的配置参数的特定设置进行测量的。 使用单纯形的几何变换确定新的采样点。 可以对单纯形中的当前最佳点进行重新采样,以确定环境是否已更改。 如果从单纯形中的点的先前采样的效用值获得足够不同的效用值,则单纯形将被扩展。 如果差异不够,则进行单纯形状的收缩。

    Dynamic Online Multi-Parameter Optimization System and Method for Autonomic Computing Systems
    8.
    发明申请
    Dynamic Online Multi-Parameter Optimization System and Method for Autonomic Computing Systems 失效
    动态在线多参数优化系统和自动计算系统的方法

    公开(公告)号:US20080221858A1

    公开(公告)日:2008-09-11

    申请号:US12126291

    申请日:2008-05-23

    IPC分类号: G06F9/45

    摘要: An improved method and system for performing dynamic online multi-parameter optimization for autonomic computing systems are provided. With the method and system of the present invention, a simplex, i.e. a set of points in the parameter space that has been directly sampled, is maintained. The system's performance with regard to a particular utility value is measured for the particular setting of configuration parameters associated with each point in the simplex. A new sample point is determined using the geometric transformations of the simplex. The method and system provide mechanisms for limiting the size of the simplex that is generated through these geometric transformations so that the present invention may be implemented in noisy environments in which the same configuration settings may lead to different results with regard to the utility value. In addition, mechanisms are provided for resampling a current best point in the simplex to determine if the environment has changed. If a sufficiently different utility value is obtained from a previously sampled utility value for the point in the simplex, then rather than contracting, the simplex is expanded. If the difference between utility values is not sufficient enough, then contraction of the simplex is performed. In addition, in order to allow for both real and integer valued parameters in the simplex, a mechanism is provided by which invalid valued parameters that are generated by geometric transformations being performed on the simplex are mapped to a nearest valid value. Similarly, parameter values that violate constraints are mapped to values that satisfy constraints taking care that the dimensionality of the simplex is not reduced.

    摘要翻译: 提供了一种用于自动计算系统执行动态在线多参数优化的改进方法和系统。 利用本发明的方法和系统,维持单纯形,即直接采样的参数空间中的一组点。 关于特定效用值的系统的性能是针对与单工中的每个点相关联的配置参数的特定设置进行测量的。 使用单纯形的几何变换确定新的采样点。 该方法和系统提供了用于限制通过这些几何变换产生的单工的尺寸的机制,使得本发明可以在噪声环境中实现,其中相同的配置设置可能导致关于效用值的不同结果。 此外,还提供了用于对单纯形中当前最佳点进行重新采样以确定环境是否已更改的机制。 如果从单纯形中的点的先前采样的效用值获得足够不同的效用值,则而不是收缩,则单纯形被扩展。 如果效用值之间的差异不足够,则单纯形的收缩被执行。 此外,为了允许单纯形中的实数和整数值参数,提供了一种机制,通过这种机制,通过在单纯形上执行的几何变换生成的无效值参数被映射到最接近的有效值。 类似地,违反约束的参数值被映射到满足约束的值,注意单纯形的维度不会减小。

    System and method for a multicast network messaging service

    公开(公告)号:US07054276B2

    公开(公告)日:2006-05-30

    申请号:US09778300

    申请日:2001-02-07

    申请人: Marc Adam Kaplan

    发明人: Marc Adam Kaplan

    IPC分类号: H04L12/28

    摘要: A method for the multicast distribution of a message is provided. A first real machine multicasts the message through a network of message processing machines to one or more message receiving machines, wherein the network is organized into two or more cells including machines, and wherein one or more links between cells comprise link bundles. The method includes selecting a spanning tree rooted in the cell including the first real machine, and comprised of the cells and the link bundles. The method determines one or more cells for receiving the message based on the selected spanning tree and the location of the receiving machines, and selects one or more routes from among the machines and links within the cells and link bundles to a next cell. The method further routes the message to the receiving cells in the spanning tree, and delivering the message to the receiving machines within the receiving cells.

    Concurrent evaluation of policies with synchronization
    10.
    发明授权
    Concurrent evaluation of policies with synchronization 有权
    同步评估政策

    公开(公告)号:US07783728B2

    公开(公告)日:2010-08-24

    申请号:US10995598

    申请日:2004-11-22

    CPC分类号: G06F9/52

    摘要: A policy for a computer system is transformed into a plurality of sub-policies, at least one synchronization step, and a final action. The sub-policies are distributed to corresponding sub-components in the computer system. The sub-policies are evaluated, wherein each sub-component evaluates its corresponding one or more sub-policies as other sub-components evaluate their corresponding one or more sub-policies. The sub-policies are synchronized by using the at least one synchronization step. The final action is performed in response to synchronizing the sub-policies. The computer system can be singular or distributed.

    摘要翻译: 用于计算机系统的策略被转换成多个子策略,至少一个同步步骤和最终动作。 子策略分配给计算机系统中的相应子组件。 评估子策略,其中每个子组件评估其对应的一个或多个子策略,因为其他子组件评估其对应的一个或多个子策略。 通过使用至少一个同步步骤来同步子策略。 响应于子策略的同步来执行最后的动作。 计算机系统可以是单数或分布式的。