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

1. 发明授权

US09081507B2 Shared storage access management systems and methods 有权
标题翻译：共享存储访问管理系统和方法
公开(公告)号：US09081507B2
公开(公告)日：2015-07-14
申请号：US13420283
申请日：2012-03-14
申请人： Hari Krishna Vemuri , Niranjan Pendharkar
发明人： Hari Krishna Vemuri , Niranjan Pendharkar
IPC分类号： G06F3/00 , G06F3/06
CPC分类号： G06F3/0622 , G06F3/0659 , G06F3/067
摘要： Shared storage access management systems and methods are presented. A method can comprise: performing an endpoint I/O source authority tracking process in which permission of an endpoint I/O source to perform an I/O with at least a portion of an endpoint storage target is tracked at least in part based on a corresponding endpoint I/O source ID value, and performing an I/O operation based upon results of the endpoint I/O source authority tracking process. In one embodiment, the endpoint I/O source ID value is associated with an endpoint I/O source that is a virtual machine. The endpoint I/O source ID value can be unique and can be bound to an endpoint I/O source. In one exemplary implementation, the endpoint I/O source ID value does not depend upon intermediate communication channel characteristics between a corresponding endpoint I/O source and endpoint storage target.
摘要翻译：介绍了共享存储访问管理系统和方法。方法可以包括：执行端点I / O源权限跟踪过程，其中端点I / O源的许可与至少一部分端点存储目标执行I / O被至少部分地基于相应的端点I / O源ID值，以及基于端点I / O源权限跟踪过程的结果执行I / O操作。在一个实施例中，端点I / O源ID值与作为虚拟机的端点I / O源相关联。端点I / O源ID值可以是唯一的，并且可以绑定到端点I / O源。在一个示例性实现中，端点I / O源ID值不依赖于对应的端点I / O源和端点存储目标之间的中间通信信道特性。

2. 发明申请

US20130246666A1 SHARED STORAGE ACCESS MANAGEMENT SYSTEMS AND METHODS 有权
标题翻译：共享存储访问管理系统和方法
公开(公告)号：US20130246666A1
公开(公告)日：2013-09-19
申请号：US13420283
申请日：2012-03-14
申请人： Hari Krishna Vemuri , Niranjan Pendharkar
发明人： Hari Krishna Vemuri , Niranjan Pendharkar
IPC分类号： G06F3/00
CPC分类号： G06F3/0622 , G06F3/0659 , G06F3/067
摘要： Shared storage access management systems and methods are presented. A method can comprise: performing an endpoint I/O source authority tracking process in which permission of an endpoint I/O source to perform an I/O with at least a portion of an endpoint storage target is tracked at least in part based on a corresponding endpoint I/O source ID value, and performing an I/O operation based upon results of the endpoint I/O source authority tracking process. In one embodiment, the endpoint I/O source ID value is associated with an endpoint I/O source that is a virtual machine. The endpoint I/O source ID value can be unique and can be bound to an endpoint I/O source. In one exemplary implementation, the endpoint I/O source ID value does not depend upon intermediate communication channel characteristics between a corresponding endpoint I/O source and endpoint storage target.
摘要翻译：介绍了共享存储访问管理系统和方法。方法可以包括：执行端点I / O源权限跟踪过程，其中端点I / O源的许可被执行至少一部分端点存储目标的I / O被至少部分地基于相应的端点I / O源ID值，以及基于端点I / O源权限跟踪过程的结果执行I / O操作。在一个实施例中，端点I / O源ID值与作为虚拟机的端点I / O源相关联。端点I / O源ID值可以是唯一的，并且可以绑定到端点I / O源。在一个示例性实现中，端点I / O源ID值不依赖于对应的端点I / O源和端点存储目标之间的中间通信信道特性。

3. 发明授权

US08688643B1 Systems and methods for adaptively preferring mirrors for read operations 有权
标题翻译：用于自适应偏好镜像以进行读取操作的系统和方法
公开(公告)号：US08688643B1
公开(公告)日：2014-04-01
申请号：US12857048
申请日：2010-08-16
申请人： Anandi Deopujari , Niranjan Pendharkar , Michael Wahl
发明人： Anandi Deopujari , Niranjan Pendharkar , Michael Wahl
IPC分类号： G06F17/00 , G06F11/20
CPC分类号： G06F11/2056 , G06F3/061 , G06F3/0635 , G06F3/0689 , G06F11/2058
摘要： A computer-implemented method for adaptively preferring mirrors for read operations may include identifying a volume of data. The computer-implemented method may also include identifying a plurality of mirrors that mirror the volume of data. The computer-implemented method may further include identifying a storage property of at least one mirror in the plurality of mirrors. The computer-implemented method may additionally include identifying at least one attempt to read from the volume of data. The computer-implemented method may also include selecting the mirror for fulfilling the read attempt based at least in part on the storage property of the mirror. The computer-implemented method may further include fulfilling the read attempt from the selected mirror. Various other methods, systems, and computer-readable media are also disclosed.
摘要翻译：用于自适应地偏好镜像以用于读取操作的计算机实现的方法可以包括识别数据量。计算机实现的方法还可以包括识别反映数据量的多个反射镜。计算机实现的方法还可以包括识别多个反射镜中的至少一个反射镜的存储特性。计算机实现的方法可以另外包括识别从数据量读取的至少一个尝试。计算机实现的方法还可以包括至少部分地基于镜的存储特性来选择用于完成读取尝试的镜子。计算机实现的方法还可以包括从所选择的镜子完成读取尝试。还公开了各种其它方法，系统和计算机可读介质。

4. 发明申请

US20130346724A1 SEQUENTIAL BLOCK ALLOCATION IN A MEMORY 有权
标题翻译：存储器中的顺序块分配
公开(公告)号：US20130346724A1
公开(公告)日：2013-12-26
申请号：US13528676
申请日：2012-06-20
申请人： Dilip Madhusudan Ranade , Niranjan Pendharkar , Anindya Banerjee
发明人： Dilip Madhusudan Ranade , Niranjan Pendharkar , Anindya Banerjee
IPC分类号： G06F12/06
CPC分类号： G06F12/0223 , G06F12/06 , G06F12/08
摘要： A region of memory is logically divided into a number of segments, each of which is logically divided into a number of blocks. Blocks are allocated sequentially. A head pointer and a tail pointer demarcate the section of allocated blocks. As allocated blocks are added, the tail pointer is moved so that it remains at the end of the section of allocated blocks. If the tail pointer is within a threshold distance of the head pointer, then the head pointer is moved from its current position to a new position, and the allocated blocks between the current and new positions are freed (deallocated and/or erased). Thus, writes to the memory can be performed sequentially, and blocks can be freed in advance of when they are actually needed.
摘要翻译：存储器区域在逻辑上被划分成多个段，每个段在逻辑上被划分成多个块。块按顺序分配。头指针和尾指针划分分配块的部分。当分配的块被添加时，尾部指针被移动，使得它保持在分配块的部分的末尾。如果尾指针在头指针的阈值距离内，则头指针从其当前位置移动到新位置，并且释放（释放和/或擦除）当前位置和新位置之间的分配块。因此，可以顺序地执行对存储器的写入，并且块可以在实际需要时被释放。

5. 发明授权

US08825602B1 Systems and methods for providing data protection in object-based storage environments 有权
标题翻译：在基于对象的存储环境中提供数据保护的系统和方法
公开(公告)号：US08825602B1
公开(公告)日：2014-09-02
申请号：US12724198
申请日：2010-03-15
申请人： Samir Desai , Niranjan Pendharkar , Ganesh Varadarajan
发明人： Samir Desai , Niranjan Pendharkar , Ganesh Varadarajan
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30174 , G06F17/30088
摘要： A method for providing data protection in object-based storage environments may include: 1) taking a first snapshot, at a first time, of a set of partitions that store data of a file system on a set of object storage devices; 2) using the first snapshot to sync the data of the file system with a data protection node; 3) taking a second snapshot, at a second time, of the set of partitions; 4) using information from the set of object storage devices to identify at least one object that changed between the first and second times; 5) using object identification information to deduce file identification information that identifies a file that comprises the changed object; and 6) sending the changed object and the file identification information to the data protection node. Various other methods, systems, and computer-readable media are also disclosed.
摘要翻译：一种用于在基于对象的存储环境中提供数据保护的方法可以包括：1）在第一时间获取在一组对象存储设备上存储文件系统的数据的一组分区的第一快照; 2）使用第一快照将文件系统的数据与数据保护节点同步; 3）第二次拍摄该组分区的第二个快照; 4）使用来自该对象存储设备的信息来识别在第一和第二次之间改变的至少一个对象; 5）使用对象识别信息来推断识别包含被改变对象的文件的文件识别信息; 以及6）将改变的对象和文件识别信息发送到数据保护节点。还公开了各种其它方法，系统和计算机可读介质。

6. 发明授权

US08700670B2 Insert optimization for B+ tree data structure scalability 有权
标题翻译：插入优化B +树数据结构的可扩展性
公开(公告)号：US08700670B2
公开(公告)日：2014-04-15
申请号：US12758483
申请日：2010-04-12
申请人： Shilesh Marathe , Rajesh Chepuri , Niranjan Pendharkar
发明人： Shilesh Marathe , Rajesh Chepuri , Niranjan Pendharkar
IPC分类号： G06F17/30
CPC分类号： G06F17/30958
摘要： A method, in one embodiment, can include receiving a key and associated data via a computing device. Furthermore, the method can include searching a B+ tree data structure using the key to find a leaf node. The B+ tree data structure is stored by a persistent storage coupled to the computing device. The B+ tree data structure can include a first plurality of nodes that each contains a key-value entry that is not maintained in a sorted order based on its key. In addition, the key and associated data are appended to the leaf node. A sector that includes the leaf node and the key and associated data can be flushed to the persistent storage.
摘要翻译：在一个实施例中，一种方法可以包括经由计算设备接收密钥和相关联的数据。此外，该方法可以包括使用密钥搜索B +树数据结构以找到叶节点。 B +树数据结构由耦合到计算设备的持久存储器存储。 B +树数据结构可以包括第一多个节点，每个节点包含基于其密钥不按排序顺序维护的键值条目。此外，密钥和关联数据附加到叶节点。包括叶节点，密钥和关联数据的扇区可以刷新到持久存储器。

7. 发明授权

US08407301B1 Systems and methods for creating incremental images of cluster volumes 有权
标题翻译：用于创建集群卷增量映像的系统和方法
公开(公告)号：US08407301B1
公开(公告)日：2013-03-26
申请号：US12717071
申请日：2010-03-03
申请人： Niranjan Pendharkar
发明人： Niranjan Pendharkar
IPC分类号： G06F15/16
CPC分类号： G06F11/1466 , G06F11/1451 , G06F11/1456 , G06F11/2056
摘要： A computer-implemented method for creating incremental images of cluster volumes. The method may include 1) maintaining a parallel cluster comprising a plurality of cluster nodes connected to a cluster volume; 2) creating a first incremental image of the cluster volume by capturing changes to the cluster volume on a first mirror during a first period of time; 3) for each cluster node in the parallel cluster, blocking write completions for writes to the cluster volume; 4) while the write completions are blocked, switching to a second mirror to create a second incremental image of the cluster volume by capturing changes to the cluster volume on the second mirror during a second period of time; and 5) after switching to the second mirror, unblocking the write completions for writes to the cluster volume. Various other methods, systems, and computer-readable media are also disclosed.
摘要翻译：用于创建集群卷增量映像的计算机实现方法。该方法可以包括：1）维护包括连接到集群卷的多个集群节点的并行集群; 2）通过在第一时间段内捕获在第一镜上的群集卷的改变来创建群集卷的第一增量映像; 3）对于并行集群中的每个集群节点，阻塞对集群卷的写入完成; 4）当写入完成被阻止时，切换到第二个镜像以通过在第二个时间段内捕获对第二个镜像上的群集卷的更改来创建群集卷的第二个增量映像; 和5）切换到第二个镜像后，解除写入完成以写入群集卷。还公开了各种其它方法，系统和计算机可读介质。

8. 发明申请

US20120158659A1 HOST BASED SOFTWARE BLOCK LEVEL REPLICATION USING METADATA INDICATING CHANGED DATA OBJECTS AT SOURCE AND SECONDARY NODES 有权
标题翻译：基于HOST的软件块级复用使用元数据表示更改的数据对象在源和次级节点
公开(公告)号：US20120158659A1
公开(公告)日：2012-06-21
申请号：US12971498
申请日：2010-12-17
申请人： Shailesh Marathe , Ashish Gawali , Niranjan Pendharkar
发明人： Shailesh Marathe , Ashish Gawali , Niranjan Pendharkar
IPC分类号： G06F17/30
CPC分类号： G06F17/30997 , G06F11/1451 , G06F11/1458 , G06F2201/84
摘要： A host-based replication snapshot method. The method includes synchronizing a set of data objects stored at both a replication source node and a secondary node. The method further includes identifying changed data objects out of the set of data objects from the replication source node that have been modified during a time period between a first time and a subsequent second time. Metadata indicating the changed data objects from the replication source node is transmitted to the secondary node. A snapshot is then generated at the second time on the secondary node by using the metadata.
摘要翻译：基于主机的复制快照方法。该方法包括同步存储在复制源节点和辅助节点两者中的一组数据对象。该方法还包括从在第一时间和随后的第二时间之间的时间段内被修改的来自复制源节点的数据对象集合中识别改变的数据对象。指示来自复制源节点的更改的数据对象的元数据被发送到辅助节点。然后通过使用元数据在次要节点上第二次生成快照。

9. 发明申请

US20120036106A1 Data Replication Techniques Using Incremental Checkpoints 有权
标题翻译：使用增量检查点的数据复制技术
公开(公告)号：US20120036106A1
公开(公告)日：2012-02-09
申请号：US12853234
申请日：2010-08-09
申请人： Samir Desai , Niranjan Pendharkar
发明人： Samir Desai , Niranjan Pendharkar
IPC分类号： G06F12/16 , G06F17/30
CPC分类号： G06F11/2097 , G06F11/1451 , G06F11/2094 , G06F17/30212 , G06F17/30575 , G06F2201/84
摘要： Incremental checkpoint, for use in data replication, track the changes made to a file system after a point in time at which the incremental checkpoint is created. Data replication techniques using the incremental checkpoints may include taking a regular checkpoint of the file system and creating the first time full copy on remote node using the regular checkpoint. Changes made to the file system are then tracked in an incremental checkpoint that are stored on the remote node. The processes of taking the incremental checkpoint and storing the incremental checkpoint are iteratively performed. The first time fully copy and the incremental checkpoints may then be used for data replication, backup, continuous data protection (CDP), or the like.
摘要翻译：增量检查点，用于数据复制，跟踪在创建增量检查点的时间点后对文件系统所做的更改。使用增量检查点的数据复制技术可能包括使用文件系统的常规检查点，并使用常规检查点在远程节点上创建第一次完整副本。然后在存储在远程节点上的增量检查点中跟踪对文件系统所做的更改。迭代地执行采用增量检查点和存储增量检查点的过程。第一次完全复制，然后增量检查点可用于数据复制，备份，连续数据保护（CDP）等。

10. 发明授权

US07657578B1 System and method for volume replication in a storage environment employing distributed block virtualization 有权
标题翻译：在采用分布式块虚拟化的存储环境中进行卷复制的系统和方法
公开(公告)号：US07657578B1
公开(公告)日：2010-02-02
申请号：US11017356
申请日：2004-12-20
申请人： Ronald S. Karr , Niranjan Pendharkar , Anand A. Kekre , Angshuman Bezbaruah , Vikas Kailash Gupta , Ashish Agarwal , Raghu Krishnamurthy , Michael Root , Kati Rader , Kedar Karmarkar
发明人： Ronald S. Karr , Niranjan Pendharkar , Anand A. Kekre , Angshuman Bezbaruah , Vikas Kailash Gupta , Ashish Agarwal , Raghu Krishnamurthy , Michael Root , Kati Rader , Kedar Karmarkar
IPC分类号： G06F17/30
CPC分类号： G06F11/2082 , G06F11/2069
摘要： A system for volume replication in a distributed block virtualization environment includes a first and a second set of one or more physical block devices, a first and a second volume server, one or more volume clients, and a replication manager. The first volume server may be configured to aggregate storage in the first set of one or more physical block devices into one or more logical volumes, and to make the one or more logical volumes accessible to the one or more volume clients. The replication manager may be configured to operate in cooperation with the first and second volume servers and the one or more volume clients to maintain a replica of at least a subset of the one or more logical volumes at the second set of one or more physical block devices.
摘要翻译：在分布式块虚拟化环境中用于卷复制的系统包括第一和第二组一个或多个物理块设备，第一和第二卷服务器，一个或多个卷客户端和复制管理器。第一卷服务器可以被配置为将第一组一个或多个物理块设备中的存储聚合成一个或多个逻辑卷，并使一个或多个逻辑卷可供一个或多个卷客户端访问。复制管理器可以被配置为与第一和第二卷服务器和一个或多个卷客户端协作地操作以在一个或多个物理块的第二集合处维护一个或多个逻辑卷的至少一个子集的副本设备。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式