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

1. 发明授权

US07783852B2 Techniques for automated allocation of memory among a plurality of pools 有权
标题翻译：在多个池中自动分配存储器的技术
公开(公告)号：US07783852B2
公开(公告)日：2010-08-24
申请号：US10746471
申请日：2003-12-23
申请人： Tirthankar Lahiri , Poojan Kumar , Brian Hirano , Arvind Nithrakashyap , Kant Patel , Kiran Goyal , Juan R. Loaiza
发明人： Tirthankar Lahiri , Poojan Kumar , Brian Hirano , Arvind Nithrakashyap , Kant Patel , Kiran Goyal , Juan R. Loaiza
IPC分类号： G06F12/00
CPC分类号： G06F9/5016 , G06F12/023
摘要： Allocation of memory is optimized across multiple pools of memory, based on minimizing the time it takes to successfully retrieve a given data item from each of the multiple pools. First data is generated that indicates a hit rate per pool size for each of multiple memory pools. In an embodiment, the generating step includes continuously monitoring attempts to access, or retrieve a data item from, each of the memory pools. The first data is converted to second data that accounts for a cost of a miss with respect to each of the memory pools. In an embodiment, the second data accounts for the cost of a miss in terms of time. How much of the memory to allocate to each of the memory pools is determined, based on the second data. In an embodiment, the steps of converting and determining are automatically performed, on a periodic basis.
摘要翻译：基于最小化从多个池中的每一个成功检索给定数据项所需的时间，内存分配在多个内存池之间进行了优化。生成第一个数据，指示每个多个内存池的每个池大小的命中率。在一个实施例中，生成步骤包括连续地监视从每个存储器池访问或检索数据项的尝试。第一个数据被转换成相对于每个存储器池来计算缺失成本的第二数据。在一个实施例中，第二数据考虑到时间方面的错过的成本。基于第二数据确定分配给每个存储器池的存储器的多少。在一个实施例中，周期性地自动执行转换和确定的步骤。

2. 发明申请

US20050114621A1 Techniques for automated allocation of memory among a plurality of pools 有权
标题翻译：在多个池中自动分配存储器的技术
公开(公告)号：US20050114621A1
公开(公告)日：2005-05-26
申请号：US10746471
申请日：2003-12-23
申请人： Tirthankar Lahiri , Poojan Kumar , Brian Hirano , Arvind Nithrakashyap , Kant Patel , Kiran Goyal , Juan Loaiza
发明人： Tirthankar Lahiri , Poojan Kumar , Brian Hirano , Arvind Nithrakashyap , Kant Patel , Kiran Goyal , Juan Loaiza
IPC分类号： G06F9/50 , G06F12/02 , G06F12/00
CPC分类号： G06F9/5016 , G06F12/023
摘要： Allocation of memory is optimized across multiple pools of memory, based on minimizing the time it takes to successfully retrieve a given data item from each of the multiple pools. First data is generated that indicates a hit rate per pool size for each of multiple memory pools. In an embodiment, the generating step includes continuously monitoring attempts to access, or retrieve a data item from, each of the memory pools. The first data is converted to second data that accounts for a cost of a miss with respect to each of the memory pools. In an embodiment, the second data accounts for the cost of a miss in terms of time. How much of the memory to allocate to each of the memory pools is determined, based on the second data. In an embodiment, the steps of converting and determining are automatically performed, on a periodic basis.
摘要翻译：基于最小化从多个池中的每一个成功检索给定数据项所需的时间，内存分配在多个内存池之间进行了优化。生成第一个数据，指示每个多个内存池的每个池大小的命中率。在一个实施例中，生成步骤包括连续地监视从每个存储器池访问或检索数据项的尝试。第一个数据被转换成相对于每个存储器池来计算缺失成本的第二数据。在一个实施例中，第二数据考虑到时间方面的错过的成本。基于第二数据确定分配给每个存储器池的存储器的多少。在一个实施例中，周期性地自动执行转换和确定的步骤。

3. 发明授权

US06952664B1 System and method for predicting cache performance 有权
标题翻译：用于预测缓存性能的系统和方法
公开(公告)号：US06952664B1
公开(公告)日：2005-10-04
申请号：US09834342
申请日：2001-04-13
申请人： Tirthankar Lahiri , Juan R. Loaiza , Arvind Nithrakashyap , William H. Bridge
发明人： Tirthankar Lahiri , Juan R. Loaiza , Arvind Nithrakashyap , William H. Bridge
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.
摘要翻译：用于模拟一个或多个高速缓存的性能（例如，错过率）的系统和方法。缓存模拟器包括分段缓冲器列表，其中每个缓冲器被配置为存储数据标识符和缓冲器段的标识符。可以从操作缓存复制的数据引用被应用于列表以进行模拟。每个缓存的未命中率的初始估计包括丢失列表的所有段的引用数量加上不是高速缓存的一部分的所有段中的命中。由操作缓存引起的实际未命中率与与操作缓存大小相同的模拟高速缓存的估计未命中的比率产生校正因子。最终预测是通过将初始估计乘以校正因子而产生的。可以基于最终预测来动态地调整操作高速缓存的大小。

4. 发明授权

US07031987B2 Integrating tablespaces with different block sizes 有权
公开(公告)号：US07031987B2
公开(公告)日：2006-04-18
申请号：US09871476
申请日：2001-05-30
申请人： Sreedhar Mukkamalla , Arvind Nithrakashyap , Tirthankar Lahiri , Alok Pareek , Juan R. Loaiza , J. William Lee , Gary C. Ngai
发明人： Sreedhar Mukkamalla , Arvind Nithrakashyap , Tirthankar Lahiri , Alok Pareek , Juan R. Loaiza , J. William Lee , Gary C. Ngai
IPC分类号： G06F7/00
CPC分类号： G06F17/30592 , G06F17/30 , G06F17/30952 , Y10S707/99938 , Y10S707/99942 , Y10S707/99955
摘要： Provided herein is a mechanism that allows a given database system to access data blocks from another database system, where data blocks from the given database system and data blocks from the other database system have different sizes. According to an aspect of the present invention, a tablespace in the other database system contained the data blocks. The tablespace is detached from the other database system and integrated into the given database, which is capable of processing data stored in data blocks of a different sizes.

5. 发明申请

US20060143187A1 Integrating tablespaces with different block sizes 审中-公开
标题翻译：集成具有不同块大小的表空间
公开(公告)号：US20060143187A1
公开(公告)日：2006-06-29
申请号：US11347644
申请日：2006-02-02
申请人： Sreedhar Mukkamalla , Arvind Nithrakashyap , Tirthankar Lahiri , Alok Pareek , Juan Loaiza , J. Lee , Gary Ngai
发明人： Sreedhar Mukkamalla , Arvind Nithrakashyap , Tirthankar Lahiri , Alok Pareek , Juan Loaiza , J. Lee , Gary Ngai
IPC分类号： G06F17/30
CPC分类号： G06F16/283 , G06F16/00 , G06F16/9017 , Y10S707/99938 , Y10S707/99942 , Y10S707/99955
摘要： Provided herein is a mechanism that allows a given database system to access data blocks from another database system, where data blocks from the given database system and data blocks from the other database system have different sizes. According to an aspect of the present invention, a tablespace in the other database system contained the data blocks. The tablespace is detached from the other database system and integrated into the given database, which is capable of processing data stored in data blocks of different sizes.
摘要翻译：这里提供了允许给定数据库系统从另一个数据库系统访问数据块的机制，其中来自给定数据库系统的数据块和来自其他数据库系统的数据块具有不同的大小。根据本发明的一个方面，其他数据库系统中的表空间包含数据块。表空间与其他数据库系统分离，并集成到给定的数据库中，该数据库能够处理存储在不同大小的数据块中的数据。

6. 发明授权

US07039773B2 Method and mechanism for efficient implementation of ordered records 有权
标题翻译：有效执行有序记录的方法和机制
公开(公告)号：US07039773B2
公开(公告)日：2006-05-02
申请号：US10426471
申请日：2003-04-29
申请人： Wei Ming Hu , Juan R. Loaiza , Roger J. Bamford , Vikram Joshi , Arvind Nithrakashyap , Tudor Bosman , Vinay Srihari , Alok Pareek
发明人： Wei Ming Hu , Juan R. Loaiza , Roger J. Bamford , Vikram Joshi , Arvind Nithrakashyap , Tudor Bosman , Vinay Srihari , Alok Pareek
IPC分类号： G06F12/00
CPC分类号： G06F17/30595 , Y10S707/99953
摘要： An improved method, mechanism, and system for implementing, generating, and maintaining records, such as redo records and redo logs in a database system, are disclosed. Multiple sets of records may be created and combined into a partially ordered (or non-ordered) group of records, which are later collectively ordered or sorted as needed to create an fully ordered set of records. With respect to a database system, redo generation bottleneck is minimized by providing multiple in-memory redo buffers that are available to hold redo records generated by multiple threads of execution. When the in-memory redo buffers are written to a persistent storage medium, no specific ordering needs to be specified with respect to the redo records from the different in-memory redo buffers. While the collective group of records may not be ordered, the written-out redo records may be partially ordered based upon the ordered redo records from within individual in-memory redo buffers. At recovery, ordering and/or merging of redo records may occur to satisfy database consistency requirements.
摘要翻译：公开了一种用于在数据库系统中实现，生成和维护记录（如重做记录和重做日志）的改进方法，机制和系统。可以创建多组记录，并将其组合成部分有序（或非有序）的记录组，这些记录集合随后根据需要进行统一排序或排序以创建完全有序的记录集。对于数据库系统，通过提供多个可用于保存由多个执行线程生成的重做记录的内存中重做缓冲区，可以使重做生成瓶颈最小化。当内存中重做缓冲区被写入持久存储介质时，不需要针对来自不同内存中重做缓冲区的重做记录指定特定顺序。虽然可能不会对集体记录进行排序，但是写出的重做记录可能会根据内部存储器重做缓冲区内的重做记录进行部分排序。在恢复时，可能会发生重做记录的排序和/或合并，以满足数据库一致性要求。

7. 发明申请

US20080177741A1 Maintaining item-to-node mapping information in a distributed system 有权
标题翻译：在分布式系统中维护项目到节点映射信息
公开(公告)号：US20080177741A1
公开(公告)日：2008-07-24
申请号：US11657778
申请日：2007-01-24
申请人： Vikram Joshi , Alexander Tsukerman , Arvind Nithrakashyap , Jia Shi , Tudor Bosman
发明人： Vikram Joshi , Alexander Tsukerman , Arvind Nithrakashyap , Jia Shi , Tudor Bosman
IPC分类号： G06F17/30
CPC分类号： G06F17/30557
摘要： A method and apparatus for maintaining an item-to-node mapping among nodes in a distributed cluster is provided. Each node maintains locally-stored system-state information indicating that node's understanding of which master nodes are alive and dead. Instead of employing a global item-to-node mapping, each node acts upon a locally determined mapping based on its locally-stored system-state information. For any two nodes with the same locally-stored system-state information, the locally determined mapping is the same. A node updates its locally-stored system-state information upon detecting a node failure or receiving a message from another node indicating different locally-stored system-state information. The new locally-stored system-state information is transmitted on a need-to-know basis, and consequently nodes with different item-to-node mappings may operate concurrently. Mechanisms to avoid nodes assuming conflicting ownership of items are employed, thus allowing node failures to propagate via asynchronous messaging instead of requiring a cluster-wide synchronization event.
摘要翻译：提供了一种用于在分布式集群中的节点之间维护项目到节点映射的方法和装置。每个节点维护本地存储的系统状态信息，指示节点了解哪些主节点存活和死亡。代替采用全局项目到节点映射，每个节点基于其本地存储的系统状态信息在本地确定的映射上作用。对于具有相同本地存储的系统状态信息的任何两个节点，本地确定的映射是相同的。当节点检测到节点故障或从另一节点接收到指示不同的本地存储的系统状态信息的消息时，节点更新其本地存储的系统状态信息。新的本地存储的系统状态信息是在需要知道的基础上传输的，因此具有不同项目到节点映射的节点可以同时运行。采用避免节点假设项目所有权冲突的机制，从而允许节点故障通过异步消息传播，而不需要群集范围的同步事件。

8. 发明授权

US06976022B2 Method and mechanism for batch processing transaction logging records 有权
标题翻译：批处理事务日志记录的方法和机制
公开(公告)号：US06976022B2
公开(公告)日：2005-12-13
申请号：US10245118
申请日：2002-09-16
申请人： Srinivas Vemuri , Amit Ganesh , Arvind Nithrakashyap , Roger Bamford , Jonathan Klein , Vikram Joshi
发明人： Srinivas Vemuri , Amit Ganesh , Arvind Nithrakashyap , Roger Bamford , Jonathan Klein , Vikram Joshi
IPC分类号： G06F17/30
CPC分类号： G06F17/30368 , G06F17/30371 , Y10S707/99938
摘要： A method and mechanism is disclosed for implementing transaction logging in a database system. In-memory undo records are maintained to log undo information for the database system. Redo records are batch processed, with multiple redo records for a transaction stored on disk at commit time.
摘要翻译：公开了一种在数据库系统中实现事务日志记录的方法和机制。维护内存中的撤销记录以记录数据库系统的撤消信息。重做记录是批量处理的，在提交时存储在磁盘上的事务具有多个重做记录。

9. 发明授权

US07359890B1 System load based adaptive prefetch 有权
标题翻译：基于系统负载的自适应预取
公开(公告)号：US07359890B1
公开(公告)日：2008-04-15
申请号：US10142257
申请日：2002-05-08
申请人： Chi Ku , Arvind Nithrakashyap , Ari W. Mozes
发明人： Chi Ku , Arvind Nithrakashyap , Ari W. Mozes
IPC分类号： G06F17/30
CPC分类号： G06F17/3048 , Y10S707/99932
摘要： A number, of the blocks of data to be prefetched into a buffer cache, is determined dynamically at run time (e.g. during execution of a query), based at least in part on the load placed on the buffer cache. An application program (such as a database) is responsive to the number (also called “prefetch size”), to determine the amount of prefetching. A sequence of instructions (also called “prefetch size daemon”) computes the prefetch size based on, for example, the number of prefetched blocks aged out before use. The prefetch size daemon dynamically revises the prefetch size based on usage of the buffer cache, thereby to form a feedback loop. Depending on the embodiment, at times of excessive use of the buffer cache, prefetching may even be turned off. Although in one embodiment described herein the prefetch size daemon is implemented in a database, in other embodiments other kinds of applications and/or the operating system itself can use a prefetch size daemon of the type described herein to dynamically determine and change prefetch behavior.
摘要翻译：至少部分地基于放置在缓冲器高速缓存上的负载，在运行时（例如在执行查询期间）动态地确定要预取到缓冲器高速缓存中的数据块的数量。应用程序（例如数据库）响应于数字（也称为“预取大小”）来确定预取量。指令序列（也称为“预取大小守护程序”）基于例如在使用之前老化的预取块的数量来计算预取大小。预取大小守护程序根据缓冲区高速缓存的使用动态地修改预取大小，从而形成一个反馈循环。根据实施例，在过度使用缓冲器高速缓存的时候，预取甚至可能被关闭。尽管在本文描述的一个实施例中，预取大小守护程序在数据库中实现，但在其他实施例中，其他种类的应用和/或操作系统本身可以使用本文所述类型的预取大小守护程序动态地确定并改变预取行为。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式