专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06567893B1 System and method for distributed caching of objects using a publish and subscribe paradigm 有权
标题翻译：使用发布和订阅范例分布式缓存对象的系统和方法
公开(公告)号：US06567893B1
公开(公告)日：2003-05-20
申请号：US09715526
申请日：2000-11-17
申请人： James R. H. Challenger , Paul M. Dantzig , Daniel M. Dias , Nagui Halim , Arun K. Iyengar , Richard P. King
发明人： James R. H. Challenger , Paul M. Dantzig , Daniel M. Dias , Nagui Halim , Arun K. Iyengar , Richard P. King
IPC分类号： G06F1200
CPC分类号： G06F17/30902
摘要： A system and method for caching objects using a cost-based publish and subscribe paradigm, wherein a server computing node determines whether a given cache node should receive a cache update based on, e.g., the cost of sending the update. In one aspect, a method for maintaining objects in a cache comprises the steps of issuing a subscription for an object, maintaining a metric for the object; and determining, based on the metric, whether a cache is to receive an update message associated with the object. The metric is preferably correlated with one or more factors such as an importance factor of maintaining the cached copy of the object current, the cost of the sending the update message, and/or the estimated lifetime of the object.
摘要翻译：一种用于使用基于成本的发布和订阅范例来缓存对象的系统和方法，其中服务器计算节点基于例如发送更新的成本来确定给定的高速缓存节点是否应该接收高速缓存更新。一方面，一种用于维护高速缓存中的对象的方法包括以下步骤：发出对象的订阅，维护对象的度量; 以及基于所述度量来确定高速缓存是否要接收与所述对象相关联的更新消息。该度量优选地与一个或多个因素相关联，例如维护对象当前的缓存副本的重要性因素，发送更新消息的成本和/或对象的估计寿命。

2. 发明授权

US06725265B1 Method and system for caching customized information 有权
标题翻译：用于缓存定制信息的方法和系统
公开(公告)号：US06725265B1
公开(公告)日：2004-04-20
申请号：US09626327
申请日：2000-07-26
申请人： James R. H. Challenger , Paul M. Dantzig , Daniel M. Dias , Arun K. Iyengar , Junehwa Song
发明人： James R. H. Challenger , Paul M. Dantzig , Daniel M. Dias , Arun K. Iyengar , Junehwa Song
IPC分类号： G06F15173
CPC分类号： G06F17/30902
摘要： A method for providing customized information in a computer processing system includes the step of defining at least one rule for one of creating and retrieving at least one customized block of data. At least one customizable template is created which includes at least one reference to the at least one rule and at least one offset that specifies at least one position at which the at least one customized block is inserted into the at least one customizable template. The at least one customized block is inserted into the at least one customizable template at the at least one position specified by the at least one offset. The customized block, the customizable template, and/or the rule may be pre-stored in a cache of the computer processing system. The customized block may also be dynamically created.
摘要翻译：用于在计算机处理系统中提供定制信息的方法包括为创建和检索至少一个定制的数据块之一定义至少一个规则的步骤。创建至少一个可定制模板，其包括至少一个对所述至少一个规则的引用和至少一个偏移，所述至少一个偏移指定至少一个所述至少一个自定义块被插入到所述至少一个可定制模板中的位置。在由至少一个偏移指定的至少一个位置处将至少一个定制块插入至少一个可定制模板中。定制块，可定制模板和/或规则可以预先存储在计算机处理系统的高速缓存中。也可以动态创建自定义块。

3. 发明授权

US07987239B2 Method and system for caching role-specific fragments 有权
标题翻译：用于缓存角色特定片段的方法和系统
公开(公告)号：US07987239B2
公开(公告)日：2011-07-26
申请号：US11854606
申请日：2007-09-13
申请人： Rajesh S. Agarwalla , James R. H. Challenger , George P. Copeland , Arun K. Iyengar , Mark H. Linehan , Subbarao Meduri
发明人： Rajesh S. Agarwalla , James R. H. Challenger , George P. Copeland , Arun K. Iyengar , Mark H. Linehan , Subbarao Meduri
IPC分类号： G06F15/16
CPC分类号： G06F17/30902 , G06Q10/025 , G06Q30/0601 , H04L67/2842 , H04L67/288 , H04L69/329
摘要： A method, a system, an apparatus, and a computer program product are presented for a fragment caching methodology. After a message is received at a computing device, a fragment in the message body is cached. Cache ID rules from an origin server accompany a fragment to describe a method for forming a unique cache ID for the fragment such that dynamic content can be cached away from an origin server. A cache ID may be based on a URI and/or query parameters and/or cookies that are associated with a fragment. After user authentication, a cookie containing the user's role may be used in subsequent requests for role-specific fragments and in the cache identifier for role-specific fragments, thereby allowing requests from other users for role-specific fragments to be resolved in the cache when the users have the same role because these users would also have the same cookie.
摘要翻译：提出了一种用于片段缓存方法的方法，系统，装置和计算机程序产品。在计算设备接收到消息后，消息体中的片段被缓存。来自原始服务器的缓存ID规则伴随片段来描述用于为片段形成唯一缓存ID的方法，使得动态内容可以从原始服务器缓存。缓存ID可以基于与片段相关联的URI和/或查询参数和/或cookie。在用户身份验证之后，包含用户角色的cookie可能会用于后续对角色特定片段的请求以及特定于角色的片段的缓存标识符，从而允许来自其他用户的角色特定片段的请求在缓存中解析用户具有相同的角色，因为这些用户也将具有相同的cookie。

4. 发明授权

US06643754B1 System and method for dynamically allocating computer memory 有权
标题翻译：动态分配计算机内存的系统和方法
公开(公告)号：US06643754B1
公开(公告)日：2003-11-04
申请号：US09504610
申请日：2000-02-15
申请人： James R. H. Challenger , Arun K. Iyengar
发明人： James R. H. Challenger , Arun K. Iyengar
IPC分类号： G06F1200
CPC分类号： G06F12/023 , G06F3/0611 , G06F3/064 , G06F3/0644 , G06F3/0676 , Y10S707/99953 , Y10S707/99956
摘要： A method for managing computer memory includes maintaining multiple sets of free blocks of memory wherein a free block is added to a set based on its size. In response to a request for a block of a request size, a set of blocks is searched for a free block which is at least as large as the request size but smaller than the request size plus a threshold. If such a block is found, the block is allocated in its entirety. If such a free block is not found, a block at least as large as the request size maybe split and the request satisfied with the resulting split block. Methods for managing a block of contiguous persistent memory or storage and for coalescing adjacent free blocks using header information are also described.
摘要翻译：一种用于管理计算机存储器的方法包括维护多组空闲块存储器，其中根据其大小将空闲块添加到一组。响应于对请求大小的块的请求，搜索一组块，该空闲块至少等于请求大小但小于请求大小加上阈值的空闲块。如果找到这样一个块，则块被全部分配。如果没有找到这样的空闲块，那么至少与请求大小一样大的块可能会被拆分，并且该请求满足所生成的分块。还描述了用于管理连续的持久存储器或存储块并且使用标题信息来合并相邻空闲块的方法。

5. 发明授权

US07870359B2 System and method for persistent and robust storage allocation 有权
标题翻译：持久和稳健的存储分配的系统和方法
公开(公告)号：US07870359B2
公开(公告)日：2011-01-11
申请号：US11874814
申请日：2007-10-18
申请人： James R. H. Challenger , Arun K. Iyengar
发明人： James R. H. Challenger , Arun K. Iyengar
IPC分类号： G06F12/00
CPC分类号： G06F12/023 , G06F3/0611 , G06F3/064 , G06F3/0644 , G06F3/0676 , Y10S707/99953 , Y10S707/99956
摘要： A method for managing computer memory, in accordance with the present invention, includes maintaining multiple sets of free blocks of memory wherein a free block is added to a set based on its size. In response to a request for a block of a request size, a set of blocks is searched for a free block which is at least as large as the request size but smaller than the request size plus a threshold. If such a block is found, the block is allocated in its entirety.
摘要翻译：根据本发明的用于管理计算机存储器的方法包括维护多组可用空闲块存储器，其中基于其大小将空闲块添加到集合。响应于对请求大小的块的请求，搜索一组块，该空闲块至少等于请求大小但小于请求大小加上阈值的空闲块。如果找到这样一个块，则块被全部分配。

6. 发明授权

US07587515B2 Method and system for restrictive caching of user-specific fragments limited to a fragment cache closest to a user 失效
标题翻译：限制用户特定片段的限制性缓存的方法和系统，限于最靠近用户的片段缓存
公开(公告)号：US07587515B2
公开(公告)日：2009-09-08
申请号：US10034770
申请日：2001-12-19
申请人： Rajesh S. Agarwalla , James R. H. Challenger , George P. Copeland , Arun K. Iyengar , Subbarao Meduri
发明人： Rajesh S. Agarwalla , James R. H. Challenger , George P. Copeland , Arun K. Iyengar , Subbarao Meduri
IPC分类号： G06F15/173 , G06F15/16
CPC分类号： H04L29/06 , H04L67/02 , H04L67/1002 , H04L67/2852 , H04L67/306 , H04L67/34 , H04L69/22 , H04L69/329 , H04L2029/06054
摘要： A method, a system, an apparatus, and a computer program product are presented for a fragment caching methodology. Within the request path from a client to a server, a first computing device may attach to a request message a message header that indicates that the first computing device supports fragment processing; a second computing device within the request path processes this request message. When the second computing device receives a response message corresponding to the request message, it can check for a message header directive that indicates that it should cache the response message's fragment only if the response path does not have at least one computing device that supports the processing of fragments; if so, then it forwards the response message without caching its contained fragment.
摘要翻译：提出了一种用于片段缓存方法的方法，系统，装置和计算机程序产品。在从客户端到服务器的请求路径中，第一计算设备可以将请求消息附加到指示第一计算设备支持片段处理的消息头; 请求路径内的第二计算设备处理该请求消息。当第二计算设备接收到与请求消息相对应的响应消息时，它可以检查消息头指令，指示它应该仅在响应路径不具有至少一个支持处理的计算设备的情况下缓存响应消息的片段片段; 如果是这样，那么它转发响应消息而不缓存其包含的片段。

7. 发明授权

US07509393B2 Method and system for caching role-specific fragments 有权
标题翻译：用于缓存角色特定片段的方法和系统
公开(公告)号：US07509393B2
公开(公告)日：2009-03-24
申请号：US10034724
申请日：2001-12-19
申请人： Rajesh S. Agarwalla , James R. H. Challenger , George P. Copeland , Arun K. Iyengar , Mark H. Linehan , Subbarao Meduri
发明人： Rajesh S. Agarwalla , James R. H. Challenger , George P. Copeland , Arun K. Iyengar , Mark H. Linehan , Subbarao Meduri
IPC分类号： G06F15/16
CPC分类号： G06F17/30902 , G06Q10/025 , G06Q30/0601 , H04L67/2842 , H04L67/288 , H04L69/329
摘要： A method, a system, an apparatus, and a computer program product are presented for a fragment caching methodology. After a message is received at a computing device, a fragment in the message body is cached. Cache ID rules from an origin server accompany a fragment to describe a method for forming a unique cache ID for the fragment such that dynamic content can be cached away from an origin server. A cache ID may be based on a URI and/or query parameters and/or cookies that are associated with a fragment. After user authentication, a cookie containing the user's role may be used in subsequent requests for role-specific fragments and in the cache identifier for role-specific fragments, thereby allowing requests from other users for role-specific fragments to be resolved in the cache when the users have the same role because these users would also have the same cookie.
摘要翻译：提出了一种用于片段缓存方法的方法，系统，装置和计算机程序产品。在计算设备接收到消息后，消息体中的片段被缓存。来自原始服务器的缓存ID规则伴随片段来描述用于为片段形成唯一缓存ID的方法，使得动态内容可以从原始服务器缓存。缓存ID可以基于与片段相关联的URI和/或查询参数和/或cookie。在用户身份验证之后，包含用户角色的cookie可能会用于后续对角色特定片段的请求以及特定于角色的片段的缓存标识符，从而允许来自其他用户的角色特定片段的请求在缓存中解析用户具有相同的角色，因为这些用户也将具有相同的cookie。

8. 发明授权

US07308606B2 System and method for persistent and robust storage allocation 有权
标题翻译：持久和稳健的存储分配的系统和方法
公开(公告)号：US07308606B2
公开(公告)日：2007-12-11
申请号：US10969525
申请日：2004-10-20
申请人： James R. H. Challenger , Arun K. Iyengar
发明人： James R. H. Challenger , Arun K. Iyengar
IPC分类号： G06F12/16 , G06F12/02
CPC分类号： G06F12/023 , G06F3/0611 , G06F3/064 , G06F3/0644 , G06F3/0676 , Y10S707/99953 , Y10S707/99956
摘要： A method for managing computer memory, in accordance with the present invention, includes maintaining multiple sets of free blocks of memory wherein a free block is added to a set based on its size. In response to a request for a block of a request size, a set of blocks is searched for a free block which is at least as large as the request size but smaller than the request size plus a threshold. If such a block is found, the block is allocated in its entirety.
摘要翻译：根据本发明的用于管理计算机存储器的方法包括维护多组可用空闲块存储器，其中基于其大小将空闲块添加到集合。响应于对请求大小的块的请求，搜索一组块，该空闲块至少等于请求大小但小于请求大小加上阈值的空闲块。如果找到这样一个块，则块被全部分配。

9. 发明授权

US06851034B2 System and method for persistent and robust storage allocation 失效
标题翻译：持久和稳健的存储分配的系统和方法
公开(公告)号：US06851034B2
公开(公告)日：2005-02-01
申请号：US10261886
申请日：2002-09-30
申请人： James R. H. Challenger , Arun K. Iyengar
发明人： James R. H. Challenger , Arun K. Iyengar
IPC分类号： G06F3/06 , G06F12/00 , G06F12/02
CPC分类号： G06F12/023 , G06F3/0611 , G06F3/064 , G06F3/0644 , G06F3/0676 , Y10S707/99953 , Y10S707/99956
摘要： A method for managing computer memory includes maintaining multiple sets of free blocks of memory wherein a free block is added to a set based on its size. In response to a request for a block of a request size, a set of blocks is searched for a free block which is at least as large as the request size but smaller than the request size plus a threshold. If such a block is found, the block is allocated in its entirety if such a free block is not found, a block at least as large as the request size maybe split and the request satisfied with the resulting split block. Methods for managing a block of contiguous persistent memory or storage and for coalescing adjacent free blocks using header information are also described.
摘要翻译：一种用于管理计算机存储器的方法包括维护多组空闲块存储器，其中根据其大小将空闲块添加到一组。响应于对请求大小的块的请求，搜索一组块，该空闲块至少等于请求大小但小于请求大小加上阈值的空闲块。如果找到这样的块，则如果没有找到这样的空闲块，则该块被全部分配，至少与请求大小一样大的块可能被拆分，并且该请求满足所得到的分割块。还描述了用于管理连续的持久存储器或存储块并且使用标题信息来合并相邻空闲块的方法。

10. 发明授权

US06446183B1 Systems and methods for persistent and robust memory management 失效
标题翻译：持久和稳健的内存管理的系统和方法
公开(公告)号：US06446183B1
公开(公告)日：2002-09-03
申请号：US09504064
申请日：2000-02-15
申请人： James R. H. Challenger , Arun K. Iyengar
发明人： James R. H. Challenger , Arun K. Iyengar
IPC分类号： C06F1200
CPC分类号： G06F12/023 , Y10S707/99953 , Y10S707/99956
摘要： A method for managing persistent storage in a memory storage system including a main memory and at least one disk memory device, in accordance with the invention, includes maintaining headers in persistent storage for a plurality of blocks wherein a header for each block includes a block size and an allocation status of the block and maintaining at least one data structure in main memory for allocating and deallocating persistent storage. A storage block is allocated by identifying the storage block by employing the at least one data structure in the main memory, modifying the at least one data structure in the main memory and assigning an allocation status for the block on disk. A storage block is deallocated by assigning an allocation status on disk for the block and modifying the at least one data structure in main memory.
摘要翻译：根据本发明的用于管理包括主存储器和至少一个盘存储器设备的存储器存储系统中的持久存储器的方法包括：为多个块维护持久存储器中的报头，其中每个块的报头包括块大小以及块的分配状态，并且维护主存储器中的至少一个数据结构，用于分配和释放持久存储。通过使用主存储器中的至少一个数据结构来识别存储块来分配存储块，修改主存储器中的至少一个数据结构并为盘上的块分配状态。通过在块的分配状态分配块并修改主存储器中的至少一个数据结构来释放存储块。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式