利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

46 条记录 (耗时 0.04 秒)

    System and method for dynamically allocating cache space among different workload classes that can have different quality of service (QoS) requirements where the system and method may maintain a history of recently evicted pages for each class and may determine a future cache size for the class based on the history and the QoS requirements
    17.
    发明授权
    System and method for dynamically allocating cache space among different workload classes that can have different quality of service (QoS) requirements where the system and method may maintain a history of recently evicted pages for each class and may determine a future cache size for the class based on the history and the QoS requirements 有权
    在可以具有不同服务质量（QoS）要求的不同工作负载类别之间动态分配高速缓存空间的系统和方法，其中系统和方法可以维护每个类的最近被逐出的页面的历史，并且可以确定基于类的未来高速缓存大小 关于历史和QoS要求

    公开(公告)号：US07107403B2

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

    申请号：US10676464

    申请日：2003-09-30

    申请人： Dharmendra Shantilal Modha ,  Divyesh Jadav ,  Pawan Goyal ,  Renu Tewari

    发明人： Dharmendra Shantilal Modha ,  Divyesh Jadav ,  Pawan Goyal ,  Renu Tewari

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

    CPC分类号： G06F9/5016 ,  G06F12/0871 ,  G06F12/12 ,  G06F2212/282 ,  G06F2212/6042

    摘要： A method and system for dynamically allocating cache space in a storage system among multiple workload classes each having a unique set of quality-of-service (QoS) requirements. The invention dynamically adapts the space allocated to each class depending upon the observed response time for each class and the observed temporal locality in each class. The dynamic allocation is achieved by maintaining a history of recently evicted pages for each class, determining a future cache size for the class based on the history and the QoS requirements where the future cache size might be different than a current cache size for the class, determining whether the QoS requirements for the class are being met, and adjusting the future cache size to maximize the number of classes in which the QoS requirements are met. The future cache sizes are increased for the classes whose QoS requirements are not met while they are decreased for those whose QoS requirements are met.

    摘要翻译： 一种用于在多个工作负载类别中动态地分配存储系统中的高速缓存空间的方法和系统，每个工作负载类别具有唯一的服务质量（QoS）要求。 本发明根据每个类的观察到的响应时间和每个类中观察到的时间局部性动态地适应分配给每个类的空间。 通过维护每个类别的最近被逐出的页面的历史来实现动态分配，基于历史和QoS要求确定将来的高速缓存大小，其中将来的高速缓存大小可能与该类的当前高速缓存大小不同， 确定是否满足该类的QoS要求，以及调整未来的高速缓存大小以最大化满足QoS要求的类的数量。 对于满足QoS要求的类，对于满足QoS要求的用户而言，对于不满足QoS要求的类，对于未来的高速缓存大小会有所增加。

    Feature weighting in κ-means clustering
    18.
    发明授权
    Feature weighting in κ-means clustering 有权
    kappa均值聚类中的特征加权

    公开(公告)号：US06952700B2

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

    申请号：US09813896

    申请日：2001-03-22

    申请人： Dharmendra Shantilal Modha ,  William Scott Spangler

    发明人： Dharmendra Shantilal Modha ,  William Scott Spangler

    IPC分类号： G06F15/00 ,  G06F17/00 ,  G06K9/62

    CPC分类号： G06K9/6223 ,  G06K9/6228 ,  Y10S707/957 ,  Y10S707/99942

    摘要： A method and system is provided for integrating multiple feature spaces in a k-means clustering algorithm when analyzing data records having multiple, heterogeneous feature spaces. The method assigns different relative weights to these various features spaces. Optimal feature weights are also determined that lead to a clustering that simultaneously minimizes the average intra-cluster dispersion and maximizes the average inter-cluster dispersion along all the feature spaces. Examples are provided that empirically demonstrate the effectiveness of feature weighting in clustering using two different feature domains.

    摘要翻译： 提供了一种方法和系统，用于在分析具有多个异构特征空间的数据记录时，在k均值聚类算法中集成多个特征空间。 该方法为这些各种特征空间分配不同的相对权重。 还确定了最优特征权重，其导致聚类，其同时使平均群内色散最小化，并使沿着所有特征空间的平均簇间色散最大化。 提供了实例来证明使用两个不同特征域的聚类中特征加权的有效性。

    System and method for generating low density parity check codes using bit-filling
    19.
    发明授权
    System and method for generating low density parity check codes using bit-filling 失效
    使用比特填充生成低密度奇偶校验码的系统和方法

    公开(公告)号：US06789227B2

    公开(公告)日：2004-09-07

    申请号：US09899459

    申请日：2001-07-05

    申请人： Jorge Campello De Souza ,  Dharmendra Shantilal Modha ,  Sridhar Rajagopalan

    发明人： Jorge Campello De Souza ,  Dharmendra Shantilal Modha ,  Sridhar Rajagopalan

    IPC分类号： G06F1100

    CPC分类号： H03M13/033 ,  G06F11/1076 ,  H03M13/1102

    摘要： A computer-implemented system and method is for generating low-density parity check (LDPC) codes. One aspect of the invention includes a method for generating high rate LDPC codes that first constructs a matrix (H) of size m×n having m rows of check nodes and n columns of bit nodes. The matrix meets the following requirements: the weight of the j−th column equals aj; each row, r, has weight at most br; and the matrix H can be represented by a Tanner graph that has a girth of at least g≧g. The method then iteratively adds an (n+1)th column (U1) to matrix H, wherein the size of U1, is initially empty and is at most an+1, and wherein U1, comprises a set of i check nodes such that i is greater than or equal to 0 and i is less than an+1. The method then iteratively adds check nodes to U1. such that each check node does not violate predetermined girth and check-degree constraints. The matrix H is updated when a new column is added. The iterations are terminated if there are no new check nodes that do not violate the girth and check-degree constraints. The method can be modified to optimize various parameters, including the following cases: maximizing the rate for a fixed girth; maximizing the girth for a fixed rate; and maximizing the rate for a fixed girth and fixed length.

    摘要翻译： 计算机实现的系统和方法是用于生成低密度奇偶校验（LDPC）码。 本发明的一个方面包括一种用于产生高速率LDPC码的方法，该方法首先构建具有m行校验节点和n列位节点的大小为m×n的矩阵（H）。 矩阵满足以下要求：第j个列的权重等于aj; 每排r最大重量为br; 并且矩阵H可以由具有至少g> = g的周长的Tanner图表示。 然后，该方法迭代地将（n + 1）列（U1）添加到矩阵H，其中U1的大小最初为空，并且最多为+ 1，并且其中U1包括一组i个校验节点 使得i大于或等于0，并且i小于+ 1。 然后该方法迭代地向U1添加校验节点。 使得每个校验节点不违反预定的周长和校验度约束。 添加新列时更新矩阵H. 如果没有新的检查节点没有违反周长和检查度限制，则迭代将被终止。 该方法可以修改以优化各种参数，包括以下情况：最大化固定周长的速率; 以固定利率最大化周长; 并使固定长度和固定长度的速率最大化。

    System and method for constructing low complexity block coders
    20.
    发明授权
    System and method for constructing low complexity block coders 有权
    用于构建低复杂度块编码器的系统和方法

    公开(公告)号：US06430713B1

    公开(公告)日：2002-08-06

    申请号：US09345579

    申请日：1999-06-30

    申请人： Brian Harry Marcus ,  Dharmendra Shantilal Modha

    发明人： Brian Harry Marcus ,  Dharmendra Shantilal Modha

    IPC分类号： G06F1100

    CPC分类号： H03M5/145 ,  G11B20/1426

    摘要： A method for designing a computer program for finding a low-complexity coder for constrained block codes for application to timing recovery or error control in data recording systems. The method includes (1) decomposing an input set of candidate codewords into simple subsets of codewords, (2) providing, for each simple subset of codewords, a respective subset of datawords, and (3) filling in certain coordinates in the datawords by values of certain coordinates in the codewords.

    摘要翻译： 一种用于设计计算机程序的方法，用于找到用于受限块代码的低复杂度编码器，以应用于数据记录系统中的定时恢复或错误控制。 该方法包括：（1）将候选码字的输入集合分解为码字的简单子集，（2）为码字的每个简单子集提供数据词的相应子集，以及（3）通过数值字填充某些坐标值 在码字中具有某些坐标。