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

1. 发明申请

US20130326176A1 MANAGEMENT OF MULTIPLE CAPACITY TYPES IN STORAGE SYSTEMS 有权
标题翻译：存储系统中多种容量类型的管理
公开(公告)号：US20130326176A1
公开(公告)日：2013-12-05
申请号：US13489395
申请日：2012-06-05
申请人： Yariv BACHAR , Johnny DAVID , Asaf LEVY , Elez SHENHAR
发明人： Yariv BACHAR , Johnny DAVID , Asaf LEVY , Elez SHENHAR
IPC分类号： G06F12/16
CPC分类号： G06F12/02 , G06F11/3442 , G06F11/3485
摘要： A management of capacity types with different consumption policies for an object in a computing storage system is performed by updating a reference type bitmap in a segment-fragment table containing segments that reference fragments upon the creation of a segment for an object. A reference is created in an object-segment reference table, between the object and the segment, in compliance with a consumption policy upon the creation of one of the segments for the object. The reference types that reference the segment are removed upon deletion of the segment.
摘要翻译：在计算存储系统中的对象的具有不同消费策略的容量类型的管理通过在包含用于对象的段的创建引用片段的段片段表中更新参考类型位图来执行。在对象段和对象之间的对象段引用表中创建引用，符合消息策略，为对象创建一个段。引用该段的引用类型在删除段时被删除。

2. 发明申请

US20130325806A1 PRESERVING A STATE USING SNAPSHOTS WITH SELECTIVE TUPLE VERSIONING 有权
标题翻译：使用选择性的TUPLE VERSIONING保护状态
公开(公告)号：US20130325806A1
公开(公告)日：2013-12-05
申请号：US13489365
申请日：2012-06-05
申请人： Yariv BACHAR , Aviv KUVENT , Asaf LEVY
发明人： Yariv BACHAR , Aviv KUVENT , Asaf LEVY
IPC分类号： G06F17/30
CPC分类号： G06F17/30174 , G06F17/30088
摘要： Selective tuple versioning is used on a file system providing file system snapshots using selective tuple versioning for maintaining the state of the file system.
摘要翻译：选择性元组版本控制用于使用选择性元组版本控制来提供文件系统快照的文件系统，以维护文件系统的状态。

3. 发明申请

US20130325808A1 PRESERVING PAST STATES OF FILE SYSTEM NODES 有权
标题翻译：保存文件系统编号的过去状态
公开(公告)号：US20130325808A1
公开(公告)日：2013-12-05
申请号：US13489392
申请日：2012-06-05
申请人： Yariv BACHAR , Aviv KUVENT , Asaf LEVY
发明人： Yariv BACHAR , Aviv KUVENT , Asaf LEVY
IPC分类号： G06F17/30
CPC分类号： G06F17/30324 , G06F17/30088 , G06F17/3023 , G06F17/30339 , G06F17/30952
摘要： A selective tuple versioning is used on a files system for preserving past states of file system nodes by adding a bitmap to a row for a node within a file system table for preserving the past state of the node in a file system.
摘要翻译：在文件系统中使用选择性元组版本控制来通过向文件系统表中的节点添加位图来保留文件系统节点的过去状态，以保持文件系统中节点的过去状态。

4. 发明申请

US20130325803A1 USER INITIATED REPLICATION IN A SYNCHRONIZED OBJECT REPLICATION SYSTEM 有权
标题翻译：用户在同步对象复制系统中进行重启
公开(公告)号：US20130325803A1
公开(公告)日：2013-12-05
申请号：US13489383
申请日：2012-06-05
申请人： Shay AKIRAV , Yariv BACHAR , Ron EDELSTEIN , Asaf LEVY , Oded SONIN
发明人： Shay AKIRAV , Yariv BACHAR , Ron EDELSTEIN , Asaf LEVY , Oded SONIN
IPC分类号： G06F17/30
CPC分类号： G06F17/30581 , G06F11/1451 , G06F11/1464 , G06F17/30327 , G06F17/30575 , G06F17/30578
摘要： A snapshot of selected objects in a source repository is created in response to the user-initiated replication. The snapshot is designated as a snapshot replication job. The snapshot replication job is added to the end of a replication queue to await execution for the synchronized object replication. Unsynchronized objects in a target destination are detected by comparing a state of the selected objects in the snapshot with a current state of the target destination at the time of execution of the snapshot replication job. The unsynchronized objects in the target destination are synchronized based upon the comparison of the state of the selected objects in the snapshot with the current state of the target destination at the time of execution of the snapshot replication job.
摘要翻译：响应于用户启动的复制，创建源存储库中所选对象的快照。快照被指定为快照复制作业。快照复制作业将添加到复制队列的末尾以等待执行同步的对象复制。通过在快照复制作业执行时比较快照中所选对象的状态与目标目标的当前状态来检测目标目标中的未同步对象。基于在快照复制作业执行时将快照中所选择的对象的状态与目标目标的当前状态进行比较，目标目标中的不同步对象被同步。

5. 发明申请

US20130325902A1 PERSISTENT ITERATION OVER A DATABASE TREE STRUCTURE 失效
标题翻译：数据库树结构中的一致性迭代
公开(公告)号：US20130325902A1
公开(公告)日：2013-12-05
申请号：US13489390
申请日：2012-06-05
申请人： Yariv BACHAR , Aviv KUVENT , Asaf LEVY
发明人： Yariv BACHAR , Aviv KUVENT , Asaf LEVY
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30961
摘要： Persistent iteration is performed in stages on nodes arranged according to a node identification (ID) that is increasing in order under a parent node in database tree structure. While performing the persistent iteration, storing a start node ID of the node where the persistent iteration commenced, a current node ID of the node that is undergoing the persistent iteration, a parent node ID of the node that is undergoing the persistent iteration, and a numerical value representing the current level and all levels greater than the current level of nodes that are undergoing the persistent iteration. Upon completion of the persistent iteration on the nodes that are the children of the node with the parent node ID, returning to the first node among the children of the node with the parent node ID, as ordered by increasing node ID, and performing the persistent iteration for children nodes of each node.
摘要翻译：在根据在数据库树结构中的父节点处按顺序增加的节点标识（ID）排列的节点上分阶段执行持续迭代。在执行持续迭代时，存储持续迭代开始的节点的起始节点ID，正在经历持续迭代的节点的当前节点ID，正在经历持续迭代的节点的父节点ID，以及表示当前级别的数值，并且所有级别大于正在进行持续迭代的当前节点级别。在作为具有父节点ID的节点的子节点的节点上完成持续迭代时，返回到具有父节点ID的节点的子节点中的第一节点，按照增加节点ID的顺序，并执行持久性每个节点的子节点的迭代。

6. 发明申请

US20130325804A1 REPLICA IDENTIFICATION AND COLLISION AVOIDANCE IN FILE SYSTEM REPLICATION 有权
标题翻译：文件系统复制中的REPLICA识别和冲突避免
公开(公告)号：US20130325804A1
公开(公告)日：2013-12-05
申请号：US13489386
申请日：2012-06-05
申请人： Yariv BACHAR , Aviv CARO , Asaf LEVY , Oded SONIN
发明人： Yariv BACHAR , Aviv CARO , Asaf LEVY , Oded SONIN
IPC分类号： G06F17/30
CPC分类号： G06F17/30218 , G06F17/30117 , G06F17/3012 , G06F17/30215
摘要： A unique file-system node identification (ID) is created for each newly created node in a file system repository by combining a grid identification (ID), a repository identification (ID), and a node identification (ID) to form the unique file-system node ID. The unique file-system node ID is associated with a unique association identification (ID) for creating an association for linking the node from a source repository to a target repository when performing a replication operation between a repository and another repository. The different replication instances of the node in the file system repository are distinguished by the unique association ID assigned to each of the replication instances.
摘要翻译：通过组合网格标识（ID），存储库标识（ID）和节点标识（ID）以形成唯一文件，为文件系统存储库中的每个新创建的节点创建唯一的文件系统节点标识（ID）系统节点ID。独特的文件系统节点ID与唯一的关联标识（ID）相关联，用于在执行存储库和另一个存储库之间的复制操作时创建用于将节点从源存储库链接到目标存储库的关联。文件系统存储库中节点的不同复制实例通过分配给每个复制实例的唯一关联ID进行区分。

7. 发明申请

US20110273982A1 DEDUPLICATED DATA PROCESSING CONGESTION CONTROL 有权
标题翻译：重复数据处理控制
公开(公告)号：US20110273982A1
公开(公告)日：2011-11-10
申请号：US12773136
申请日：2010-05-04
申请人： Shay H. AKIRAV , Yariv BACHAR , Asaf LEVY , Ehud MEIRI
发明人： Shay H. AKIRAV , Yariv BACHAR , Asaf LEVY , Ehud MEIRI
IPC分类号： H04L12/56
CPC分类号： H04L47/122 , G06F17/30943 , H04L67/1095 , H04L67/1097
摘要： Various embodiments for deduplicated data processing congestion control in a computing environment are provided. In one such embodiment, a single congestion metric is determined from a sampling of a plurality of combined deduplicated data processing congestion statistics in a number of active deduplicated data processes. The congestion limit is calculated from a comparison of the single congestion metric to a congestion target setpoint, the congestion target setpoint being a virtual dimension setpoint and the congestion limit being a manipulated variable. The number of active deduplicated data processes is compared to the congestion limit. If the number of active deduplicated data processes is less than the congestion limit, a new deduplicated data process is spawned.
摘要翻译：提供了在计算环境中用于重复数据删除的数据处理拥塞控制的各种实施例。在一个这样的实施例中，从多个主动去重复数据处理的多个组合的重复数据删除的数据处理拥塞统计的采样中确定单个拥塞度量。从单个拥塞度量与拥塞目标设定点的比较计算拥塞限制，拥挤目标设定点是虚拟维度设定点，拥挤限制是操纵变量。将活动重复数据消除的数据流程的数量与拥塞限制进行比较。如果活动重复数据删除的数据流程数量小于拥塞限制，则会产生一个新的重复数据删除数据流程。

8. 发明申请

US20120246438A1 CAPACITY MANAGEMENT IN DEDUPLICATION STORAGE SYSTEMS 有权
标题翻译：配套存储系统的能力管理
公开(公告)号：US20120246438A1
公开(公告)日：2012-09-27
申请号：US13488171
申请日：2012-06-04
申请人： Lior ARONOVICH , Shira BEN-DOR , Aviv CARO , Elena DROBCHENKO , Samuel KRIKLER , Ofer LENEMAN , Asaf LEVY , Liran LOYA , Dan MELAMED , Tzafrir Z. TAUB
发明人： Lior ARONOVICH , Shira BEN-DOR , Aviv CARO , Elena DROBCHENKO , Samuel KRIKLER , Ofer LENEMAN , Asaf LEVY , Liran LOYA , Dan MELAMED , Tzafrir Z. TAUB
IPC分类号： G06F12/02
CPC分类号： G06F11/3433 , G06F3/0605 , G06F3/0608 , G06F3/0641 , G06F3/0644 , G06F3/0653 , G06F3/067 , G06F11/1453 , G06F11/3442 , G06F11/3485
摘要： A deduplication storage capacity is estimated as a function of an expected deduplication ratio, the expected deduplication ratio being a combined average of a current deduplication ratio and a configured deduplication ratio, the current deduplication ratio depending on the data currently stored in the deduplication storage, and the configured deduplication ratio being an estimate made at a configuration stage of the deduplication computing storage environment.
摘要翻译：估计重复数据删除存储容量是预期重复数据删除率的函数，预期的重复数据删除率是当前重复数据删除率和配置的重复数据删除率的组合平均值，当前重复数据删除率取决于当前存储在重复数据删除存储中的数据，以及配置的重复数据删除率是在重复数据删除计算存储环境的配置阶段进行的估计。

9. 发明申请

US20120144149A1 CAPACITY MANAGEMENT IN DEDUPLICATION STORAGE SYSTEMS 有权
标题翻译：配套存储系统的能力管理
公开(公告)号：US20120144149A1
公开(公告)日：2012-06-07
申请号：US12958202
申请日：2010-12-01
申请人： Lior ARONOVICH , Shira BEN-DOR , Aviv CARO , Elena DROBCHENKO , Samuel KRIKLER , Ofer LENEMAN , Asaf LEVY , Liran LOYA , Dan MELAMED , Tzafrir Z. TAUB
发明人： Lior ARONOVICH , Shira BEN-DOR , Aviv CARO , Elena DROBCHENKO , Samuel KRIKLER , Ofer LENEMAN , Asaf LEVY , Liran LOYA , Dan MELAMED , Tzafrir Z. TAUB
IPC分类号： G06F12/02
CPC分类号： G06F11/3433 , G06F3/0605 , G06F3/0608 , G06F3/0641 , G06F3/0644 , G06F3/0653 , G06F3/067 , G06F11/1453 , G06F11/3442 , G06F11/3485
摘要： Various embodiments for capacity management in a deduplication computing storage environment by a processor device are provided. A deduplication storage capacity is estimated as a function of an expected deduplication ratio, the expected deduplication ratio being a combined average of a current deduplication ratio and a configured deduplication ratio, the current deduplication ratio depending on the data currently stored in the deduplication storage, and the configured deduplication ratio being an estimate made at a configuration stage of the deduplication computing storage environment.
摘要翻译：提供了由处理器设备在重复数据删除计算存储环境中的容量管理的各种实施例。估计重复数据删除存储容量是预期重复数据删除率的函数，预期的重复数据删除率是当前重复数据删除率和配置的重复数据删除率的组合平均值，当前重复数据删除率取决于当前存储在重复数据删除存储中的数据，以及配置的重复数据删除率是在重复数据删除计算存储环境的配置阶段进行的估计。

10. 发明申请

US20120144135A1 REDUCTION OF COMMUNICATION AND EFFICIENT FAILOVER PROCESSING IN DISTRIBUTED SHARED MEMORY-BASED APPLICATION 有权
公开(公告)号：US20120144135A1
公开(公告)日：2012-06-07
申请号：US12958190
申请日：2010-12-01
申请人： Lior ARONOVICH , Asaf LEVY , Liran LOYA
发明人： Lior ARONOVICH , Asaf LEVY , Liran LOYA
IPC分类号： G06F12/16
CPC分类号： G06F11/2043 , G06F11/2035 , G06F11/2097 , G06F12/08
摘要： Various embodiments for reducing communication between cluster nodes and optimizing failover processing in a distributed shared memory (DSM)-based application by at least one processor device are provided. In one embodiment, for a data structure operable on a DSM, a read-mostly portion is maintained in a single copy sharable between the cluster nodes while an updatable portion is maintained in multiple copies, each of the multiple copies dedicated to a single cluster node.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式