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

1. 发明申请

US20110191522A1 Managing Metadata and Page Replacement in a Persistent Cache in Flash Memory 审中-公开
标题翻译：在闪存中持久缓存中管理元数据和页面替换
公开(公告)号：US20110191522A1
公开(公告)日：2011-08-04
申请号：US12698926
申请日：2010-02-02
申请人： Michael N. Condict , Stephen M. Byan , James F. Lentini
发明人： Michael N. Condict , Stephen M. Byan , James F. Lentini
IPC分类号： G06F12/00 , G06F12/08
CPC分类号： G06F12/123 , G06F2212/1016 , G06F2212/222 , G06F2212/7204 , G06F2212/7207
摘要： A persistent cache is implemented in a flash memory that includes a journal section that stores metadata and a low frequency section and a high frequency section that store data entries. Writing new metadata to the persistent cache includes sequentially advancing to a next sector containing an invalid metadata entry, saving a working copy of the sector in RAM, writing metadata corresponding to one or more new data entries in the working copy, and overwriting the sector in the flash memory containing the invalid entry with the working copy. Writes to the low frequency and high frequency sections occur sequentially in the current locations of a low frequency section pointer and a high frequency section pointer, respectively. In a persistent cache, the reconstruction of a non-persistent cache utilizes the metadata entry that has the most recent timestamp.
摘要翻译：在闪速存储器中实现持久缓存，其包括存储元数据的日志部分和存储数据条目的低频部分和高频部分。将新的元数据写入永久性高速缓存包括依次前进到包含无效元数据条目的下一个扇区，在RAM中保存扇区的工作副本，在工作副本中写入与一个或多个新数据条目对应的元数据，并覆盖闪存包含与工作副本无效的条目。对低频部分指针和高频部分指针的当前位置分别顺序地发送到低频部分和高频部分的写入。在永久缓存中，非持久性高速缓存的重建利用了具有最新时间戳的元数据条目。

2. 发明授权

US08620886B1 Host side deduplication 有权
标题翻译：主机端重复数据删除
公开(公告)号：US08620886B1
公开(公告)日：2013-12-31
申请号：US13237417
申请日：2011-09-20
申请人： Anshul Madan , James F. Lentini , Michael N. Condict , Stephen M. Byan
发明人： Anshul Madan , James F. Lentini , Michael N. Condict , Stephen M. Byan
IPC分类号： G06F17/00 , G06F17/30 , G06F13/00 , G06F15/16
CPC分类号： G06F3/0641 , G06F3/0608 , G06F3/0611 , G06F3/0659 , G06F3/067 , G06F3/0679 , G06F11/3037 , G06F12/0891 , G06F13/00 , G06F15/16 , G06F17/00 , G06F17/30 , G06F17/30097 , G06F17/30156 , G06F17/30162 , G06F17/30188 , G06F17/30194 , H04L67/2828 , H04L67/2852
摘要： One or more techniques and/or systems are provided for performing host side deduplication. Host side deduplication may be performed upon writeable data within a write request received at a host computing device configured to access data stored by a storage server. The host side deduplication may be performed at the host computing device to determine whether the writeable data is already stored by the storage server based upon querying a host side cache comprising data stored by a storage server and/or a data structure comprising unique signatures of data stored by the storage server. If the writeable data is stored by the storage server, then a deduplication notification excluding the writeable data may be sent to the storage server, otherwise a write command comprising the writeable data may be sent. Accordingly, unnecessary network traffic of redundant data already stored by the storage server may be reduced.
摘要翻译：提供一个或多个技术和/或系统用于执行主机端重复数据删除。主机重复数据删除可以在被配置为访问由存储服务器存储的数据的主计算设备接收的写请求内的可写数据上执行。可以在主机计算设备处执行主机重复数据删除，以基于查询包含由存储服务器存储的数据的主机侧缓存器和/或包括唯一的数据签名的数据结构来确定存储服务器是否已经存储了可写数据由存储服务器存储。如果存储服务器存储可写数据，则可以向存储服务器发送排除可写数据的重复数据消除通知，否则可以发送包含可写数据的写命令。因此，可以减少由存储服务器已经存储的冗余数据的不必要的网络流量。

3. 发明授权

US08607017B2 Use of similarity hash to route data for improved deduplication in a storage server cluster 有权
标题翻译：使用相似性哈希来路由数据，以改善存储服务器集群中的重复数据删除
公开(公告)号：US08607017B2
公开(公告)日：2013-12-10
申请号：US13619826
申请日：2012-09-14
申请人： Michael N. Condict
发明人： Michael N. Condict
IPC分类号： G06F12/00
CPC分类号： G06F3/0641 , G06F3/0608 , G06F3/067 , G06F17/30159 , G06F2206/1012 , H04L67/1095
摘要： A technique for routing data for deduplication in a storage server cluster includes computing, for each node in the cluster, a value collectively representative of the data stored on the node, such as a “geometric center” of the node. New or modified data is routed to the node which has stored data identical or most similar to the new or modified data, as determined based on those values. Each node stores a plurality of chunks of data, where each chunk includes multiple deduplication segments. A content hash is computed for each deduplication segment in each node, and a similarity hash is computed for each chunk from the content hashes of all segments in the chunk. A geometric center of a node is computed from the similarity hashes of the chunks stored in the node.
摘要翻译：用于在存储服务器集群中路由用于重复数据消除的数据的技术包括针对集群中的每个节点计算共同表示存储在节点上的数据的值，例如节点的“几何中心”。新的或修改的数据被路由到已经存储与基于这些值确定的新的或修改的数据相同或最相似的数据的节点。每个节点存储多个数据块，其中每个块包括多个重复数据删除段。为每个节点中的每个重复数据消除段计算内容散列，并且从块中的所有段的内容散列为每个块计算相似性散列。从节点中存储的块的相似度哈希计算节点的几何中心。

4. 发明授权

US08799367B1 Using logical block addresses with generation numbers as data fingerprints for network deduplication 有权
标题翻译：使用产生号码的逻辑块地址作为重复数据删除的数据指纹
公开(公告)号：US08799367B1
公开(公告)日：2014-08-05
申请号：US12610231
申请日：2009-10-30
申请人： Michael N. Condict , Steven R. Kleiman
发明人： Michael N. Condict , Steven R. Kleiman
IPC分类号： G06F15/16
CPC分类号： G06F3/0608 , G06F3/0619 , G06F3/0641 , G06F3/065 , G06F3/067 , G06F3/0679 , G06F12/0813 , G06F12/0815 , G06F2206/1014 , H04L29/08549 , H04L49/9063 , H04L67/1095 , H04L67/1097 , H04L67/2842 , H04L69/04
摘要： The technique introduced here involves using a block address and a corresponding generation number as a “fingerprint” to uniquely identify a sequence of data within a given storage domain. Each block address has an associated generation number which indicates the number of times that data at that block address has been modified. This technique can be employed, for example, to determine whether a given storage server already has the data, and to avoid sending the data to that storage server over a network if it already has the data. It can also be employed to maintain cache coherency among multiple storage nodes.
摘要翻译：这里引入的技术涉及使用块地址和对应的生成号码作为“指纹”来唯一地标识给定存储域内的数据序列。每个块地址具有相关联的生成号，其指示该块地址处的数据已被修改的次数。例如，可以采用这种技术来确定给定的存储服务器是否已经具有数据，并且如果数据已经具有数据，则避免通过网络将数据发送到该存储服务器。也可以用于维护多个存储节点之间的高速缓存一致性。

5. 发明申请

US20130275396A1 Systems and Methods for Selecting Data Compression for Storage Data in a Storage System 有权
标题翻译：选择存储系统中存储数据的数据压缩的系统和方法
公开(公告)号：US20130275396A1
公开(公告)日：2013-10-17
申请号：US13444250
申请日：2012-04-11
申请人： Michael N. Condict , Fei Xie , Sandip Shete
发明人： Michael N. Condict , Fei Xie , Sandip Shete
IPC分类号： G06F7/00
CPC分类号： H03M7/607 , H03M7/30
摘要： Storage systems and methods to improve space saving from data compression by providing a plurality of compression processes, and optionally, one or more parameters for controlling operation of the compression processes and selecting from the plurality of compression processes and the parameters to satisfy resource limits, such as CPU usage and memory usage. In one embodiment, the methods takes into account the content-type, such as text file or video file, and select the compression process and parameters that provide the greatest space savings for that content type while also remaining within a defined resource-usage limit.
摘要翻译：通过提供多个压缩过程以及可选地用于控制压缩处理的操作的一个或多个参数并且从多个压缩过程和参数中选择以满足资源限制，从而提高数据压缩的空间节省的存储系统和方法，例如作为CPU使用和内存使用。在一个实施例中，这些方法考虑了诸如文本文件或视频文件的内容类型，并且选择压缩过程和为该内容类型提供最大空间节省的参数，同时还保留在定义的资源使用限制内。

6. 发明授权

US08473690B1 Using logical block addresses with generation numbers as data fingerprints to provide cache coherency 有权
标题翻译：使用具有生成号码的逻辑块地址作为数据指纹来提供高速缓存一致性
公开(公告)号：US08473690B1
公开(公告)日：2013-06-25
申请号：US12610234
申请日：2009-10-30
申请人： Michael N. Condict
发明人： Michael N. Condict
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28
CPC分类号： G06F12/0815 , G06F12/0866 , G06F2212/263 , G06F2212/314
摘要： The technique introduced here involves using a block address and a corresponding generation number as a “fingerprint” to uniquely identify a sequence of data within a given storage domain. Each block address has an associated generation number which indicates the number of times that data at that block address has been modified. This technique can be employed, for example, to maintain cache coherency among multiple storage nodes. It can also be employed to avoid sending the data to a network node over a network if it already has the data.
摘要翻译：这里引入的技术涉及使用块地址和对应的生成号码作为“指纹”来唯一地标识给定存储域内的数据序列。每个块地址具有相关联的生成号，其指示该块地址处的数据已被修改的次数。这种技术可以用于例如在多个存储节点之间维持高速缓存一致性。如果数据已经具有数据，也可以通过网络避免将数据发送到网络节点。

7. 发明授权

US09048862B2 Systems and methods for selecting data compression for storage data in a storage system 有权
标题翻译：用于为存储系统中的存储数据选择数据压缩的系统和方法
公开(公告)号：US09048862B2
公开(公告)日：2015-06-02
申请号：US13444250
申请日：2012-04-11
申请人： Michael N. Condict , Fei Xie , Sandip Shete
发明人： Michael N. Condict , Fei Xie , Sandip Shete
IPC分类号： G06F17/30 , H03M7/30
CPC分类号： H03M7/607 , H03M7/30
摘要： Storage systems and methods to improve space saving from data compression by providing a plurality of compression processes, and optionally, one or more parameters for controlling operation of the compression processes and selecting from the plurality of compression processes and the parameters to satisfy resource limits, such as CPU usage and memory usage. In one embodiment, the methods takes into account the content-type, such as text file or video file, and select the compression process and parameters that provide the greatest space savings for that content type while also remaining within a defined resource-usage limit.
摘要翻译：通过提供多个压缩过程以及可选地用于控制压缩处理的操作的一个或多个参数并且从多个压缩过程和参数中选择以满足资源限制，从而提高数据压缩的空间节省的存储系统和方法，例如作为CPU使用和内存使用。在一个实施例中，这些方法考虑了诸如文本文件或视频文件的内容类型，并且选择压缩过程和为该内容类型提供最大空间节省的参数，同时还保留在定义的资源使用限制内。

8. 发明授权

US08321648B2 Use of similarity hash to route data for improved deduplication in a storage server cluster 有权
标题翻译：使用相似性哈希来路由数据，以改善存储服务器集群中的重复数据删除
公开(公告)号：US08321648B2
公开(公告)日：2012-11-27
申请号：US12606088
申请日：2009-10-26
申请人： Michael N. Condict
发明人： Michael N. Condict
IPC分类号： G06F12/00
CPC分类号： G06F3/0641 , G06F3/0608 , G06F3/067 , G06F17/30159 , G06F2206/1012 , H04L67/1095
摘要： A technique for routing data for deduplication in a storage server cluster includes computing, for each node in the cluster, a value collectively representative of the data stored on the node, such as a “geometric center” of the node. New or modified data is routed to the node which has stored data identical or most similar to the new or modified data, as determined based on those values. Each node stores a plurality of chunks of data, where each chunk includes multiple deduplication segments. A content hash is computed for each deduplication segment in each node, and a similarity hash is computed for each chunk from the content hashes of all segments in the chunk. A geometric center of a node is computed from the similarity hashes of the chunks stored in the node.
摘要翻译：用于在存储服务器集群中路由用于重复数据消除的数据的技术包括针对集群中的每个节点计算共同表示存储在节点上的数据（例如节点的几何中心）的值。新的或修改的数据被路由到已经存储与基于这些值确定的新的或修改的数据相同或最相似的数据的节点。每个节点存储多个数据块，其中每个块包括多个重复数据删除段。为每个节点中的每个重复数据消除段计算内容散列，并且从块中的所有段的内容散列为每个块计算相似性散列。从节点中存储的块的相似度哈希计算节点的几何中心。

9. 发明申请

US20110099351A1 Use of Similarity Hash to Route Data for Improved Deduplication in a Storage Server Cluster 有权
标题翻译：使用相似性哈希来在存储服务器群集中路由数据以改进重复数据删除
公开(公告)号：US20110099351A1
公开(公告)日：2011-04-28
申请号：US12606088
申请日：2009-10-26
申请人： Michael N. Condict
发明人： Michael N. Condict
IPC分类号： G06F12/08
CPC分类号： G06F3/0641 , G06F3/0608 , G06F3/067 , G06F17/30159 , G06F2206/1012 , H04L67/1095
摘要： A technique for routing data for improved deduplication in a storage server cluster includes computing, for each node in the cluster, a value collectively representative of the data stored on the node, such as a “geometric center” of the node. New or modified data is routed to the node which has stored data identical or most similar to the new or modified data, as determined based on those values. Each node stores a plurality of chunks of data, where each chunk includes multiple deduplication segments. A content hash is computed for each deduplication segment in each node, and a similarity hash is computed for each chunk from the content hashes of all segments in the chunk. A geometric center of a node is computed from the similarity hashes of the chunks stored in the node.
摘要翻译：用于路由数据以在存储服务器集群中改进重复数据消除的技术包括针对集群中的每个节点计算共同表示存储在节点上的数据（例如节点的“几何中心”）的值。新的或修改的数据被路由到已经存储与基于这些值确定的新的或修改的数据相同或最相似的数据的节点。每个节点存储多个数据块，其中每个块包括多个重复数据删除段。为每个节点中的每个重复数据消除段计算内容散列，并且从块中的所有段的内容散列为每个块计算相似性散列。从节点中存储的块的相似度哈希计算节点的几何中心。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式