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

41. 发明申请

US20050055672A1 Time model 有权
标题翻译：时间模型
公开(公告)号：US20050055672A1
公开(公告)日：2005-03-10
申请号：US10775513
申请日：2004-02-09
申请人： Mark Ramacher , Graham Wood , Juan Loaiza , Tirthankar Lahiri , Karl Dias
发明人： Mark Ramacher , Graham Wood , Juan Loaiza , Tirthankar Lahiri , Karl Dias
IPC分类号： G06F9/44
CPC分类号： G06F17/30008 , Y10S707/99957
摘要： Quantifying the impact of wasteful operations on a database system is provided. One or more operations that are determined to be wasteful are received. The impact of the wasteful operations on performance in a database may then be quantified. The database is monitored to determine when a wasteful operation is being performed. When a wasteful operation is detected, a time value is recorded of the time spent on processing the wasteful operation. The time value is stored and used to quantify an impact of a performance problem in a database. The time value may be stored and associated with other time values that are recorded for the same wasteful operation. Thus, the impact of wasteful operations that are performed and processed in a database may be determined.
摘要翻译：提供了浪费操作对数据库系统的影响。接收到被确定为浪费的一个或多个操作。然后可以量化浪费操作对数据库中的性能的影响。监视数据库以确定何时执行浪费的操作。当检测到浪费的操作时，记录处理浪费操作花费的时间的时间值。时间值被存储并用于量化数据库中性能问题的影响。时间值可以被存储并且与为相同的浪费操作记录的其他时间值相关联。因此，可以确定在数据库中执行和处理的浪费操作的影响。

42. 发明授权

US06820099B1 Instantaneous data updating using snapshot volumes 有权
标题翻译：使用快照卷瞬时数据更新
公开(公告)号：US06820099B1
公开(公告)日：2004-11-16
申请号：US09834823
申请日：2001-04-13
申请人： Robin Huber , Donald R. Humlicek
发明人： Robin Huber , Donald R. Humlicek
IPC分类号： G06F1730
CPC分类号： G06F17/30008 , Y10S707/99932 , Y10S707/99938 , Y10S707/99939 , Y10S707/99944 , Y10S707/99955
摘要： In a computerized data storage system, when data is to be updated in a primary, or “base,” logical volume, a snapshot volume is formed from the base volume. The updates are then made to the snapshot volume, preferably while the base volume is still used to satisfy normal I/O (input/output) access requests. After the updating is complete, the snapshot volume is rolled back into the base volume. During the rollback, any remaining original data in the base volume and the updated data in either the base volume or snapshot volume are available for satisfying the normal I/O access requests. Thus, the updating appears to be instantaneous, since the entire updated data is immediately available upon starting the rollback.
摘要翻译：在计算机化数据存储系统中，当要在主要或“基本”）逻辑卷中更新数据时，从基本卷形成快照卷。然后更新到快照卷，最好在基本卷仍然用于满足正常的I / O（输入/输出）访问请求时。更新完成后，快照卷将回滚到基本卷中。在回滚期间，基本卷中的任何剩余原始数据和基本卷或快照卷中的更新数据都可用于满足正常的I / O访问请求。因此，更新似乎是瞬时的，因为整个更新的数据在启动回滚时立即可用。

43. 发明授权

US06757679B1 System for building electronic queue(s) utilizing self organizing units in parallel to permit concurrent queue add and remove operations 失效
标题翻译：用于并行利用自组织单元构建电子队列的系统允许并发队列添加和删除操作
公开(公告)号：US06757679B1
公开(公告)日：2004-06-29
申请号：US09568711
申请日：2000-05-11
申请人： Rolf Fritz
发明人： Rolf Fritz
IPC分类号： G06F1730
CPC分类号： G06F17/30008 , Y10S707/99938
摘要： An electronic queue management system for implementation on a chip. The queue management system comprises a plurality of primitive queue elements each including a register for a next-pointer and a register for a queue number. The next-pointer values may be selected via a register input and can be fed out via a registered output. Such queue elements are associated with a respective entry in a central array which stores the data belonging to the actual request. The separation of the data array and queue elements facilitates queue management as the data amounts are quite large compared to the small amount of data being required for the pre logic of the queue management system. Multiple add requests and multiple remove requests operations for different queue elements may be concurrently achieved in a single cycle.
摘要翻译：一种用于芯片实现的电子队列管理系统。队列管理系统包括多个原始队列元素，每个元素队列元素包括用于下一个指针的寄存器和队列号的寄存器。可以通过寄存器输入来选择下一个指针值，并可以通过注册输出进行输出。这样的队列元素与存储属于实际请求的数据的中央阵列中的相应条目相关联。数据阵列和队列元素的分离有助于队列管理，因为与队列管理系统的前置逻辑所需的少量数据相比，数据量相当大。可以在单个周期中同时实现对不同队列元素的多个添加请求和多个删除请求操作。

44. 发明申请

US20040107224A1 Concurrent editing of a file by multiple authors 失效
标题翻译：由多位作者同时编辑文件
公开(公告)号：US20040107224A1
公开(公告)日：2004-06-03
申请号：US10307838
申请日：2002-12-02
申请人： International Business Machines Corporation
发明人： Rajendra Kumar Bera
IPC分类号： G06F017/30 , G06F012/00
CPC分类号： G06F17/30008 , G06F21/6227 , G06F2221/2141 , G06F2221/2147
摘要： A method, system and computer program product for enabling the concurrent editing of a document containing a plurality of independent or loosely connected segments by multiple authors is described. Among other things, the invention allows assigning of editing rights for each segment to a defined set of segment authors, making available a special segment that contains metadata shared by all the segments of said documents, and providing email means private to said document, for facilitating communication between the authors of the document.
摘要翻译：描述了一种方法，系统和计算机程序产品，用于实现由多个作者同时编辑包含多个独立或松散连接的段的文档。除此之外，本发明允许将每个段的编辑权限分配给定义的段作者集合，从而提供包含所有文档的所有段共享的元数据的特殊段，并且向所述文档提供私有的电子邮件手段，以便于文件作者之间的沟通。

45. 发明授权

US06728854B2 System and method for providing transaction management for a data storage space 有权
标题翻译：为数据存储空间提供事务管理的系统和方法
公开(公告)号：US06728854B2
公开(公告)日：2004-04-27
申请号：US09855856
申请日：2001-05-15
申请人： Alexander Frank
发明人： Alexander Frank
IPC分类号： G06F1200
CPC分类号： G06F17/30008
摘要： A system and method for providing transaction management for writing operations on a data storage space, such as a cache, persistently tracks a “transient zone” that covers an active area in which write operations are being performed. The data storage space may be a linear space in which the operations of reclaiming space for writing new objects proceed as a wave. The “head” of the transient zone is set to stay ahead of the front of the wave, while the “tail” of the transient zone is set to stay behind or up to the active block at the rear edge of the active area. As the wave of space reclaiming travels along the data storage space, the head of the transient zone is moved from time to time to maintain a lead. The tail of the transient zone is also moved from time to time as writing operations are completed. When there is a non-graceful shutdown, the data blocks within the transient zone are viewed as corrupted and are discarded, but the data outside the transient zone are stable (not corrupted) and thus still usable for recovery.
摘要翻译：用于提供用于在诸如高速缓存的数据存储空间上的写入操作的事务管理的系统和方法持续地跟踪覆盖正在执行写入操作的有效区域的“暂时区域”。数据存储空间可以是线性空间，其中用于写入新对象的回收空间的操作作为波进行。瞬态区域的“头”被设置为保持在波前的前方，而瞬态区的“尾”被设置为保持在有效区域的后边缘处的活动块的后面或最后。随着空间回收的浪潮沿着数据存储空间传播，瞬时区域的头部被不时地移动以保持领先。当写入操作完成时，瞬态区的尾部也不时移动。当非正常关机时，瞬态区域内的数据块被视为已损坏并被丢弃，但瞬态区域之外的数据是稳定的（未损坏），因此仍可用于恢复。

46. 发明授权

US06633862B2 System and method for database cache synchronization across multiple interpreted code engines 有权
标题翻译：跨多个解释性代码引擎的数据库缓存同步的系统和方法
公开(公告)号：US06633862B2
公开(公告)日：2003-10-14
申请号：US09751052
申请日：2000-12-29
申请人： Blake A. Thompson
发明人： Blake A. Thompson
IPC分类号： G06F1730
CPC分类号： G06F17/30008 , Y10S707/99931
摘要： A method for synchronizing data sharing across multiple interpreted code engines is described. The method includes comparing a database timestamp with a first cache timestamp responsive to an attempt to access the first cache. Then, the method disallows access to the first cache if the database timestamp is not equal to the first cache timestamp. Finally, the method reloads the first cache with data from the database; and sets the first cache timestamp to equal the database timestamp.
摘要翻译：描述了用于在多个解释的代码引擎之间同步数据共享的方法。该方法包括响应于尝试访问第一高速缓存而将数据库时间戳与第一高速缓存时间戳进行比较。然后，如果数据库时间戳不等于第一个高速缓存时间戳，则该方法不允许访问第一个缓存。最后，该方法使用数据库中的数据重新加载第一个缓存; 并将第一个缓存时间戳设置为等于数据库时间戳。

47. 发明授权

US06115721A System and method for database save and restore using self-pointers 失效
标题翻译：使用自我指针进行数据库保存和恢复的系统和方法
公开(公告)号：US06115721A
公开(公告)日：2000-09-05
申请号：US103080
申请日：1998-06-23
申请人： Michael E. Nagy
发明人： Michael E. Nagy
IPC分类号： G06F17/00
CPC分类号： G06F17/30008 , Y10S707/99942 , Y10S707/99952 , Y10S707/99953
摘要： A system and method for saving and restoring RAM-resident databases. Each structure within a database image written to storage includes a self-relative pointer to its actual location in RAM upon being written to disk and may include one or more memory-to-memory pointers to other structures within the database. Upon the database disk image being reloaded to RAM from storage, the self-relative pointers are used to reconstruct the memory-to-memory pointers.
摘要翻译：一种用于保存和恢复RAM驻留数据库的系统和方法。写入存储器的数据库图像中的每个结构在被写入到磁盘中时包括一个与RAM中的实际位置的自相关指针，并且可以包括一个或多个存储器到存储器指向数据库内的其他结构的指针。当数据库磁盘映像从存储器重新加载到RAM时，自相关指针用于重建存储器到存储器指针。

48. 发明授权

US5940839A Fault-tolerant system and method of managing transaction failures in hierarchies 失效
标题翻译：容错系统和层次结构中管理事务失败的方法
公开(公告)号：US5940839A
公开(公告)日：1999-08-17
申请号：US835089
申请日：1997-04-04
申请人： Qiming Chen , Umeshwar Dayal
发明人： Qiming Chen , Umeshwar Dayal
IPC分类号： G06F17/30
CPC分类号： G06F17/30008 , Y10S707/99953
摘要： A fault-tolerant technique for managing cross-hierarchy failure of a process of transactions is disclosed. The process has blocks of transactions and one or more of the transactions may be subtransaction of others. The technique includes enabling a block having one or more transactions in the process to notice, e.g., the failure in a transaction not in the process, wherein the noticed failure will cause a failure of a transaction (FFT) in the process. The technique also includes, upon the failure of the transaction FFT in the process, determining an in-progress closest recoverable ancestor (ICRA) in a block in the process. The ICRA is the nearest transaction to the failed transaction FFT, in the block on an ancestor tree of the FFT, that is in-block-recoverable and in-progress. The technique further includes recovering from the first process failed transaction by undoing from the ICRA to that failed transaction. The undoing step includes aborting or compensating one or more transactions, or both. In the case that the closest recoverable ancestor (CRA), i.e., the nearest transaction to the FFT is not in-progress, the closest in-progress ancestor (CIP) of the CRA and the closest recoverable in-progress ancestor (ERA) of the CIP are identified. The CIP is the nearest transaction to the CRA, on the ancestor tree of the FFT, that is neither committed nor aborted as viewed from outside the first process. The ERA is the nearest in-block recoverable transaction to the CIP on the ancestor tree of the FFT and in progress in a block containing the CIP.
摘要翻译：公开了用于管理交易过程的跨层次故障的容错技术。该过程具有交易块，并且一个或多个交易可以是其他交易。该技术包括启用具有该过程中的一个或多个事务的块以注意，例如，不在该过程中的事务中的故障，其中，注意到的故障将导致该过程中的事务（FFT）失败。该技术还包括在该过程中的事务FFT失败的情况下，确定该过程中的块中的正在进行中最接近可恢复的祖先（ICRA）。 ICRA是在FFT的祖先树上的块中失败事务FFT的最近事务，即块内可恢复和正在进行中。该技术还包括通过从ICRA撤销到该失败的事务来从第一进程失败的事务中恢复。撤销步骤包括中止或补偿一个或多个事务，或两者兼而有之。在最接近的可恢复祖先（即最接近FFT的事务）不在进行中的情况下，CRA的最接近的进行中祖先（CIP）和最接近可恢复的祖先（ERA）的最接近的可进行祖先（ERA）确定了CIP。 CIP是在FFT的祖先树上的CRA最近的事务，既不是从第一个进程外部查看也不会提交也不会中止。 ERA是在FFT的祖先树上的CIP最近的块内可恢复事务，并且在包含CIP的块中正在进行。

49. 发明授权

US09778990B2 Methods and systems for concurrently taking snapshots of a plurality of virtual machines 有权
公开(公告)号：US09778990B2
公开(公告)日：2017-10-03
申请号：US14509885
申请日：2014-10-08
申请人： HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
发明人： Eric Forgette , Juhsun Wang , Gaurav Ranganathan , Manu Mehrotra
IPC分类号： G06F17/30 , G06F11/14 , G06F9/455
CPC分类号： G06F11/1446 , G06F9/45533 , G06F9/45558 , G06F11/1438 , G06F11/1484 , G06F17/30008 , G06F17/30082 , G06F17/30088 , G06F17/30215 , G06F17/30336 , G06F17/30893
摘要： Techniques are described herein which minimize the impact of virtual machine snapshots on the performance of virtual machines and hypervisors. In the context of a volume snapshot which may involve (i) taking virtual machine snapshots of all virtual machines associated with the volume, (ii) taking the volume snapshot, and (iii) removing all the virtual machine snapshots, multiple virtual machine snapshots may be created in parallel. In the process of creating virtual machine snapshots, a storage system may determine which snapshots to create in parallel. The storage system may also prioritize snapshots from certain hypervisors in order to avoid the problem of “starvation”, in which busy hypervisors prevent less busy hypervisors from creating snapshots. The techniques described herein, while mainly described in the context of snapshot creation, are readily applied to snapshot removal.

50. 发明申请

US20170277686A1 EFFICIENTLY RESTORING EXECUTION OF A BACKED UP VIRTUAL MACHINE BASED ON COORDINATION WITH VIRTUAL-MACHINE-FILE-RELOCATION OPERATIONS 有权
公开(公告)号：US20170277686A1
公开(公告)日：2017-09-28
申请号：US15619324
申请日：2017-06-09
申请人： Commvault Systems, Inc.
发明人： Henry Wallace DORNEMANN , Rahul S. PAWAR , Paramasivam KUMARASAMY , Satish Chandra KILARU , Ananda VENKATESHA
IPC分类号： G06F17/30 , G06F9/455
CPC分类号： G06F17/30008 , G06F9/45558 , G06F2009/45575
摘要： The disclosed systems and methods enable a virtual machine, including any applications executing thereon, to quickly start executing and servicing users based on pre-staged data blocks supplied from a backup copy in secondary storage. Substantially concurrently with the ongoing execution of the virtual machine, a virtual-machine-file-relocation operation may move data blocks originating in the backup copy to a primary storage destination that becomes the virtual machine's primary data store after the relocation operation completes. An enhanced data agent, operating in conjunction with an enhanced media agent in a storage management system, coordinates restoring of the virtual machine and the launch of the relocation operation. The enhanced media agent may pre-stage certain backed up data blocks which may be needed to launch the virtual machine, based on predictive analysis pertaining to the virtual machine's operational profile. The enhanced media agent may also pre-stage backed up data blocks for the relocation operation, based on the operation's relocation scheme. Servicing read requests to the virtual machine may take priority over ongoing pre-staging of backed up data. Read requests may be tracked so that the media agent may properly maintain the contents of an associated read cache. Some embodiments of the illustrative storage management system may lack, or may simply not require, the relocation operation, and may operate in a “live mount” configuration.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式