-
公开(公告)号：US20150347434A1
公开(公告)日：2015-12-03
申请号：US14824972
申请日：2015-08-12
Applicant: DataDirect Networks, Inc.
Inventor： Jason M. Cope , Paul J. Nowoczynski , Pavan Kumar Kumar Uppu , Donald J. Molaro , Michael J. Piszczek , John G. Manning
CPC classification number: G06F17/30091 , G06F12/0802 , G06F12/0866 , G06F12/0895 , G06F17/3012 , G06F17/30132 , G06F2212/1024 , G06F2212/163
Abstract: Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system.
Abstract translation: 这里公开了用于减少写入任何位置的存储系统中的元数据的系统和方法。 该系统包括与多个存储节点耦合的多个客户端，每个存储节点具有耦合到其上的多个主存储设备。 包括缓存存储器的存储器管理单元包括在客户机中。 在将数据存储在主存储器中之前，存储器管理单元用作由客户端生成的数据的高速缓存。 缓存包括扩展缓存，扩展名索引，提交高速缓存和提交索引。 数据和元数据的移动是间隔树。 减少间隔树中数据的方法增加了系统的数据存储和数据检索性能。
-
公开(公告)号：US09454533B2
公开(公告)日：2016-09-27
申请号：US14824972
申请日：2015-08-12
Applicant: DataDirect Networks, Inc.
Inventor： Jason M. Cope , Paul J. Nowoczynski , Pavan Kumar Kumar Uppu , Donald J. Molaro , Michael J. Piszczek , John G. Manning
CPC classification number: G06F17/30091 , G06F12/0802 , G06F12/0866 , G06F12/0895 , G06F17/3012 , G06F17/30132 , G06F2212/1024 , G06F2212/163
Abstract: Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system.
-
公开(公告)号：US20140108723A1
公开(公告)日：2014-04-17
申请号：US14056265
申请日：2013-10-17
Applicant: DataDirect Networks, Inc.
Inventor： Paul J. Nowoczynski , Jason M. Cope , Pavan Kumar Uppu , Donald J. Molaro , Michael J. Piszczek , John G. Manning
IPC: G06F12/08
CPC classification number: G06F17/30091 , G06F12/0802 , G06F12/0866 , G06F12/0895 , G06F17/3012 , G06F17/30132 , G06F2212/1024 , G06F2212/163
Abstract: Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system.
Abstract translation: 这里公开了用于减少写入任何位置的存储系统中的元数据的系统和方法。 该系统包括与多个存储节点耦合的多个客户端，每个存储节点具有耦合到其上的多个主存储设备。 包括缓存存储器的存储器管理单元包括在客户机中。 在将数据存储在主存储器中之前，存储器管理单元用作由客户端生成的数据的高速缓存。 缓存包括扩展缓存，扩展名索引，提交高速缓存和提交索引。 数据和元数据的移动是间隔树。 减少间隔树中数据的方法增加了系统的数据存储和数据检索性能。
-
Patent Agency Ranking
4.发明授权Method and system for reclamation of distributed dynamically generated erasure groups for data migration between high performance computing architectures and data storage using non-deterministic data addressing 有权用于回收分布式动态生成的擦除组的方法和系统，用于使用非确定性数据寻址在高性能计算架构和数据存储之间进行数据迁移公开(公告)号：US09378088B1
公开(公告)日：2016-06-28
申请号：US14586346
申请日：2014-12-30
Applicant: DATADIRECT NETWORKS, INC.
Inventor： Michael J. Piszczek , Jason M. Cope , Paul J. Nowoczynski , Pavan Kumar Uppu
CPC classification number: G06F11/1008 , G06F3/061 , G06F3/0619 , G06F3/0644 , G06F3/0647 , G06F3/0685 , G06F11/1076 , G06F17/30194
Abstract: The present invention is directed to data migration, and particularly, Parity Group migration, between high performance data generating entities and data storage structure in which distributed NVM arrays are used as a single intermediate logical storage which requires a global registry/addressing capability that facilitates the storage and retrieval of the locality information (metadata) for any given fragment of unstructured data and where Parity Group Identifier and Parity Group Information (PGI) descriptors for the Parity Groups' members tracking, are created and distributed in the intermediate distributed NVM arrays as a part of the non-deterministic data addressing system to ensure coherency and fault tolerance for the data and the metadata. The PGI descriptors act as collection points for state describing the residency and replay status of members of the Parity Groups.
Abstract translation: 本发明涉及数据迁移，特别是在高性能数据生成实体和数据存储结构之间的数据迁移，其中分布式NVM阵列用作需要全局注册/寻址能力的单个中间逻辑存储器的数据存储结构， 存储和检索非结构化数据的任何给定片段的位置信息（元数据），以及奇偶校验组成员跟踪的奇偶校验组标识符和奇偶校验组信息（PGI）描述符被创建并分布在中间分布式NVM阵列中，作为 部分非确定性数据寻址系统，以确保数据和元数据的一致性和容错性。 PGI描述符作为描述奇偶校验组成员的驻留和重播状态的状态的收集点。
-
5.发明授权公开(公告)号：US09152649B2
公开(公告)日：2015-10-06
申请号：US14050156
申请日：2013-10-09
Applicant: DataDirect Networks, Inc.
Inventor： Paul J. Nowoczynski , Jason M. Cope , Pavan Kumar Uppu , Donald J. Molaro , Michael J. Piszczek , John G. Manning
IPC: G06F17/30
CPC classification number: G06F17/30227 , G06F17/30094
Abstract: Data storage systems and methods for storing data are described herein. The storage system includes a first storage node is configured to issue a first delivery request to a first set of other storage nodes in the storage system, the first delivery request including a first at least one data operation for each of the first set of other storage nodes and issuing at least one other delivery request, while the first delivery request remains outstanding, the at least one other delivery request including a first commit request for each of the first set of other storage nodes. The first node causes the first at least one data operation to be made active within the storage system in response to receipt of a commit indicator along with a delivery acknowledgement regarding one of the at least one other delivery request.
Abstract translation: 本文描述了用于存储数据的数据存储系统和方法。 存储系统包括第一存储节点，其被配置为向存储系统中的第一组其他存储节点发出第一传送请求，第一传送请求包括第一组其他存储器中的每一个的第一至少一个数据操作 节点并且发出至少一个其他递送请求，而所述第一递送请求保持未决，所述至少一个其他递送请求包括针对所述第一组其他存储节点中的每一个的第一提交请求。 第一节点使得响应于接收到提交指示符以及关于至少一个其他传送请求之一的传送确认，使存储系统内的第一至少一个数据操作被激活。
-
6.发明授权Method and system for data migration between high performance computing architectures and file system using distributed parity group information structures with non-deterministic data addressing 有权使用具有非确定性数据寻址的分布式奇偶校验组信息结构在高性能计算架构和文件系统之间进行数据迁移的方法和系统公开(公告)号：US09477551B1
公开(公告)日：2016-10-25
申请号：US14556571
申请日：2014-12-01
Applicant: DATADIRECT NETWORKS, INC.
Inventor： Michael J. Piszczek , Jason M. Cope , Paul J. Nowoczynski , Pavan Kumar Uppu
CPC classification number: G06F11/1076 , G06F3/06 , G06F11/1088 , G06F17/30079 , G06F2211/1009 , G06F2211/1028 , G06F2211/104
Abstract: The present invention is directed to data migration, and particularly, Parity Group migration, between high performance data generating entities and data storage structure in which distributed NVM arrays are used as a single intermediate logical storage which requires a global registry/addressing capability that facilitates the storage and retrieval of the locality information (metadata) for any given fragment of unstructured data and where Parity Group Identifier and Parity Group Information (PGI) descriptors for the Parity Groups' members tracking, are created and distributed in the intermediate distributed NVM arrays as a part of the non-deterministic data addressing system to ensure coherency and fault tolerance for the data and the metadata. The PGI descriptors act as collection points for state describing the residency and replay status of members of the Parity Groups.
Abstract translation: 本发明涉及数据迁移，特别是在高性能数据生成实体和数据存储结构之间的数据迁移，其中分布式NVM阵列用作需要全局注册/寻址能力的单个中间逻辑存储器的数据存储结构， 存储和检索非结构化数据的任何给定片段的位置信息（元数据），以及奇偶校验组成员跟踪的奇偶校验组标识符和奇偶校验组信息（PGI）描述符被创建并分布在中间分布式NVM阵列中，作为 部分非确定性数据寻址系统，以确保数据和元数据的一致性和容错性。 PGI描述符作为描述奇偶校验组成员的驻留和重播状态的状态的收集点。
-
公开(公告)号：US09116819B2
公开(公告)日：2015-08-25
申请号：US14056265
申请日：2013-10-17
Applicant: DataDirect Networks, Inc.
Inventor： Jason M. Cope , Paul J. Nowoczynski , Pavan Kumar Uppu , Donald J. Molaro , Michael J. Piszczek , John G. Manning
CPC classification number: G06F17/30091 , G06F12/0802 , G06F12/0866 , G06F12/0895 , G06F17/3012 , G06F17/30132 , G06F2212/1024 , G06F2212/163
Abstract: Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system.
Abstract translation: 这里公开了用于减少写入任何位置的存储系统中的元数据的系统和方法。 该系统包括与多个存储节点耦合的多个客户端，每个存储节点具有耦合到其上的多个主存储设备。 包括缓存存储器的存储器管理单元包括在客户机中。 在将数据存储在主存储器中之前，存储器管理单元用作由客户端生成的数据的高速缓存。 缓存包括扩展缓存，扩展名索引，提交高速缓存和提交索引。 数据和元数据的移动是间隔树。 减少间隔树中数据的方法增加了系统的数据存储和数据检索性能。
-
8.发明申请公开(公告)号：US20140108473A1
公开(公告)日：2014-04-17
申请号：US14050156
申请日：2013-10-09
Applicant: DataDirect Networks, Inc.
Inventor： Paul J. Nowoczynski , Jason M. Cope , Pavan Kumar Uppu , Donald J. Molaro , Michael J. Piszczek , John G. Manning
IPC: G06F17/30
CPC classification number: G06F17/30227 , G06F17/30094
Abstract: Data storage systems and methods for storing data are described herein. The storage system includes a first storage node is configured to issue a first delivery request to a first set of other storage nodes in the storage system, the first delivery request including a first at least one data operation for each of the first set of other storage nodes and issuing at least one other delivery request, while the first delivery request remains outstanding, the at least one other delivery request including a first commit request for each of the first set of other storage nodes. The first node causes the first at least one data operation to be made active within the storage system in response to receipt of a commit indicator along with a delivery acknowledgement regarding one of the at least one other delivery request.
Abstract translation: 本文描述了用于存储数据的数据存储系统和方法。 存储系统包括第一存储节点，其被配置为向存储系统中的第一组其他存储节点发出第一传送请求，第一传送请求包括第一组其他存储器中的每一个的第一至少一个数据操作 节点并且发出至少一个其他递送请求，而所述第一递送请求保持未决，所述至少一个其他递送请求包括针对所述第一组其他存储节点中的每一个的第一提交请求。 第一节点使得响应于接收到提交指示符以及关于至少一个其他传送请求之一的传送确认，使存储系统内的第一至少一个数据操作被激活。
-
-
-
-
-
-
-
Search Results
8
records
(took 0.016 seconds)
