20240086287.MECHANISM FOR INCREASING DATA PROTECTION IN STORAGE FAILURE SCENARIOS simplified abstract (samsung electronics co., ltd.)
Contents
- 1 MECHANISM FOR INCREASING DATA PROTECTION IN STORAGE FAILURE SCENARIOS
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 MECHANISM FOR INCREASING DATA PROTECTION IN STORAGE FAILURE SCENARIOS - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Potential Applications
- 1.6 Problems Solved
- 1.7 Benefits
- 1.8 Potential Commercial Applications
- 1.9 Possible Prior Art
- 1.10 Original Abstract Submitted
MECHANISM FOR INCREASING DATA PROTECTION IN STORAGE FAILURE SCENARIOS
Organization Name
Inventor(s)
Sean Christopher Kocol of Vista CA (US)
MECHANISM FOR INCREASING DATA PROTECTION IN STORAGE FAILURE SCENARIOS - A simplified explanation of the abstract
This abstract first appeared for US patent application 20240086287 titled 'MECHANISM FOR INCREASING DATA PROTECTION IN STORAGE FAILURE SCENARIOS
Simplified Explanation
The method described in the abstract involves generating a new storage target assignment for a placement group (pg) based on the last started set, which includes the current set of storage targets assigned for the pg, and the last clean set, which includes the set of storage targets assigned for the pg at the last time all data stores in its acting set of storage targets were online and up-to-date. The method also includes rebalancing or adding new data stores in the last started set, storing new data stores in a supplemental clean list, and performing update operations on the last started set based on the supplemental clean list.
- Explanation of the patent/innovation:
- Generating a new storage target assignment for a placement group based on the last started and last clean sets. - Rebalancing or adding new data stores in the last started set. - Storing new data stores in a supplemental clean list. - Performing update operations on the last started set based on the supplemental clean list.
Potential Applications
This technology could be applied in data storage systems, cloud computing environments, and distributed computing systems.
Problems Solved
- Efficient management of storage targets for placement groups. - Ensuring data stores are online and up-to-date.
Benefits
- Improved performance and reliability of storage systems. - Automated rebalancing and addition of data stores.
Potential Commercial Applications
Optimizing storage target assignments in cloud computing services.
Possible Prior Art
There may be prior art related to storage target assignment algorithms in distributed systems.
Unanswered Questions
How does this method handle failures in storage targets during the rebalancing process?
The abstract does not provide details on how failures in storage targets are managed during the rebalancing process. This could be a crucial aspect to consider for the overall reliability of the system.
What criteria are used to determine which data stores are added to the supplemental clean list?
The abstract does not specify the criteria used to select which data stores are stored in the supplemental clean list. Understanding this selection process could provide insights into the overall efficiency of the method.
Original Abstract Submitted
a method includes generating a new storage target assignment for a placement group (pg) as a last started set, the pg including the last started set and a last clean set, wherein the last started set includes a current set of storage targets assigned for the pg, and the last clean set includes a set of storage targets assigned for the pg at the last time all data stores in its acting set of storage targets were online and up-to-date; performing a process to rebalance or add new data stores in the last started set; storing one or more of the new data stores in a supplemental clean list; and performing one or more update operations on the last started set, based on the supplemental clean list.
