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

1. 发明申请

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.
摘要翻译：提供了由处理器设备在重复数据删除计算存储环境中的容量管理的各种实施例。估计重复数据删除存储容量是预期重复数据删除率的函数，预期的重复数据删除率是当前重复数据删除率和配置的重复数据删除率的组合平均值，当前重复数据删除率取决于当前存储在重复数据删除存储中的数据，以及配置的重复数据删除率是在重复数据删除计算存储环境的配置阶段进行的估计。

2. 发明申请

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.
摘要翻译：估计重复数据删除存储容量是预期重复数据删除率的函数，预期的重复数据删除率是当前重复数据删除率和配置的重复数据删除率的组合平均值，当前重复数据删除率取决于当前存储在重复数据删除存储中的数据，以及配置的重复数据删除率是在重复数据删除计算存储环境的配置阶段进行的估计。

3. 发明申请

US20120239687A1 FACILITATION OF SEARCH, LIST, AND RETRIEVAL OPERATIONS ON PERSISTENT DATA SET USING DISTRIBUTED SHARED MEMORY 有权
标题翻译：使用分布式共享存储器对搜索，列表和检索数据进行搜索，恢复操作
公开(公告)号：US20120239687A1
公开(公告)日：2012-09-20
申请号：US13488150
申请日：2012-06-04
申请人： Lior ARONOVICH , Asaf LEVY , Liran LOYA
发明人： Lior ARONOVICH , Asaf LEVY , Liran LOYA
IPC分类号： G06F17/30
CPC分类号： G06F11/2007 , G06F3/121 , G06F9/3863 , G06F9/526 , G06F11/1435 , G06F11/1471 , G06F11/1658 , G06F11/1666 , G06F11/2023 , G06F11/2043 , G06F11/2094 , G06F12/0813 , G06F17/30076 , G06F17/30312 , G06F2201/82 , G06F2201/825 , G06F2201/84 , G06F2209/523 , H04L67/1097
摘要： In one exemplary embodiment, a DSM is used to store the data structures in a cluster shared memory, such that updates, deletions and insertions are applied to both the persistent data set and the DSM, and search, list and retrieval operations are processed directly from the DSM. A data structure in the persistent data set is stored in two separate DSM pages: a first page includes an identifying search key of the data structure, the search key also pointing to a location of the data structure in the storage. A second page includes the updatable properties of the data structure. A DSM storing the data structures' pages is organized as a two-row matrix.
摘要翻译：在一个示例性实施例中，DSM用于将数据结构存储在群集共享存储器中，使得更新，删除和插入被应用于持久数据集和DSM两者，并且搜索，列表和检索操作直接从帝斯曼持久数据集中的数据结构存储在两个单独的DSM页面中：第一页包括数据结构的识别搜索关键字，搜索关键字还指向存储器中的数据结构的位置。第二页包括数据结构的可更新属性。存储数据结构页面的DSM被组织为两行矩阵。

4. 发明申请

US20120131038A1 FACILITATION OF SEARCH, LIST, AND RETRIEVAL OPERATIONS ON PERSISTENT DATA SET USING DISTRIBUTED SHARED MEMORY 有权
标题翻译：使用分布式共享存储器对搜索，列表和检索数据进行搜索，恢复操作
公开(公告)号：US20120131038A1
公开(公告)日：2012-05-24
申请号：US12950869
申请日：2010-11-19
申请人： Lior ARONOVICH , Asaf LEVY , Liran LOYA
发明人： Lior ARONOVICH , Asaf LEVY , Liran LOYA
IPC分类号： G06F17/30
CPC分类号： G06F11/2007 , G06F3/121 , G06F9/3863 , G06F9/526 , G06F11/1435 , G06F11/1471 , G06F11/1658 , G06F11/1666 , G06F11/2023 , G06F11/2043 , G06F11/2094 , G06F12/0813 , G06F17/30076 , G06F17/30312 , G06F2201/82 , G06F2201/825 , G06F2201/84 , G06F2209/523 , H04L67/1097
摘要： Various embodiments for facilitating search, list and retrieval operations on a persistent data set using a distributed shared memory (DSM) by a processor device are provided. In one exemplary embodiment, a DSM is used to store the data structures in a cluster shared memory, such that updates, deletions and insertions are applied to both the persistent data set and the DSM, and search, list and retrieval operations are processed directly from the DSM. A data structure in the persistent data set is stored in two separate DSM pages: a first page includes an identifying search key of the data structure, the search key also pointing to a location of the data structure in the storage. A second page includes the updatable properties of the data structure. A DSM storing the data structures' pages is organized as a two-row matrix.
摘要翻译：提供了用于利用由处理器设备使用分布式共享存储器（DSM）的持久数据集的搜索，列表和检索操作的各种实施例。在一个示例性实施例中，DSM用于将数据结构存储在群集共享存储器中，使得更新，删除和插入被应用于持久数据集和DSM两者，并且搜索，列表和检索操作直接从帝斯曼持久数据集中的数据结构存储在两个单独的DSM页面中：第一页包括数据结构的识别搜索关键字，搜索关键字还指向存储器中的数据结构的位置。第二页包括数据结构的可更新属性。存储数据结构页面的DSM被组织为两行矩阵。

5. 发明申请

US20120246428A1 REDUCTION OF COMMUNICATION AND EFFICIENT FAILOVER PROCESSING IN DISTRIBUTED SHARED MEMORY-BASED APPLICATION 失效
标题翻译：在分布式共享存储器应用中减少通信和高效的故障处理
公开(公告)号：US20120246428A1
公开(公告)日：2012-09-27
申请号：US13488139
申请日：2012-06-04
申请人： 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.
摘要翻译：提供了用于减少集群节点之间的通信并由至少一个处理器设备在基于分布式共享存储器（DSM））的应用中优化故障切换处理的各种实施例。在一个实施例中，对于在DSM上可操作的数据结构，在主集群节点之间可共享的单个副本中维持主要读取的部分，而可更新部分被维护在多个副本中，多个副本中的每一个专用于单个集群节点。

6. 发明申请

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.

7. 发明申请

US20120239633A1 DYNAMIC REWRITE OF FILES WITHIN DEDUPLICATION SYSTEM 有权
标题翻译：文件系统中的动态REWRITE
公开(公告)号：US20120239633A1
公开(公告)日：2012-09-20
申请号：US13488164
申请日：2012-06-04
申请人： Lior ARONOVICH , Samuel KRIKLER , Asaf LEVY , Amit SCHREIBER
发明人： Lior ARONOVICH , Samuel KRIKLER , Asaf LEVY , Amit SCHREIBER
IPC分类号： G06F17/30
CPC分类号： G06F17/30156
摘要： A dynamic layer above a sequential deduplication file system (denoted as DFS) implements the rewrite functionality. A user file is composed of one or more DFS files. As incoming data is written into a user file, the data is written by the dynamic layer sequentially into DFS files, created one by one. For each user file this dynamic layer creates and maintains a dynamic metadata file, in a regular, non deduplicated file system. This metadata file contains entries pointing to sections of DFS files.
摘要翻译：顺序重复数据删除文件系统（表示为DFS）上的动态层实现重写功能。用户文件由一个或多个DFS文件组成。随着输入数据被写入用户文件，数据由动态层依次写入到DFS文件中，逐个创建。对于每个用户文件，此动态层在常规的非重复数据删除的文件系统中创建和维护动态元数据文件。此元数据文件包含指向DFS文件部分的条目。

8. 发明申请

US20120143832A1 DYNAMIC REWRITE OF FILES WITHIN DEDUPLICATION SYSTEM 有权
标题翻译：文件系统中的动态REWRITE
公开(公告)号：US20120143832A1
公开(公告)日：2012-06-07
申请号：US12958200
申请日：2010-12-01
申请人： Lior ARONOVICH , Samuel KRIKLER , Asaf LEVY , Amit SCHREIBER
发明人： Lior ARONOVICH , Samuel KRIKLER , Asaf LEVY , Amit SCHREIBER
IPC分类号： G06F17/30
CPC分类号： G06F17/30156
摘要： Various embodiments for rewriting data in a deduplication storage environment by a processor device are provided. A dynamic layer above a sequential deduplication file system (denoted as DFS) implements the rewrite functionality. A user file is composed of one or more DFS files. As incoming data is written into a user file, the data is written by the dynamic layer sequentially into DFS files, created one by one. For each user file this dynamic layer creates and maintains a dynamic metadata file, in a regular, non deduplicated file system. This metadata file contains entries pointing to sections of DFS files.
摘要翻译：提供了用于由处理器设备重写重复数据删除存储环境中的数据的各种实施例。顺序重复数据删除文件系统（表示为DFS）上的动态层实现重写功能。用户文件由一个或多个DFS文件组成。随着输入数据被写入用户文件，数据由动态层依次写入到DFS文件中，逐个创建。对于每个用户文件，此动态层在常规的非重复数据删除的文件系统中创建和维护动态元数据文件。此元数据文件包含指向DFS文件部分的条目。

9. 发明申请

US20110040728A1 REPLICATION OF DEDUPLICATED DATA 有权
标题翻译：复制数据的复制
公开(公告)号：US20110040728A1
公开(公告)日：2011-02-17
申请号：US12539109
申请日：2009-08-11
申请人： Shay H. AKIRAV , Lior ARONOVICH , Ron ASHER , Yariv BACHAR , Ariel J. ISH-SHALOM , Ofer LENEMAN
发明人： Shay H. AKIRAV , Lior ARONOVICH , Ron ASHER , Yariv BACHAR , Ariel J. ISH-SHALOM , Ofer LENEMAN
IPC分类号： G06F12/16 , G06F12/00
CPC分类号： G06F17/30581 , G06F3/0641 , G06F3/065 , G06F11/2094
摘要： Various embodiments for replicating deduplicated data using a processor device are provided. A block of the deduplicated data, created in a source repository, is assigned a global block identification (id) unique in a grid set inclusive of the source repository. The global block id is generated using at least one unique identification value of the block, a containing grid of the grid set, and the source repository. The global block id is transmitted from the source repository to a target repository. If the target repository determines the global block id is associated with an existing block of the deduplicated data located within the target repository, the block is not received by the target repository during a subsequent replication process.
摘要翻译：提供了使用处理器设备复制重复数据删除的数据的各种实施例。在源存储库中创建的重复数据删除数据块被分配在包含源存储库的网格集中唯一的全局块标识（id）。使用块的至少一个唯一标识值，包含网格集合的网格和源存储库来生成全局块ID。全局块id从源存储库传输到目标存储库。如果目标存储库确定全局块id与位于目标存储库内的已重复数据消除的数据的现有块相关联，则在后续复制过程中该目标存储库不会接收该块。

10. 发明申请

US20140012822A1 SUB-BLOCK PARTITIONING FOR HASH-BASED DEDUPLICATION 有权
标题翻译：用于基于HASH的重复的子块分区
公开(公告)号：US20140012822A1
公开(公告)日：2014-01-09
申请号：US13541009
申请日：2012-07-03
申请人： Lior ARONOVICH , Michael HIRSCH
发明人： Lior ARONOVICH , Michael HIRSCH
IPC分类号： G06F17/30
CPC分类号： G06F17/30371 , G06F3/0608 , G06F3/0641 , G06F3/067 , G06F17/30156 , G06F17/30159 , G06F17/3033 , G06F17/30424 , G06F17/30864
摘要： Sub-block partitioning for hash-based deduplication is performed by defining a minimal size and maximum size of the sub-block. For each boundary start position of the sub-block, starting a search, after the minimal size of the sub-block, for a boundary position of a subsequent sub-block by using multiple search criteria to test hash values that are calculated during the search. If one of the multiple search criteria is satisfied by one of the hash values, declaring the position of the hash value as a boundary end position of the sub-block. If the maximum size of the sub-block is reached prior to satisfying one of the multiple search criteria, declaring a position of an alternative one of the hash values that is selected based upon another one of the multiple search criteria as the boundary end position of the sub-block.
摘要翻译：通过定义子块的最小大小和最大大小来执行用于基于哈希的重复数据删除的子块分区。对于子块的每个边界开始位置，通过使用多个搜索准则来测试在搜索期间计算的哈希值，在子块的最小尺寸之后开始搜索后续子块的边界位置。如果通过散列值之一满足多个搜索条件之一，则将哈希值的位置声明为子块的边界结束位置。如果在满足多个搜索条件中的一个之前达到子块的最大大小，则声明基于多个搜索准则中的另一个来选择的替代的一个哈希值的位置作为多个搜索条件的边界结束位置子块。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式