Patents by Inventor John Reinart
John Reinart 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).
-
Publication number: 20230247088Abstract: Techniques are described for providing, in a first cloud infrastructure (FCI), an adaptor associated with a service provided by the FCI. The adaptor enables the service to be requested by one or more users associated with one or more accounts in a second cloud infrastructure (SCI), where the SCI is different than the FCI. The adaptor receives a first request from a first user associated with a first account in the SCI to create a resource in the FCI. The adaptor executes a workflow to provision the resource using the service, where the workflow includes processing comprising retrieving a resource-principal that is associated with the resource and transmitting a second request to the service provided by the FCI. The second request includes the resource-principal and corresponds to creation of the resource.Type: ApplicationFiled: February 1, 2023Publication date: August 3, 2023Applicant: Oracle International CorporationInventors: Stanislav Kondratiev, Luke Francis Kearney, John Reinart
-
Patent number: 10459821Abstract: Example apparatus and methods monitor conditions in an object storage system. The conditions monitored may include a load balance measure in the system, a capacity balance measure in the system, a fault tolerance measure in the system, or a usage pattern measure in the system. A distribution plan or redistribution plan for storing or moving erasure codes in the object storage system may be determined based on the conditions. The distribution plan or the redistribution plan for the erasure codes may be updated dynamically in response to changing conditions in the object storage system. The distribution or redistribution may depend on a weighted combination of the load balance measure, the capacity balance measure, the fault tolerance measure, or the usage pattern measure so that responding to one sub-optimal condition (e.g., load imbalance) does not create a different sub-optimal condition (e.g., unacceptable fault tolerance).Type: GrantFiled: June 23, 2017Date of Patent: October 29, 2019Assignee: Quantum CorporationInventor: John Reinart
-
Patent number: 10048864Abstract: Example apparatus and methods monitor conditions in a tiered storage system. The conditions monitored may include the availability of different numbers and types of devices including an erasure code based object storage system. The conditions monitored may also include the availability and type of devices available to the erasure code based object storage system. A redundancy policy for storing an item using the erasure code based object storage system may be determined based on the conditions. Erasure codes associated with the item may then be stored in the erasure code based object storage system as controlled, at least in part, by the redundancy policy. The redundancy policy for the erasure codes may be updated dynamically in response to changing conditions on the tiered storage system.Type: GrantFiled: November 30, 2016Date of Patent: August 14, 2018Assignee: Quantum CorporationInventor: John Reinart
-
Patent number: 9798617Abstract: Example apparatus and methods produce a set of rateless erasure codes (e.g., fountain codes) for a file stored in a primary data store (e.g., hard drive) or in an archive system. The archive system may store the file in a redundant array of independent disks (RAID). A first subset of the rateless erasure codes are stored in an object storage using a synchronous protocol. A second subset of rateless erasure codes are stored in the object storage using an asynchronous protocol. The object storage system may inform the archive system when desired redundancy has been achieved or when desired redundancy has been lost. The archive system may buffer rateless erasure codes before providing the codes to the object storage to improve performance. A failure in the archive system or object storage system may be mitigated by retaining the file in the primary data store until the desired redundancy is achieved.Type: GrantFiled: April 4, 2016Date of Patent: October 24, 2017Assignee: Quantum CorporationInventor: John Reinart
-
Publication number: 20170288702Abstract: Example apparatus and methods monitor conditions in an object storage system. The conditions monitored may include a load balance measure in the system, a capacity balance measure in the system, a fault tolerance measure in the system, or a usage pattern measure in the system. A distribution plan or redistribution plan for storing or moving erasure codes in the object storage system may be determined based on the conditions. The distribution plan or the redistribution plan for the erasure codes may be updated dynamically in response to changing conditions in the object storage system. The distribution or redistribution may depend on a weighted combination of the load balance measure, the capacity balance measure, the fault tolerance measure, or the usage pattern measure so that responding to one sub-optimal condition (e.g., load imbalance) does not create a different sub-optimal condition (e.g., unacceptable fault tolerance).Type: ApplicationFiled: June 23, 2017Publication date: October 5, 2017Inventor: John Reinart
-
Patent number: 9727437Abstract: Example apparatus and methods monitor conditions in an object storage system. The conditions monitored may include a load balance measure in the system, a capacity balance measure in the system, a fault tolerance measure in the system, or a usage pattern measure in the system. A distribution plan or redistribution plan for storing or moving erasure codes in the object storage system may be determined based on the conditions. The distribution plan or the redistribution plan for the erasure codes may be updated dynamically in response to changing conditions in the object storage system. The distribution or redistribution may depend on a weighted combination of the load balance measure, the capacity balance measure, the fault tolerance measure, or the usage pattern measure so that responding to one sub-optimal condition (e.g., load imbalance) does not create a different sub-optimal condition (e.g., unacceptable fault tolerance).Type: GrantFiled: February 18, 2014Date of Patent: August 8, 2017Assignee: Quantum CorporationInventor: John Reinart
-
Publication number: 20170083241Abstract: Example apparatus and methods monitor conditions in a tiered storage system. The conditions monitored may include the availability of different numbers and types of devices including an erasure code based object storage system. The conditions monitored may also include the availability and type of devices available to the erasure code based object storage system. A redundancy policy for storing an item using the erasure code based object storage system may be determined based on the conditions. Erasure codes associated with the item may then be stored in the erasure code based object storage system as controlled, at least in part, by the redundancy policy. The redundancy policy for the erasure codes may be updated dynamically in response to changing conditions on the tiered storage system.Type: ApplicationFiled: November 30, 2016Publication date: March 23, 2017Inventor: John Reinart
-
Publication number: 20170083244Abstract: Example apparatus and methods distribute ranges or erasure codes associated with ranges to reduce or minimize the impact of a single point of failure in an object store. Erasure codes associated with related ranges to be stored in an object store may be accessed and selectively distributed to different storage devices associated with the object store. The erasure codes may be distributed according to a distribution plan so that an unavailability of one storage device will cause less than all of the related ranges to become unavailable. Example apparatus and methods may also provide a partial GET operation that will retrieve erasure codes associated with less than an entire object or with less than all possible ranges for an object. The partial GET operation may facilitate reconstructing less than an entire object, which may be valuable in, for example, weblog analytics.Type: ApplicationFiled: December 6, 2016Publication date: March 23, 2017Inventor: John Reinart
-
Patent number: 9584160Abstract: Example apparatus and methods monitor conditions in a tiered storage system. The conditions monitored may include the availability of different numbers and types of devices including an erasure code based object storage system. The conditions monitored may also include the availability and type of devices available to the erasure code based object storage system. A redundancy policy for storing an item using the erasure code based object storage system may be determined based on the conditions. Erasure codes associated with the item may then be stored in the erasure code based object storage system as controlled, at least in part, by the redundancy policy. The redundancy policy for the erasure codes may be updated dynamically in response to changing conditions on the tiered storage system.Type: GrantFiled: February 20, 2014Date of Patent: February 28, 2017Assignee: Quantum CorporationInventor: John Reinart
-
Patent number: 9569307Abstract: Example apparatus and methods distribute ranges or erasure codes associated with ranges to reduce or minimize the impact of a single point of failure in an object store. Erasure codes associated with related ranges to be stored in an object store may be accessed and selectively distributed to different storage devices associated with the object store. The erasure codes may be distributed according to a distribution plan so that an unavailability of one storage device will cause less than all of the related ranges to become unavailable. Example apparatus and methods may also provide a partial GET operation that will retrieve erasure codes associated with less than an entire object or with less than all possible ranges for an object. The partial GET operation may facilitate reconstructing less than an entire object, which may be valuable in, for example, weblog analytics.Type: GrantFiled: February 13, 2014Date of Patent: February 14, 2017Assignee: Quantum CorporationInventor: John Reinart
-
Patent number: 9456041Abstract: A detection that a client-server system, which is operating in a first state mode, has switched from a first use case to a second use case for accessing a property of an object associated with a server. The first state mode during the first use case reduces messaging in the client-server system as compared to using a second state mode. A determination is performed as to whether using the second state mode during the second use case would reduce messaging in the system as compared to using the first state mode. The client-server system is transitioned to the second state mode, if operating in the second state mode would reduce messaging in the client-server system as compared to operating in the first state mode for the second use case.Type: GrantFiled: August 29, 2013Date of Patent: September 27, 2016Assignee: Quantum CorporationInventor: John Reinart
-
Publication number: 20160217039Abstract: Example apparatus and methods produce a set of rateless erasure codes (e.g., fountain codes) for a file stored in a primary data store (e.g., hard drive) or in an archive system. The archive system may store the file in a redundant array of independent disks (RAID). A first subset of the rateless erasure codes are stored in an object storage using a synchronous protocol. A second subset of rateless erasure codes are stored in the object storage using an asynchronous protocol. The object storage system may inform the archive system when desired redundancy has been achieved or when desired redundancy has been lost. The archive system may buffer rateless erasure codes before providing the codes to the object storage to improve performance. A failure in the archive system or object storage system may be mitigated by retaining the file in the primary data store until the desired redundancy is achieved.Type: ApplicationFiled: April 4, 2016Publication date: July 28, 2016Inventor: John Reinart
-
Patent number: 9356628Abstract: Example apparatus and methods support reconstructing an item from a set of erasure codes (e.g., fountain codes). Information about computer resources available to support reconstructing the item may be accessed and analyzed to control the spawning of multiple computer processes to support reconstructing the item. The information may include, for example, utilization and capacity data. The information may be provided by sensor agents that monitor the resources. The multiple computer processes may operate at least partially in parallel. Resources may be identified and computer processes may be spawned until all the resources that can contribute to the reconstruction are used. In one embodiment, computer processes may be spawned until the marginal utility of spawning another process falls below a threshold.Type: GrantFiled: February 13, 2014Date of Patent: May 31, 2016Assignee: QUANTUM CORPORATIONInventor: John Reinart
-
Patent number: 9344120Abstract: Example apparatus and methods control the number of rateless erasure codes (e.g., fountain codes) stored in an object store for an item (e.g., file stored as object). The codes for the item may be generated according to an M/N policy. A first safety factor that controls how many codes are stored initially in the object store is identified. A first number of codes are then stored in the object store, where the first number is selected as a function of the first safety factor. A second safety factor for the item and a condition under which the second safety factor is to be used to control the number of codes to be stored in the object store is also identified. When the condition is detected, a second number of codes are stored in the object store, where the second number is selected as a function of the second safety factor.Type: GrantFiled: February 13, 2014Date of Patent: May 17, 2016Assignee: Quantum CorporationInventor: John Reinart
-
Patent number: 9304852Abstract: Example apparatus and methods produce a set of rateless erasure codes (e.g., fountain codes) for a file stored in a primary data store (e.g., hard drive) or in an archive system. The archive system may store the file in a redundant array of independent disks (RAID). A first subset of the rateless erasure codes are stored in an object storage using a synchronous protocol. A second subset of rateless erasure codes are stored in the object storage using an asynchronous protocol. The object storage system may inform the archive system when desired redundancy has been achieved or when desired redundancy has been lost. The archive system may buffer rateless erasure codes before providing the codes to the object storage to improve performance. A failure in the archive system or object storage system may be mitigated by retaining the file in the primary data store until the desired redundancy is achieved.Type: GrantFiled: February 13, 2014Date of Patent: April 5, 2016Assignee: Quantum CorporationInventor: John Reinart
-
Publication number: 20150236724Abstract: Example apparatus and methods monitor conditions in an object storage system. The conditions monitored may include a load balance measure in the system, a capacity balance measure in the system, a fault tolerance measure in the system, or a usage pattern measure in the system. A distribution plan or redistribution plan for storing or moving erasure codes in the object storage system may be determined based on the conditions. The distribution plan or the redistribution plan for the erasure codes may be updated dynamically in response to changing conditions in the object storage system. The distribution or redistribution may depend on a weighted combination of the load balance measure, the capacity balance measure, the fault tolerance measure, or the usage pattern measure so that responding to one sub-optimal condition (e.g., load imbalance) does not create a different sub-optimal condition (e.g., unacceptable fault tolerance).Type: ApplicationFiled: February 18, 2014Publication date: August 20, 2015Applicant: Quantum CorporationInventor: John Reinart
-
Publication number: 20150236725Abstract: Example apparatus and methods monitor conditions in a tiered storage system. The conditions monitored may include the availability of different numbers and types of devices including an erasure code based object storage system. The conditions monitored may also include the availability and type of devices available to the erasure code based object storage system. A redundancy policy for storing an item using the erasure code based object storage system may be determined based on the conditions. Erasure codes associated with the item may then be stored in the erasure code based object storage system as controlled, at least in part, by the redundancy policy. The redundancy policy for the erasure codes may be updated dynamically in response to changing conditions on the tiered storage system.Type: ApplicationFiled: February 20, 2014Publication date: August 20, 2015Applicant: Quantum CorporationInventor: John Reinart
-
Publication number: 20150229339Abstract: Example apparatus and methods control the number of rateless erasure codes (e.g., fountain codes) stored in an object store for an item (e.g., file stored as object). The codes for the item may be generated according to an M/N policy. A first safety factor that controls how many codes are stored initially in the object store is identified. A first number of codes are then stored in the object store, where the first number is selected as a function of the first safety factor. A second safety factor for the item and a condition under which the second safety factor is to be used to control the number of codes to be stored in the object store is also identified. When the condition is detected, a second number of codes are stored in the object store, where the second number is selected as a function of the second safety factor.Type: ApplicationFiled: February 13, 2014Publication date: August 13, 2015Inventor: John Reinart
-
Publication number: 20150229338Abstract: Example apparatus and methods support reconstructing an item from a set of erasure codes (e.g., fountain codes). Information about computer resources available to support reconstructing the item may be accessed and analyzed to control the spawning of multiple computer processes to support reconstructing the item. The information may include, for example, utilization and capacity data. The information may be provided by sensor agents that monitor the resources. The multiple computer processes may operate at least partially in parallel. Resources may be identified and computer processes may be spawned until all the resources that can contribute to the reconstruction are used. In one embodiment, computer processes may be spawned until the marginal utility of spawning another process falls below a threshold.Type: ApplicationFiled: February 13, 2014Publication date: August 13, 2015Inventor: John Reinart
-
Publication number: 20150227416Abstract: Example apparatus and methods produce a set of rateless erasure codes (e.g., fountain codes) for a file stored in a primary data store (e.g., hard drive) or in an archive system. The archive system may store the file in a redundant array of independent disks (RAID). A first subset of the rateless erasure codes are stored in an object storage using a synchronous protocol. A second subset of rateless erasure codes are stored in the object storage using an asynchronous protocol. The object storage system may inform the archive system when desired redundancy has been achieved or when desired redundancy has been lost. The archive system may buffer rateless erasure codes before providing the codes to the object storage to improve performance. A failure in the archive system or object storage system may be mitigated by retaining the file in the primary data store until the desired redundancy is achieved.Type: ApplicationFiled: February 13, 2014Publication date: August 13, 2015Inventor: John Reinart