公开(公告)号：US20150019598A1

公开(公告)日：2015-01-15

申请号：US14498917

申请日：2014-09-26

Applicant: DataDirect Networks, Inc.

Inventor： Jan Olderdissen ,  Dan Olster ,  Craig Robertson ,  Doug Schafer ,  Dave Fellinger

IPC: G06F11/10 ,  H04L29/08

CPC classification number: G06F17/30182 ,  G06F11/1076 ,  G06F17/30218 ,  G06F17/30864 ,  G06F2211/1038 ,  H04L67/1097

Abstract: An object based file system for storing and accessing objects is disclosed. The file system may be implemented as a method in hardware, firmware, software, or a combination thereof. The method may include receiving from an application program an object write request. A selected storage node on which to store the object may be selected, including identifying a least busy storage node and/or a least full storage node. The object and the object write request may be sent to the selected storage node. A write success message may be received from the selected storage node. The successful writing of the object may be reported to the application program.

Abstract translation: 公开了一种用于存储和访问对象的基于对象的文件系统。 文件系统可以以硬件，固件，软件或其组合的方式实现。 该方法可以包括从应用程序接收对象写入请求。 可以选择在其上存储对象的所选择的存储节点，包括识别最不繁忙的存储节点和/或最小完整存储节点。 对象和对象写入请求可以被发送到所选择的存储节点。 可以从所选择的存储节点接收写入成功消息。 对象的成功写入可能会报告给应用程序。

公开(公告)号：US20140380093A1

公开(公告)日：2014-12-25

申请号：US14482441

申请日：2014-09-10

Applicant: DataDirect Networks, Inc.

Inventor： Donald J. Molaro ,  David Fellinger ,  Adam Fried-Gintis ,  Dan Olster

IPC: G06F11/10

CPC classification number: G06F11/1088 ,  G06F3/0617 ,  G06F3/0619 ,  G06F3/0637 ,  G06F3/065 ,  G06F3/0665 ,  G06F3/067 ,  G06F11/1076 ,  G06F11/108 ,  G06F11/1096

Abstract: A resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects are calculated. Reassembly instructions are created for the data item. The data objects, parity objects and reassembly instructions are spread across nodes and zones in the storage system according to a policy for the data item. When a zone is inaccessible, a virtual zone is created and used until the intended zone is available. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions, and a virtual zone is accessed in place of a real zone when the real zone is inaccessible.

公开(公告)号：US09900397B1

公开(公告)日：2018-02-20

申请号：US15016774

申请日：2016-02-05

Applicant: DATADIRECT NETWORKS, INC.

Inventor： Jason M. Cope ,  Michael J. Piszczek ,  Pavan Kumar Uppu

IPC: H04L29/08 ,  G06F3/06 ,  H04L29/06

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.

公开(公告)号：US09792344B2

公开(公告)日：2017-10-17

申请号：US14697224

申请日：2015-04-27

Applicant: DataDirect Networks, Inc.

Inventor： Naveen Zalpuri ,  Joe Bounour

IPC: G06F17/00 ,  G06F17/30

CPC classification number: G06F17/30578 ,  G06F17/30091 ,  G06F17/30174 ,  G06F17/30212 ,  G06F17/30525 ,  G06F17/3056 ,  G06F17/30864

Abstract: Asynchronous namespace maintenance in a distributed replicated data storage system is disclosed. An access device/program serving as a front end to the distributed replicated data storage system updates a batch of updated meta data about stored data items when data items are stored in the distributed replicated data storage system. When the elapsed time since the last batch of data item meta data was stored exceeds a first threshold value or the current batch size exceeds a second threshold value, the access device/program stores the current batch of updated meta data as an object in the distributed replicated data storage system, receiving a batch object identifier for the stored batch of updated meta data, and distributes the batch object identifier to other access devices and/or access programs which retrieve the batch of updated meta data and update their namespaces.

公开(公告)号：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

IPC: G06F12/00 ,  G06F12/02

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.

公开(公告)号：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

IPC: G06F3/06 ,  G06F11/10 ,  G06F17/30

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描述符作为描述奇偶校验组成员的驻留和重播状态的状态的收集点。

公开(公告)号：US09189494B2

公开(公告)日：2015-11-17

申请号：US14498923

申请日：2014-09-26

Applicant: DataDirect Networks, Inc.

Inventor： Jan Olderdissen ,  Dan Olster ,  Craig Robertson ,  Doug Schafer ,  Dave Fellinger

IPC: G06F17/30 ,  G06F11/10 ,  H04L29/08

CPC classification number: G06F17/30182 ,  G06F11/1076 ,  G06F17/30218 ,  G06F17/30864 ,  G06F2211/1038 ,  H04L67/1097

Abstract: An object based file system for storing and accessing objects is disclosed. The file system may be implemented as a method in hardware, firmware, software, or a combination thereof. The method may include receiving from an application program an object write request. A selected storage node on which to store the object may be selected, including identifying a least busy storage node and/or a least full storage node. The object and the object write request may be sent to the selected storage node. A write success message may be received from the selected storage node. The successful writing of the object may be reported to the application program.

公开(公告)号：US20150319242A1

公开(公告)日：2015-11-05

申请号：US14270207

申请日：2014-05-05

Applicant: DataDirect Networks, Inc.

Inventor： Dan Olster ,  Adam Fried-Gintis ,  Donald J. Molaro

IPC: H04L29/08 ,  G06F17/30

CPC classification number: H04L67/1097 ,  G06F11/2094 ,  G06F16/1844 ,  G06F16/27

Abstract: A data storage system allowing for ingest of data when certain storage is unavailable is described herein. The storage system includes zones that are independent and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When data is to be stored in the data storage system according to a specified storage policy and the specified storage policy cannot be achieved, the data is stored according to a fallback storage policy. This allows a client to be able to continue executing without having to wait for a storage anomaly to be corrected or pass. After the data is stored according to a fallback storage policy, the data is at a later time stored according to the specified storage policy.

Abstract translation: 这里描述了当某些存储不可用时允许数据摄取的数据存储系统。 存储系统包括彼此独立且自主的区域。 这些区域包括独立和自主的节点。 节点包括存储设备。 当根据指定的存储策略将数据存储在数据存储系统中并且无法实现指定的存储策略时，根据后备存储策略来存储数据。 这允许客户端能够继续执行，而不必等待存储异常被更正或通过。 根据回退存储策略存储数据后，根据指定的存储策略存储数据。

公开(公告)号：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: 本文描述了用于存储数据的数据存储系统和方法。 存储系统包括第一存储节点，其被配置为向存储系统中的第一组其他存储节点发出第一传送请求，第一传送请求包括第一组其他存储器中的每一个的第一至少一个数据操作 节点并且发出至少一个其他递送请求，而所述第一递送请求保持未决，所述至少一个其他递送请求包括针对所述第一组其他存储节点中的每一个的第一提交请求。 第一节点使得响应于接收到提交指示符以及关于至少一个其他传送请求之一的传送确认，使存储系统内的第一至少一个数据操作被激活。

公开(公告)号：US09141480B2

公开(公告)日：2015-09-22

申请号：US14035913

申请日：2013-09-24

Applicant: DataDirect Networks, Inc.

Inventor： Paul Nowoczynski ,  Jason Micah Cope ,  Pavan Uppu ,  Don Molaro ,  Michael Piszczek ,  Gordon Manning

IPC: G06F11/00 ,  G06F11/14 ,  G06F11/07 ,  G06F11/30 ,  G06F17/30

CPC classification number: G06F11/141 ,  G06F11/0709 ,  G06F11/1425 ,  G06F11/1662 ,  G06F11/3006 ,  G06F17/30097

Abstract: Data storage systems and methods for storing data are described herein. The storage system includes at least two data storage nodes for storing portions of a distributed hash table and related data. After a first node attempts to complete a write request at a second node and is unable to complete the request, the first node ceases responses to interactions from other nodes. Once the first node's failure to respond has caused a sufficient number of nodes to cease responding, the nodes enter a service mode to resolve the live lock. While in live lock, the nodes determine the oldest, unfulfilled request using a system-wide logical timestamp associated with write requests. Once the oldest request is determined, a removal vote to remove the non-responsive node from the group is initiated and, if other nodes agree, the non-responsive node is removed from the group of nodes.

Abstract translation: 本文描述了用于存储数据的数据存储系统和方法。 存储系统包括用于存储分布式散列表和相关数据的部分的至少两个数据存储节点。 在第一节点尝试在第二节点上完成写请求并且不能完成该请求之后，第一节点停止对来自其他节点的交互的响应。 一旦第一个节点的响应失败导致足够数量的节点停止响应，则节点进入服务模式以解决实时锁定。 在实时锁定中，节点使用与写入请求相关联的全系统逻辑时间戳来确定最旧的未实现的请求。 一旦确定了最早的请求，则启动从组中去除非响应节点的删除投票，并且如果其他节点同意，则从该组节点中移除非响应节点。