利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

46 条记录 (耗时 0.024 秒)

    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
    1.
    发明授权
    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要求的类，对于未来的高速缓存大小会有所增加。

    USING MULTIPLE DATA STRUCTURES TO MANAGE DATA IN CACHE
    5.
    发明申请
    USING MULTIPLE DATA STRUCTURES TO MANAGE DATA IN CACHE 失效
    使用多个数据结构来管理缓存中的数据

    公开(公告)号：US20080021853A1

    公开(公告)日：2008-01-24

    申请号：US11459004

    申请日：2006-07-20

    申请人： Dharmendra Shantilal Modha ,  Binny Sher Gill ,  Michael Thomas Benhase ,  Joseph Smith Hyde

    发明人： Dharmendra Shantilal Modha ,  Binny Sher Gill ,  Michael Thomas Benhase ,  Joseph Smith Hyde

    IPC分类号： G06N3/10

    CPC分类号： G06F12/124 ,  G06F12/123

    摘要： Provided are a method, system and program for using multiple data structures to manage data in cache. A plurality of data structures each have entries identifying data from a first computer readable medium added to a second computer readable medium. A request is received for data in the first computer readable medium. A determination is made as to whether there is an entry for the requested data in one of the data structures. The requested data is retrieved from the first computer readable medium to store in the second computer readable medium in response to determining that there is no entry for the requested data in one of the data structures. One of the data structures is selected in response to determining that there is no entry for the requested data in one of the data structures and an entry for the retrieved data is added to the selected data structure.

    摘要翻译： 提供了一种使用多个数据结构来管理缓存中的数据的方法，系统和程序。 多个数据结构各自具有标识来自添加到第二计算机可读介质的第一计算机可读介质的数据的条目。 接收第一计算机可读介质中的数据的请求。 确定在数据结构之一中是否存在所请求的数据的条目。 响应于确定在数据结构之一中没有针对所请求的数据的条目，从第一计算机可读介质检索所请求的数据以存储在第二计算机可读介质中。 响应于确定在数据结构之一中没有针对所请求的数据的条目而选择数据结构中的一个，并且将所检索的数据的条目添加到所选择的数据结构。

    Clustering hypertext with applications to WEB searching
    6.
    发明授权
    Clustering hypertext with applications to WEB searching 有权
    将超文本聚类到应用程序到WEB搜索

    公开(公告)号：US07233943B2

    公开(公告)日：2007-06-19

    申请号：US10660242

    申请日：2003-09-11

    申请人： Dharmendra Shantilal Modha ,  William Scott Spangler

    发明人： Dharmendra Shantilal Modha ,  William Scott Spangler

    IPC分类号： G06F17/30 ,  G06F7/00

    CPC分类号： G06K9/6223 ,  G06F17/30864 ,  Y10S707/99933

    摘要： A method of searching a database of documents, wherein the method includes performing a search of the database using a query to produce query result documents; constructing a word dictionary of words within the query result documents; constructing an out-link dictionary of documents within the database that are pointed to by the query result documents; adding the query result documents to the out-link dictionary; constructing an in-link dictionary of documents within the database that point to the query result documents; and adding the query result documents to the in-link dictionary.

    摘要翻译： 一种搜索文档数据库的方法，其中所述方法包括使用查询来执行数据库的搜索以产生查询结果文档; 在查询结果文档中构建单词词典; 构建数据库中由查询结果文档指向的文档的外链接字典; 将查询结果文档添加到外链字典; 构建数据库中指向查询结果文档的文档的链接字典; 并将查询结果文档添加到链接字典中。

    Concept decomposition using clustering
    7.
    发明授权
    Concept decomposition using clustering 失效
    使用聚类的概念分解

    公开(公告)号：US06560597B1

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

    申请号：US09528941

    申请日：2000-03-21

    申请人： Inderjit Singh Dhillon ,  Dharmendra Shantilal Modha

    发明人： Inderjit Singh Dhillon ,  Dharmendra Shantilal Modha

    IPC分类号： G06F1730

    CPC分类号： G06F17/3071 ,  Y10S707/99934 ,  Y10S707/99936 ,  Y10S707/99943

    摘要： A system and method operates with a document collection in which documents are represented as normalized document vectors. The document vector space is partitioned into a set of disjoint clusters and a concept vector is computed for each partition, the concept vector comprising the mean vector of all the documents in each partition. Documents are then reassigned to the cluster having their closest concept vector, and a new set of concept vectors for the new partitioning is computed. From an initial partitioning, the concept vectors are iteratively calculated to a stopping threshold value, leaving a concept vector subspace of the document vectors. The documents can then be projected onto the concept vector subspace to be represented as a linear combination of the concept vectors, thereby reducing the dimensionality of the document space. A search query can be received for the content of text documents and a search can then be performed on the projected document vectors to identify text documents that correspond to the search query.

    摘要翻译： 系统和方法与文档集合一起操作，其中文档被表示为归一化的文档向量。 文档向量空间被分割成一组不相交的簇，并且为每个分区计算概念向量，该概念向量包括每个分区中的所有文档的平均向量。 然后将文档重新分配给具有最接近的概念向量的集群，并且计算新的分区的新的一组概念向量。 从初始分割，将概念向量迭代计算为停止阈值，留下文档向量的概念向量子空间。 然后可以将文档投影到概念向量子空间上以被表示为概念向量的线性组合，从而降低文档空间的维度。 可以接收关于文本文档的内容的搜索查询，然后可以对投影的文档向量执行搜索以识别与搜索查询相对应的文本文档。