Patents by Inventor Adam Fried-Gintis
Adam Fried-Gintis has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10516732Abstract: 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.Type: GrantFiled: May 5, 2014Date of Patent: December 24, 2019Assignee: DataDirect Networks, Inc.Inventors: Dan Olster, Adam Fried-Gintis, Donald J. Molaro
-
Publication number: 20190332409Abstract: A system having a hardware layout wizard, and a method therefore are discussed. The system according to an embodiment includes an administration system including a user interface (UI) and configured to display a visual representation of the plurality of hardware components in accordance with their logical identification; sequentially command each of the plurality of hardware components, in accordance with their respective hardware identification, to provide an output; prompt, via a display device of the administration system UI, a user to provide an identification of a selected one of the plurality of hardware components responsive to the output; and store an association between the plurality of hardware components and a plurality of logical hardware identifiers (IDs) based on the identification.Type: ApplicationFiled: April 26, 2018Publication date: October 31, 2019Applicant: Nutanix, Inc.Inventors: Adam Fried-Gintis, Manoj Kumar Agarwal, Rabi Shanker Guha, Thomas Jason Hill
-
Patent number: 9740560Abstract: A failure 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 calculated. Reassembly instructions are created for the data item. The data objects and parity objects are spread across all nodes and zones in the storage system. Reassembly instructions are also spread across the zones. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions. This provides for data resiliency while keeping the amount of storage space required relatively low.Type: GrantFiled: August 31, 2015Date of Patent: August 22, 2017Assignee: DataDirect Networks, Inc.Inventors: Donald J. Molaro, David Fellinger, Dan Olster, Adam Fried-Gintis
-
Patent number: 9223654Abstract: 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.Type: GrantFiled: September 10, 2014Date of Patent: December 29, 2015Assignee: DataDirect Networks, Inc.Inventors: Donald J. Molaro, David Fellinger, Adam Fried-Gintis, Dan Olster
-
Publication number: 20150370637Abstract: A failure 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 calculated. Reassembly instructions are created for the data item. The data objects and parity objects are spread across all nodes and zones in the storage system. Reassembly instructions are also spread across the zones. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions. This provides for data resiliency while keeping the amount of storage space required relatively low.Type: ApplicationFiled: August 31, 2015Publication date: December 24, 2015Inventors: Donald J. Molaro, David Fellinger, Dan Olster, Adam Fried-Gintis
-
Publication number: 20150319242Abstract: 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.Type: ApplicationFiled: May 5, 2014Publication date: November 5, 2015Applicant: DataDirect Networks, Inc.Inventors: Dan Olster, Adam Fried-Gintis, Donald J. Molaro
-
Patent number: 9122699Abstract: A failure 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 calculated. Reassembly instructions are created for the data item. The data objects and parity objects are spread across all nodes and zones in the storage system. Reassembly instructions are also spread across the zones. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions. This provides for data resiliency while keeping the amount of storage space required relatively low.Type: GrantFiled: December 14, 2012Date of Patent: September 1, 2015Assignee: DataDirect Networks, Inc.Inventors: Donald J. Molaro, David Fellinger, Adam Fried-Gintis, Dan Olster
-
Publication number: 20140380093Abstract: 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.Type: ApplicationFiled: September 10, 2014Publication date: December 25, 2014Inventors: Donald J. Molaro, David Fellinger, Adam Fried-Gintis, Dan Olster
-
Patent number: 8843447Abstract: 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.Type: GrantFiled: December 20, 2013Date of Patent: September 23, 2014Assignee: DataDirect Networks, Inc.Inventors: Donald J. Molaro, David Fellinger, Adam Fried-Gintis, Dan Olster
-
Publication number: 20140172930Abstract: A failure 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 calculated. Reassembly instructions are created for the data item. The data objects and parity objects are spread across all nodes and zones in the storage system. Reassembly instructions are also spread across the zones. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions. This provides for data resiliency while keeping the amount of storage space required relatively low.Type: ApplicationFiled: December 14, 2012Publication date: June 19, 2014Inventors: Donald J. Molaro, David Fellinger, Adam Fried-Gintis, Dan Olster
-
Publication number: 20140173235Abstract: 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.Type: ApplicationFiled: December 20, 2013Publication date: June 19, 2014Applicant: DataDirect Networks, Inc.Inventors: Donald J. Molaro, David Fellinger, Adam Fried-Gintis, Dan Olster