-
公开(公告)号：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: 这里公开了用于减少写入任何位置的存储系统中的元数据的系统和方法。 该系统包括与多个存储节点耦合的多个客户端，每个存储节点具有耦合到其上的多个主存储设备。 包括缓存存储器的存储器管理单元包括在客户机中。 在将数据存储在主存储器中之前，存储器管理单元用作由客户端生成的数据的高速缓存。 缓存包括扩展缓存，扩展名索引，提交高速缓存和提交索引。 数据和元数据的移动是间隔树。 减少间隔树中数据的方法增加了系统的数据存储和数据检索性能。
-
公开(公告)号：US09959062B1
公开(公告)日：2018-05-01
申请号：US15016696
申请日：2016-02-05
Applicant: DATADIRECT NETWORKS, INC.
Inventor： Michael J. Piszczek , Jason M. Cope
CPC classification number: G06F3/0619 , G06F3/0611 , G06F3/0644 , G06F3/0647 , G06F3/0659 , G06F3/0689 , G06F11/1662 , G06F11/1666 , G06F11/2094 , G06F2201/805
Abstract: A data migration system supports a low-latency and reduced overhead data storage protocol for data storage sharing in a non-collision fashion which does not require inter-communication and permanent arbitration between data storage controllers to decide on the data placement/routing. The multiple data fragments of data sets are prevented from routing to the same storage devices by a multi-step selection protocol which selects (in a first phase of the selection routine) a healthy highest ranked drive enclosure, and further selects (in a second phase of the selection routine) a healthy highest-ranked data storage controller residing in the selected drive enclosure, for routing data fragments to different storage pools assigned to the selected data storage devices for exclusive “writing” and data modification. The selection protocol also contemplates various failure scenarios in a data placement collision free manner.
-
公开(公告)号：US09823968B1
公开(公告)日：2017-11-21
申请号：US14832147
申请日：2015-08-21
Applicant: DATADIRECT NETWORKS, INC.
Inventor： Thomas E. Fugini , Michael J. Piszczek , William J Harker , Jason M. Cope , Pavan Kumar Uppu
CPC classification number: G06F11/1076 , G06F3/0619 , G06F3/064 , G06F3/0689
Abstract: Variable Redundancy Distributed (VRD) RAID controller in a data storage environment contains embedded RAID logic permitting to choose and compute a desired redundancy coding scheme from a plurality thereof pre-programmed and embedded in a Compute Engine in the VRD RAID controller. “Write” or “Read” requests which are received from data generating entities, contain information identifying a type of the redundancy coding scheme of interest. The controller decodes the request, and automatically applies the desired computation to the incoming data without burdening the CPU with the computational activity. The variable redundancy computational ability of the subject systems provides an extremely versatile and flexible tool for RAID operations.
-
公开(公告)号：US09652160B1
公开(公告)日：2017-05-16
申请号：US14934314
申请日：2015-11-06
Applicant: DATADIRECT NETWORKS, INC.
Inventor： Michael J. Piszczek , Jason M. Cope , Zhiwei Sun
CPC classification number: G06F3/0616 , G06F3/0647 , G06F3/0688
Abstract: Method and system for data migration between data generating entities and data storage devices protected by de-clustered RAID algorithm are enhanced by dynamically controlling the I/O activity towards the data storage devices (NVM devices) based on their remaining lifespan (health) with the goal to prevent multiple devices selected for writing a parity stripe information from simultaneous failures. This feature is rendered by polling the remaining health of NVM devices in the RAID pool, computing a weighted lifespan for each NVM device, comparing the latter to an average of all NVM devices in the pool, and adjusting the I/O activity towards the NVM device of interest accordingly. If the weighted lifespan exceeds the average lifespan in the pool, the allowed I/O activity is increased, and if the weighted lifespan is below the average for the pool, then the device in question is sent less “writes”.
-
公开(公告)号：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: 这里公开了用于减少写入任何位置的存储系统中的元数据的系统和方法。 该系统包括与多个存储节点耦合的多个客户端，每个存储节点具有耦合到其上的多个主存储设备。 包括缓存存储器的存储器管理单元包括在客户机中。 在将数据存储在主存储器中之前，存储器管理单元用作由客户端生成的数据的高速缓存。 缓存包括扩展缓存，扩展名索引，提交高速缓存和提交索引。 数据和元数据的移动是间隔树。 减少间隔树中数据的方法增加了系统的数据存储和数据检索性能。
-
Patent Agency Ranking
公开(公告)号：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.
-
7.发明授权Data storage system employing a distributed compute engine memory controller with embedded logic and arithmetic functionality and method for data migration between high-performance computing architectures and data storage devices using the same 有权数据存储系统采用具有嵌入式逻辑和算术功能的分布式计算引擎存储器控制器和用于使用其的数据存储设备在高性能计算架构之间进行数据迁移的方法公开(公告)号：US09092152B1
公开(公告)日：2015-07-28
申请号：US13894769
申请日：2013-05-15
Applicant: DATADIRECT NETWORKS, INC.
Inventor： Michael J. Piszczek , Thomas E. Fugini , William J. Harker , Pavan K. Uppu , Jason M. Cope
CPC classification number: G06F3/0647 , G06F11/1096 , G06F13/4022
Abstract: Distributed Compute Engine (DCE) memory controller in a data storage environment contains embedded logic and arithmetic functionality for Boolean logical and arithmetic operations. “Write” or “Read” requests which are received from data generating entities, contain a Physical Address field identifying an address of a data block to be retrieved from the external memory, and a Control bits field identifying a type of computational operation to be performed. The DCE memory controller decodes the request, and applies the desired compute operation autonomically to the contents of an external memory and/or the incoming data without burdening the CPU with the computational activity.
Abstract translation: 数据存储环境中的分布式计算引擎（DCE）内存控制器包含用于布尔逻辑和算术运算的嵌入式逻辑和算术功能。 从数据生成实体接收到的“写入”或“读取”请求包含标识要从外部存储器检索的数据块的地址的物理地址字段，以及标识要执行的计算操作的类型的控制位字段 。 DCE存储器控制器对请求进行解码，并且将所需的计算操作自主地应用于外部存储器和/或输入数据的内容，而不会使CPU具有计算活动。
-
8.发明授权公开(公告)号：US09900397B1
公开(公告)日：2018-02-20
申请号：US15016774
申请日：2016-02-05
Applicant: DATADIRECT NETWORKS, INC.
Inventor： Jason M. Cope , Michael J. Piszczek , Pavan Kumar Uppu
CPC classification number: H04L67/2842 , G06F3/0622 , G06F3/0647 , G06F3/067 , G06F3/0688 , H04L63/08 , H04L63/10 , H04L67/1097 , H04L67/32
Abstract: The system and routine for data caching leverages the properties of Network-Attached Non-Volatile Memories (NANVMs) to provide virtualized secure node-local storage services to the network users with reduced data movement across the NANVMs. The caching routine reserves storage resources (storage partitions) on NANVM devices, migrates data required for the target application execution to the allocated storage partitions, and directs the network clients to dynamically “mount” to the storage partitions based on application data requirements. Only those clients and applications that present valid credentials and satisfactory computing capabilities can access the data in the specific storage partitions. Several clients can have an access to the same storage partitions without duplication or replicating the data. A Global Data Indexing sub-system supports the efficient operation of the subject system. The Global Data Indexing Sub-System provides mapping between the storage partitions, data sets, applications, client nodes, as well as their credentials/capabilities.
-
公开(公告)号：US09639457B1
公开(公告)日：2017-05-02
申请号：US13722171
申请日：2012-12-20
Applicant: DATADIRECT NETWORKS, INC.
Inventor： Michael J. Piszczek , Jason M. Cope , William J. Harker , Thomas E. Fugini , Pavan Kumar Uppu
CPC classification number: G06F12/02 , G06F11/1076 , G06F12/0246 , G06F13/16 , G06F2212/1048 , G06F2212/7207 , G06F2212/7208 , Y02D10/13
Abstract: In the data storage system the storage area network performs XOR operations on incoming data for parity generation without buffering data through a centralized RAID engine or processor. The hardware for calculating the XOR data is distributed to incrementally calculate data parity in parallel across each data channel and may be implemented as a set of FPGAs with low bandwidths to efficiently scale as the amount of storage memory increases. A host adaptively appoints data storage controllers in the storage area network to perform XOR parity operations on data passing therethrough. The system provides data migration and parity generation in a simple and effective matter and attains a reduction in cost and power consumption.
-
10.发明授权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描述符作为描述奇偶校验组成员的驻留和重播状态的状态的收集点。
-
-
-
-
-
-
-
-
-
Search Results
15
records
(took 0.018 seconds)
