US 11,740,972 B1
Migrating data in a vast storage network
Ravi V. Khadiwala, Bartlett, IL (US); Greg R. Dhuse, Chicago, IL (US); Manish Motwani, Chicago, IL (US); Jason K. Resch, Chicago, IL (US); and Ilya Volvovski, Chicago, IL (US)
Assigned to Pure Storage, Inc., Santa Clara, CA (US)
Filed by Pure Storage, Inc., Mountain View, CA (US)
Filed on Oct. 30, 2020, as Appl. No. 17/85,170.
Application 17/085,170 is a continuation in part of application No. 16/545,322, filed on Aug. 20, 2019, abandoned.
Application 16/545,322 is a continuation in part of application No. 16/378,652, filed on Apr. 9, 2019, granted, now 10,853,174, issued on Dec. 1, 2020.
Application 16/378,652 is a continuation of application No. 15/244,354, filed on Aug. 23, 2016, granted, now 10,353,774, issued on Jul. 16, 2019.
Application 16/545,322 is a continuation of application No. 15/167,482, filed on May 27, 2016, granted, now 10,412,165, issued on Sep. 10, 2019.
Application 15/167,482 is a continuation of application No. 14/587,781, filed on Dec. 31, 2014, granted, now 9,357,009, issued on May 31, 2016.
Application 14/587,781 is a continuation of application No. 13/105,135, filed on May 11, 2011, granted, now 8,959,597, issued on Feb. 17, 2015.
Claims priority of provisional application 62/248,752, filed on Oct. 30, 2015.
Claims priority of provisional application 61/346,203, filed on May 19, 2010.
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 11/10 (2006.01); G06F 3/06 (2006.01); H04L 67/1097 (2022.01); H03M 13/37 (2006.01); H04L 43/0876 (2022.01); H03M 13/15 (2006.01); H04L 43/0864 (2022.01); H04L 43/16 (2022.01); H04L 67/1008 (2022.01); G06F 11/20 (2006.01)
CPC G06F 11/1092 (2013.01) [G06F 3/061 (2013.01); G06F 3/064 (2013.01); G06F 3/0604 (2013.01); G06F 3/067 (2013.01); G06F 3/0611 (2013.01); G06F 3/0619 (2013.01); G06F 3/0635 (2013.01); G06F 3/0659 (2013.01); G06F 3/0665 (2013.01); G06F 3/0689 (2013.01); G06F 11/2094 (2013.01); H03M 13/1515 (2013.01); H03M 13/3761 (2013.01); H04L 43/0864 (2013.01); H04L 43/0876 (2013.01); H04L 43/16 (2013.01); H04L 67/1008 (2013.01); H04L 67/1097 (2013.01); G06F 2201/805 (2013.01)] 18 Claims
OG exemplary drawing
 
1. A method for execution by at least one processing system, the method comprising:
electronically storing, in a first storage unit of a first set of storage units, a first encoded data slice corresponding to at least one data object, wherein the first encoded data slice is dispersed storage encoded;
providing a second set of storage units, the second set of storage units including one or more additional storage units;
determining error coding dispersal storage parameters associated with the second set of storage units to have a decode threshold in common with parameters by which the first encoded data slice is dispersed storage encoded; and
migrating the first encoded data slice from the first storage unit to at least one of the one or more additional storage units of the second set of storage units, wherein the migrating is based on metadata associated with the data object, a replication factor associated with the data object, and when the error coding dispersal storage parameters associated with the second set of storage units are determined to have the decode threshold in common with the parameters by which the first encoded data slice is dispersed storage encoded.